Voronoï diagrams
Triangle produces the
Voronoï diagram
of a point set when the
-v switch is used. In this example, the file
dots.node is input, and its
Voronoï diagram
is written to
dots.1.v.node and
dots.1.v.edge. These are ordinary
.node and
.edge format files, containing the
Voronoï vertices and edges, respectively. Some of the edges
are infinite rays.
triangle -v dots
The result will be a valid Voronoï diagram only if Triangle's
output is a true Delaunay triangulation. The Voronoï output
will usually be meaningless (and may contain crossing edges and other
pathology) if the output is a
constrained Delaunay triangulation or
has holes or concavities. (No such problems arise with convex
conforming Delaunay triangulations
with no holes.)
Return to Triangle home page.
jrs@cs.cmu.edu