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