Recognizing Voronoi Diagrams with Linear Programming

DOI10.1287/ijoc.4.4.369zbMath0758.68056OpenAlexW2021751389MaRDI QIDQ4024309

David B. Hartvigsen

Publication date: 25 February 1993

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.4.4.369

zbMATH Keywords

Voronoi diagramsrecognizing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (7)

Diverse partitions of colored points ⋮ Solving Linear Programming with Constraints Unknown ⋮ Logistic biplot for nominal data ⋮ Power diagram detection with applications to information elicitation ⋮ Fitting Spherical Laguerre Voronoi Diagrams to Real-World Tessellations Using Planar Photographic Images ⋮ Fully Inverse Parametric Linear/Quadratic Programming Problems via Convex Liftings ⋮ On the recognition and reconstruction of weighted Voronoi diagrams and bisector graphs

This page was built for publication: Recognizing Voronoi Diagrams with Linear Programming