On Center Regions and Balls Containing Many Points

DOI10.1007/978-3-540-69733-6_36zbMath1148.68554OpenAlexW1567721594MaRDI QIDQ3511348

Marek Sulovský, Shakhar Smorodinsky, Uli Wagner

Publication date: 10 July 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_36

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

An optimal generalization of the colorful Carathéodory theorem ⋮ On a problem of Danzer ⋮ Depth of segments and circles through points enclosing many points: A note ⋮ On circles enclosing many points ⋮ On a Problem of Danzer

Cites Work

• Unnamed Item
• 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
• In between \(k\)-sets, \(j\)-facets, and \(i\)-faces: \((i,j)\)-partitions
• New lower bounds for the number of \((\leq k)\)-edges and the rectilinear crossing number of \(K_{n}\)
• A lower bound for the rectilinear crossing number
• Algorithms for center and Tverberg points
• Entering and leaving \(j\)-facets