Note: This page has been translated by MathWorks. Click here to see

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

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

Triangulation in 2-D or 3-D

Use `triangulation`

to create an in-memory
representation of any 2-D or 3-D triangulation data that is in matrix format, such as
the matrix output from the `delaunay`

function or other software
tools. When your data is represented using `triangulation`

, you can perform topological and geometric queries, which
you can use to develop geometric algorithms. For example, you can find the triangles or
tetrahedra attached to a vertex, those that share an edge, their circumcenters, and
other features.

To create a `triangulation`

object, use the
`triangulation`

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

`TR = triangulation(T,P)`

`TR = triangulation(T,x,y)`

`TR = triangulation(T,x,y,z)`

`barycentricToCartesian` | Convert coordinates from barycentric to Cartesian |

`cartesianToBarycentric` | Convert 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` | Query free boundary facets |

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

`nearestNeighbor` | Closest vertex |

`neighbors` | Triangle or tetrahedron neighbors |

`pointLocation` | Triangle or tetrahedron enclosing point |

`size` | Size of triangulation connectivity list |

`vertexAttachments` | Triangles or tetrahedra attached to vertex |

`vertexNormal` | Triangulation vertex normal |

Was this topic helpful?