Separating a Voronoi diagram via local search
From MaRDI portal
Publication:3132852
DOI10.4230/LIPICS.SOCG.2016.18zbMATH Open1387.68240arXiv1401.0174MaRDI QIDQ3132852FDOQ3132852
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
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
local searchapproximationDelaunay triangulationVoronoi diagramsseparatorsgeometric hitting setmeshing
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cited In (4)
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)