Circles through two points that always enclose many points
From MaRDI portal
Der Autor zeigt folgendes Ergebnis: Gegeben sei eine Menge von n Punkten der euklidischen Ebene. Dann gibt es stets zwei Punkte dieser Menge, so daß jeder offene Kreis durch diese mindestens \(n(1/2- 1/\sqrt{12})+O(1)\approx n/4\cdot 7\) Punkte einschließt. Dieses Resultat verbessert eine Schranke von \textit{R. Hayward} [Discrete Comput. Geom. 4, No.3, 263-264 (1989; Zbl 0673.52008)]. Der verwickelte und interessante Beweis benutzt Abzählungsformeln für Voronoi Diagramme.
Recommendations
Cited in
(20)- Depth of segments and circles through points enclosing many points: A note
- New results on lower bounds for the number of \((\leq k)\)-facets
- Point sets with many unit circles
- Some extremal results on circles containing points
- A note on the circle containment problem
- Randomized incremental construction of Delaunay and Voronoi diagrams
- A combinatorial property of convex sets
- On circles enclosing many points
- Two almost-circles, and two real ones
- Tukey depth histograms
- Circular inclusion
- New results on lower bounds for the number of (⩽ k)-facets
- On Center Regions and Balls Containing Many Points
- Proximity graphs: {\(E, \delta\)}, {\(\Delta\)}, {\(\chi\)} and {\(\omega\)}
- New algorithms and bounds for halving pseudolines
- Deep cliques in point sets
- On geodesic disks enclosing many points
- Polychromatic coloring of tuples in hypergraphs
- Order-k Voronoi diagrams of sites with additive weights in the plane
- An optimal generalization of the colorful Carathéodory theorem
This page was built for publication: Circles through two points that always enclose many points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1263084)
