DelaunayTriangulationQ
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.
Details and Options
- 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.
Text
Wolfram Research (2012), DelaunayTriangulationQ, Wolfram Language function, https://reference.wolfram.com/language/ComputationalGeometry/ref/DelaunayTriangulationQ.html.
CMS
Wolfram Language. 2012. "DelaunayTriangulationQ." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ComputationalGeometry/ref/DelaunayTriangulationQ.html.
APA
Wolfram Language. (2012). DelaunayTriangulationQ. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ComputationalGeometry/ref/DelaunayTriangulationQ.html