On Center Regions and Balls Containing Many Points
From MaRDI portal
Publication:3511348
Recommendations
Cites work
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- scientific article; zbMATH DE number 2145237 (Why is no real title available?)
- scientific article; zbMATH DE number 2103167 (Why is no real title available?)
- A combinatorial result about points and balls in Euclidean space
- A combinatorial result on points and circles on the plane
- A lower bound for the rectilinear crossing number
- A note on the circle containment problem
- Algorithms for center and Tverberg points
- Applications of random sampling in computational geometry. II
- Circles through two points that always enclose many points
- Entering and leaving \(j\)-facets
- 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}\)
- Some extremal results on circles containing points
Cited in
(7)- On a problem of Danzer
- scientific article; zbMATH DE number 2103167 (Why is no real title available?)
- Depth of segments and circles through points enclosing many points: A note
- On a problem of Danzer
- An optimal generalization of the colorful Carathéodory theorem
- Containment problems in high-dimensional spaces
- On circles enclosing many points
This page was built for publication: On Center Regions and Balls Containing Many Points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511348)