Convex and discrete geometry Tilings Concept
Triangulation of a point set
Summary
A triangulation of a finite set of points in the plane divides the convex hull of the set into triangles. The corners of the triangles are exactly the given points. The triangles meet edge to edge, without overlaps. Triangulations are used to build meshes, to interpolate data and to study the combinatorics of point sets.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | V0B6C6TMWD |
|---|---|
| URI | m2://V0B6C6TMWD |
| Kind | concept |
| Writing | W0 stub |
| MSC | 52C99, 68U05, 52B70 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.