Computing the Convex Hull in the Euclidean Plane in Linear Expected Time.
Karl Heinz BorgwardtNorbert GaffkeMichael JüngerGerhard ReineltPublished in: Applied Geometry And Discrete Mathematics (1990)
Keyphrases
- convex hull
- euclidean plane
- linear inequalities
- totally unimodular
- convex sets
- feasible solution
- point sets
- continuous variables
- convex polyhedra
- extreme points
- mixed integer
- computational geometry
- minimum distance
- simple polygon
- finite set of points
- feature selection
- recursive algorithm
- linear constraints
- feature space
- bayesian networks