Computation of Voronoi Diagrams and Delaunay Triangulation via Parametric Linear Programming

This note illustrates how Voronoi diagrams and Delaunay triangula- tions of point sets can be computed by applying parametric linear pro- gramming techniques. We specify parametric linear programming prob- lems that yield the Delaunay triangulation or the Voronoi Diagram of an arbitrary set of points S in Rn.


Year:
2004
Publisher:
Zurich, ETH
Laboratories:




 Record created 2011-10-25, last modified 2018-01-28

External link:
Download fulltext
Publisher's version
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)