Delaunay Triangulation
Represent and interact with Delaunay triangulations
A Delaunay triangulation is a type of triangulation that reduces the number of narrow
triangles and does not depend on vertex ordering. You can create a Delaunay triangulation with
the delaunay
and delaunayn
functions, or create a delaunayTriangulation
object that has object functions for computing geometric
quantities. You can visualize the triangulation and work with STL files to write triangulation
data.
Functions
Topics
- Working with Delaunay Triangulations
This topic explains Delaunay triangulation and how to create one.
- Creating and Editing Delaunay Triangulations
This example shows how to create, edit, and query Delaunay triangulations using the
delaunayTriangulation
class.