 |
COMPUTATIONAL GEOMETRY PACKAGE SYMBOL
DelaunayTriangulation
yields the planar Delaunay triangulation of the points 
.
Details
- To use
, you first need to load the Computational Geometry Package using Needs["ComputationalGeometry`"]. - The Delaunay triangulation is represented by a vertex adjacency list, one entry for each unique point
indicating the adjacent vertices in counterclockwise order.
