An improvement of the lower bound on the maximum number of halving lines in planar sets with 32 points.
Javier RodrigoM. Dolores LópezPublished in: Electron. Notes Discret. Math. (2018)
Keyphrases
- maximum number
- lower bound
- upper bound
- single point
- line drawings
- branch and bound algorithm
- optimal solution
- vanishing points
- feature points
- worst case
- objective function
- sample complexity
- random sampling
- branch and bound
- line segments
- projective space
- convex hull
- planar scenes
- camera calibration
- straight line
- endpoints
- data points
- np hard
- learning algorithm
- geometric invariants
- simple polygon
- minimal subsets
- lower and upper bounds
- point sets
- point correspondences
- multi view
- d objects
- significant improvement