Depth of segments and circles through points enclosing many points: A note
From MaRDI portal
Publication:1005330
DOI10.1016/j.comgeo.2008.07.001zbMath1157.05018arXiv0803.1088OpenAlexW2058350438MaRDI QIDQ1005330
Publication date: 9 March 2009
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0803.1088
Polyhedra and polytopes; regular figures, division of spaces (51M20) Combinatorial aspects of finite geometries (05B25)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A combinatorial result on points and circles on the plane
- 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
- Applications of random sampling in computational geometry. II
- On Center Regions and Balls Containing Many Points
- On k-Nearest Neighbor Voronoi Diagrams in the Plane