Convex and discrete geometry Tilings Concept
Delaunay triangulation
Summary
A Delaunay triangulation of a finite point set in the plane is a special triangulation of it. The circumcircle of each of its triangles has no point of the set inside. Among all triangulations of the set, it maximizes the smallest angle, so it avoids thin triangles. It is the geometric dual of the Voronoi diagram, and it is widely used for meshes.
Further reading
About this page
| Tag | 259Y10BYJC |
|---|---|
| URI | m2://259Y10BYJC |
| Kind | concept |
| Writing | W0 stub |
| MSC | 52C99, 68U05 |
| Specializes | Triangulation of a point set |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- 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.