Journal of Applied and Industrial Mathematics · 2016 · 35 citations · 14 references
ComputingComputer ScienceMathematicsComputational GeometryOptimizationCombinatorial OptimizationGeometric OptimizationGeometry ProcessingVoronoi DiagramsDiscrete Voronoi DiagramsVoronoi Polygons
We propose a general approach to solving some vector subset problems in a Euclidean space that is based on higher-order Voronoi diagrams. In the case of a fixed space dimension, this approach allows us to find optimal solutions to these problems in polynomial time which is better than the runtime of available algorithms.
14
Michael Ian Shamos, Dan Hoey · 1975 · 1.1K citations
The densest hemisphere problem
David Johnson, F. P. Preparata · Theoretical Computer Science · 1978 · 159 citations
Finding k points with minimum diameter and related problems
Alok Aggarwal, Hiroshi Imai, Naoki Katoh et al. · Journal of Algorithms · 1991 · 141 citations
On Approximating the Depth and Related Problems
Boris Aronov, Sariel Har-Peled · SIAM Journal on Computing · 2008 · 123 citations