Triangulation (geometry) (original) (raw)

From Wikipedia, the free encyclopedia

Subdivision of a planar object into triangles

In geometry, a triangulation is a subdivision of a planar object into triangles, and by extension the subdivision of a higher-dimension geometric object into simplices. Triangulations of a three-dimensional volume would involve subdividing it into tetrahedra packed together.

In most instances, the triangles of a triangulation are required to meet edge-to-edge and vertex-to-vertex.

Different types of triangulations may be defined, depending both on what geometric object is to be subdivided and on how the subdivision is determined.

A triangulation T {\displaystyle T} $T$ of R d {\displaystyle \mathbb {R} ^{d}} $\mathbb {R} ^{d}$ is a subdivision of R d {\displaystyle \mathbb {R} ^{d}} $\mathbb {R} ^{d}$ into d {\displaystyle d} $d$ -dimensional simplices such that any two simplices in T {\displaystyle T} $T$ intersect in a common face (a simplex of any lower dimension) or not at all, and any bounded set in R d {\displaystyle \mathbb {R} ^{d}} $\mathbb {R} ^{d}$ intersects only finitely many simplices in T {\displaystyle T} $T$ . That is, it is a locally finite simplicial complex that covers the entire space.
A point-set triangulation, i.e., a triangulation of a discrete set of points P ⊂ R d {\displaystyle {\mathcal {P}}\subset \mathbb {R} ^{d}} ${\mathcal {P}}\subset \mathbb {R} ^{d}$ , is a subdivision of the convex hull of the points into simplices such that any two simplices intersect in a common face of any dimension or not at all and such that the set of vertices of the simplices are contained in P {\displaystyle {\mathcal {P}}} ${\mathcal {P}}$ .[1] Frequently used and studied point set triangulations include the Delaunay triangulation (for points in general position, the set of simplices that are circumscribed by an open ball that contains no input points) and the minimum-weight triangulation (the point set triangulation minimizing the sum of the edge lengths).
In cartography, a triangulated irregular network is a point set triangulation of a set of two-dimensional points together with elevations for each point. Lifting each point from the plane to its elevated height lifts the triangles of the triangulation into three-dimensional surfaces, which form an approximation of a three-dimensional landform.
A polygon triangulation is a subdivision of a given polygon into triangles meeting edge-to-edge, again with the property that the set of triangle vertices coincides with the set of vertices of the polygon.[2] Polygon triangulations may be found in linear time and form the basis of several important geometric algorithms, including a simple approximate solution to the art gallery problem. The constrained Delaunay triangulation is an adaptation of the Delaunay triangulation from point sets to polygons or, more generally, to planar straight-line graphs.
A Euclidean triangulation of a surface Σ {\displaystyle \Sigma } $\Sigma$ is a set of subset of compact spaces T α {\displaystyle T_{\alpha }} $T_{\alpha }$ of Σ {\displaystyle \Sigma } $\Sigma$ homeomorphic to a non degenerate triangle in R 2 {\displaystyle \mathbb {R} ^{2}} $\mathbb {R} ^{2}$ via f α {\displaystyle f_{\alpha }} $f_{\alpha }$ such that they cover the entire surface, the intersection on any pair of subsets is either empty, an edge or a vertex and if the intersection the intersection T α ∩ T β {\displaystyle T_{\alpha }\cap T_{\beta }} $T_{\alpha }\cap T_{\beta }$ is not empty then f α f β − 1 {\displaystyle f_{\alpha }f_{\beta }^{-1}} $f_{\alpha }f_{\beta }^{-1}$ is an isometry of the plane on that intersection.[3]
In the finite element method, triangulations are often used as the mesh (in this case, a triangle mesh) underlying a computation. In this case, the triangles must form a subdivision of the domain to be simulated, but instead of restricting the vertices to input points, it is allowed to add additional Steiner points as vertices. In order to be suitable as finite element meshes, a triangulation must have well-shaped triangles, according to criteria that depend on the details of the finite element simulation (see mesh quality); for instance, some methods require that all triangles be right or acute, forming nonobtuse meshes. Many meshing techniques are known, including Delaunay refinement algorithms such as Chew's second algorithm and Ruppert's algorithm.
In more general topological spaces, triangulations of a space generally refer to simplicial complexes that are homeomorphic to the space.[4]

The concept of a triangulation may also be generalized somewhat to subdivisions into shapes related to triangles. In particular, a pseudotriangulation of a point set is a partition of the convex hull of the points into pseudotriangles—polygons that, like triangles, have exactly three convex vertices. As in point set triangulations, pseudotriangulations are required to have their vertices at the given input points.

^ De Loera, Jesús A.; Rambau, Jörg; Santos, Francisco (2010). Triangulations, Structures for Algorithms and Applications. Vol. 25. Springer. ISBN 9783642129711.
^
^ Papadopoulos, Athanase (2007). Handbook of Teichmüller Theory. European Mathematical Society. p. 510. ISBN 9783037190296.
^ Basener, William F. (2006-10-20). Topology and Its Applications. Wiley. pp. 3–14. ISBN 978-0-471-68755-9.

Weisstein, Eric W. "Triangulation". MathWorld.