A combinatorial property of convex sets
From MaRDI portal
Publication:1355195
DOI10.1007/PL00009296zbMath0872.52003MaRDI QIDQ1355195
Jorge Urrutia, Víctor Neumann-Lara, Manuel Abellanas, Gregorio Hernández, Rolf Klein
Publication date: 23 September 1997
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Other problems of combinatorial convexity (52A37) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items (5)
The L∞ Hausdorff Voronoi Diagram Revisited ⋮ Computing the map of geometric minimal cuts ⋮ THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH ⋮ A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters ⋮ Map of Geometric Minimal Cuts for General Planar Embedding
Cites Work
- Unnamed Item
- Randomized incremental construction of abstract Voronoi diagrams
- A combinatorial property of points and ellipsoids
- A combinatorial result on points and circles on the plane
- Interval orders and circle orders
- Some extremal results on circles containing points
- A note on the circle containment problem
- A combinatorial result about points and balls in Euclidean space
- Circles through two points that always enclose many points
This page was built for publication: A combinatorial property of convex sets