DelaunayTriangulation


yields the planar Delaunay triangulation of the points .

DetailsDetails

  • 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.
New to Mathematica? Find your learning path »
Have a question? Ask support »