 |
DelaunayTriangulationQ
gives True if the triangulation of the points 
represented by the vertex adjacency list val is a Delaunay triangulation and False otherwise.
takes hull to be the convex hull index list.
更多信息
- To use
, 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.
