On Center Regions and Balls Containing Many Points
From MaRDI portal
Publication:3511348
DOI10.1007/978-3-540-69733-6_36zbMATH Open1148.68554OpenAlexW1567721594MaRDI QIDQ3511348FDOQ3511348
Shakhar Smorodinsky, Marek Sulovský, 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
Cites Work
- Applications of random sampling in computational geometry. II
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Entering and leaving \(j\)-facets
- A combinatorial result on points and circles on the plane
- A combinatorial result about points and balls in Euclidean space
- Some extremal results on circles containing points
- Circles through two points that always enclose many points
- Algorithms for center and Tverberg points
- A note on the circle containment problem
- Title not available (Why is that?)
- In between \(k\)-sets, \(j\)-facets, and \(i\)-faces: \((i,j)\)-partitions
Cited In (6)
Recommendations
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)