DOCUMENTATION CENTER SEARCH

Computational Geometry Package >

Computational Geometry Package Symbol

Tutorials »|See Also »|More About »

DelaunayTriangulationQ

DelaunayTriangulationQ[{{x₁, y₁}, {x₂, y₂}, ...}, val]
gives True if the triangulation of the points {{x₁, y₁}, ...} represented by the vertex adjacency list val is a Delaunay triangulation and False otherwise.

DelaunayTriangulationQ[{{x₁, y₁}, {x₂, y₂}, ...}, val, hull]
takes hull to be the convex hull index list.

MORE INFORMATION

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.

DelaunayTriangulation ConvexHull

Computational Geometry Package

Computational Geometry Package

© 2008 Wolfram Research, Inc.

Ask a question about this page | Suggest an improvement | Leave a message for the team