Circles through two points that always enclose many points

DOI10.1007/BF00181432zbMath0687.52005OpenAlexW2014364956MaRDI QIDQ1263084

K. Appert

Publication date: 1989

Published in: Geometriae Dedicata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00181432

zbMATH Keywords

covering of point sets by circles

Mathematics Subject Classification ID

Other problems of combinatorial convexity (52A37) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Geometric constructions in real or complex geometry (51M15)

Related Items

PROXIMITY GRAPHS: E, δ, Δ, χ AND ω ⋮ A combinatorial property of convex sets ⋮ Tukey depth histograms ⋮ New results on lower bounds for the number of (⩽ k)-facets ⋮ On Center Regions and Balls Containing Many Points ⋮ An optimal generalization of the colorful Carathéodory theorem ⋮ Randomized incremental construction of Delaunay and Voronoi diagrams ⋮ New algorithms and bounds for halving pseudolines ⋮ Depth of segments and circles through points enclosing many points: A note ⋮ On circles enclosing many points ⋮ New results on lower bounds for the number of \((\leq k)\)-facets ⋮ Order-k Voronoi diagrams of sites with additive weights in the plane