Note: This page has been translated by MathWorks. Please click here

To view all translated materials including this page, select Japan from the country navigator on the bottom of this page.

To view all translated materials including this page, select Japan from the country navigator on the bottom of this page.

Delaunay triangulation in 2-D and 3-D

Use the `delaunayTriangulation`

object to
create a 2-D or 3-D Delaunay
triangulation from a set of points. When your points are in 2-D, you can
specify edge constraints.

You can perform a variety of topological and geometric queries on a `delaunayTriangulation`

, including any `triangulation`

query. For example, locate a facet that contains a specific
point, find the vertices of the convex hull, or compute the Voronoi Diagram.

To create a `delaunayTriangulation`

object, use the
`delaunayTriangulation`

function with input arguments that define
the triangulation's points and constrained edges.

`DT = delaunayTriangulation(P)`

`DT = delaunayTriangulation(P,C)`

`DT = delaunayTriangulation(x,y)`

`DT = delaunayTriangulation(x,y,C)`

`DT = delaunayTriangulation(x,y,z)`

`DT = delaunayTriangulation()`

creates a Delaunay triangulation from the points in `DT`

= delaunayTriangulation(`P`

)`P`

. Matrix
`P`

has 2 or 3 columns, depending on whether your points
are in 2-D or 3-D space.

specifies the edge constraints in matrix `DT`

= delaunayTriangulation(`P`

,`C`

)`C`

. In this case,
`P`

specifies points in 2-D. Each row of
`C`

defines the start and end vertex
IDs of a constrained edge.

creates
an empty Delaunay triangulation.`DT`

= delaunayTriangulation()

`convexHull` | Convex hull |

`isInterior ` | Query triangles inside Delaunay triangulation |

`voronoiDiagram` | Voronoi diagram |

`barycentricToCartesian` | Convert point coordinates from barycentric to Cartesian |

`cartesianToBarycentric` | Convert point coordinates from Cartesian to barycentric |

`circumcenter` | Circumcenter of triangle or tetrahedron |

`edgeAttachments` | Triangles or tetrahedra attached to specified edge |

`edges` | Triangulation edges |

`faceNormal` | Triangulation face normal |

`featureEdges` | Triangulation sharp edges |

`freeBoundary` | Query free boundary facets |

`incenter` | Incenter of triangle or tetrahedron |

`isConnected` | Test if two vertices are connected by edge |

`nearestNeighbor` | Vertex closest to specified location |

`neighbors` | Neighbors to specified triangle or tetrahedron |

`pointLocation` | Triangle or tetrahedron containing specified point |

`size` | Size of triangulation connectivity list |

`vertexAttachments` | Triangles or tetrahedra attached to specified vertex |

`vertexNormal` | Triangulation vertex normal |

Was this topic helpful?