Recognizing Voronoi Diagrams with Linear Programming

DOI10.1287/IJOC.4.4.369MaRDI QIDQ4024309zbMATH OpenOpenAlexFDO

Authors David 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

recognizingVoronoi diagrams

Mathematics Subject Classification ID

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

Recommendations

• Voronoi diagrams and arrangements
• scientific article; zbMATH DE number 1424293
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• scientific article; zbMATH DE number 4098181
• scientific article; zbMATH DE number 4051001

Cited in

(16)

• Generatrissa: the problems of Maxwell and Voronoi
• Delaunay and Voronoi tessellations and minimal simple cycles in triangular region and regular-3 undirected planar graphs
• On the recognition and reconstruction of weighted Voronoi diagrams and bisector graphs
• A novel point inclusion test for convex polygons based on Voronoi tessellations
• 3-D Voronoi tessellation algorithms
• Logistic biplot for nominal data
• Power diagram detection with applications to information elicitation
• Voronoi cells via linear inequality systems
• A new 2D tessellation for angle problems: the polar diagram
• Fully inverse parametric linear/quadratic programming problems via convex liftings
• Fitting Voronoi diagrams to planar tesselations
• Fitting spherical Laguerre Voronoi diagrams to real-world tessellations using planar photographic images
• Separating a Voronoi diagram via local search
• Solving linear programming with constraints unknown
• Computing Voronoi adjacencies in high dimensional spaces by using linear programming
• Diverse partitions of colored points

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

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