Some extremal results on circles containing points

DOI10.1007/BF02187726zbMath0669.52009OpenAlexW2053323797MaRDI QIDQ1118820

S. H. Smith

Publication date: 1989

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131075

zbMATH Keywords

inequalitiesgraph theorycombinatorial problemsconvex polygonsextremum problemsn- sets

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Other problems of combinatorial convexity (52A37) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (10)

PROXIMITY GRAPHS: E, δ, Δ, χ AND ω ⋮ A combinatorial property of convex sets ⋮ On circles containing the maximum number of points ⋮ A note on the circle containment problem ⋮ On Center Regions and Balls Containing Many Points ⋮ A combinatorial property of points and balls, a colored version ⋮ Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs ⋮ Depth of segments and circles through points enclosing many points: A note ⋮ On circles enclosing many points ⋮ Minimizing the maximum sender interference by deploying additional nodes in a Wireless Sensor Network

Cites Work

• Unnamed Item
• A combinatorial result on points and circles on the plane
• A combinatorial result about points and balls in Euclidean space

This page was built for publication: Some extremal results on circles containing points