DOCUMENTATION CENTER SEARCH

New to Mathematica? Find your learning path »

Computational Geometry Package >

COMPUTATIONAL GEOMETRY PACKAGE 符号

教程 »|参见 »|更多关于 »

DelaunayTriangulation

yields the planar Delaunay triangulation of the points

.

To use , you first need to load the Computational Geometry Package using .

The Delaunay triangulation is represented by a vertex adjacency list, one entry for each unique point indicating the adjacent vertices in counterclockwise order.

ConvexHull VoronoiDiagram DelaunayTriangulationQ

Computational Geometry Package

Computational Geometry Package

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

格式: HTML | CDF