Separating a Voronoi diagram via local search

DOI10.4230/LIPICS.SOCG.2016.18MaRDI QIDQ3132852zbMATH OpenFDO

Authors Vijay V. S. P. Bhattiprolu, Sariel Har-Peled

Publication date 30 January 2018

Full work available at URL https://arxiv.org/abs/1401.0174

zbMATH Keywords

local searchapproximationDelaunay triangulationVoronoi diagramsseparatorsgeometric hitting setmeshing

Mathematics Subject Classification ID

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

Recommendations

• Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. II: Algorithms for constructing Voronoi diagrams based on the theory of optimal set partitioning
• scientific article; zbMATH DE number 4098181
• Recognizing Voronoi Diagrams with Linear Programming
• Concrete and abstract Voronoi diagrams
• From proximity to utility: a Voronoi partition of Pareto optima

Cited in

(4)

• Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics
• Packing and covering with non-piercing regions
• Parameterized approximation algorithms and lower bounds for \(k\)-center clustering and variants
• scientific article; zbMATH DE number 1944340 (Why is no real title available?)

This page was built for publication: Separating a Voronoi diagram via local search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132852)