DelaunayTriangulationQ

As of Version 10, all the functionality of the ComputationalGeometry package is built into the Wolfram System. >>

DelaunayTriangulationQ[{{x1,y1},{x2,y2},},val]
gives True if the triangulation of the points {{x1,y1},} represented by the vertex adjacency list val is a Delaunay triangulation and False otherwise.

DelaunayTriangulationQ[{{x1,y1},{x2,y2},},val,hull]
takes hull to be the convex hull index list.

DetailsDetails

  • To use DelaunayTriangulationQ, you first need to load the Computational Geometry Package using Needs["ComputationalGeometry`"].
  • The convex hull index list hull and the elements of the vertex adjacency list val must both list vertices in counterclockwise order.