On circles enclosing many points

DOI10.1016/j.disc.2021.112541zbMath1469.51017arXiv1907.06601OpenAlexW3187058861WikidataQ128281213 ScholiaQ128281213MaRDI QIDQ2043403

Mercè Claverol, Clemens Huemer, Alejandra Martínez-Moraian

Publication date: 2 August 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.06601

zbMATH Keywords

discrete geometryVoronoi diagrampoint setcircle containment

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Convex sets in (2) dimensions (including convex curves) (52A10) Geometric constructions in real or complex geometry (51M15) Directed graphs (digraphs), tournaments (05C20) Euclidean geometries (general) and generalizations (51M05)

Cites Work

• Depth of segments and circles through points enclosing many points: A note
• The number of small semispaces of a finite set of points in the plane
• On `\(k\)-sets' in the plane
• 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
• Improved bounds for planar \(k\)-sets and related problems
• Applications of random sampling in computational geometry. II
• On circles containing the maximum number of points
• A combinatorial property of points and balls, a colored version
• On Center Regions and Balls Containing Many Points
• The Number of Halving Circles
• On k-Nearest Neighbor Voronoi Diagrams in the Plane
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On circles enclosing many points