Triangulation (advanced geometry)
- Triangulation (advanced geometry)
In advanced geometry, in the most general meaning, triangulation is a subdivision of a geometric object into simplices. In particular, in the plane it is a subdivision into triangles, hence the name.
Different branches of geometry use slightly differing definitions of the term.
A triangulation T of is a subdivision of into (n+1)-dimensional simplices such that:
#any two simplices in T intersect in a common face or not at all;
#any bounded set in intersects only finitely many simplices in T.
A triangulation of a discrete set of points is a subdivision of the convex hull of the points into simplices such that any two simplices intersect in a common face or not at all and the set of points that are vertices of the subdividing simplices coincides with . The Delaunay Triangulation is a famous triangulation of a set of points where the circum-hypersphere of each simplex contains none of the points.
See also
* Pseudotriangulation
Wikimedia Foundation.
2010.
Look at other dictionaries:
Triangulation (disambiguation) — Triangulation refers to measurement by using triangles. The term triangulation may also refer to:Mathematics and computer science*Subdivisions of spaces into triangles or higher dimensional simplices: **triangulation (advanced geometry), division … Wikipedia
List of books in computational geometry — This is a list of books in computational geometry. There are two major, largely nonoverlapping categories: *Combinatorial computational geometry, which deals with collections of discrete objects or defined in discrete terms: points, lines,… … Wikipedia
Differential geometry of surfaces — Carl Friedrich Gauss in 1828 In mathematics, the differential geometry of surfaces deals with smooth surfaces with various additional structures, most often, a Riemannian metric. Surfaces have been extensively studied from various perspectives:… … Wikipedia
Pitteway triangulation — In computational geometry, a Pitteway triangulation is a point set triangulation in which the nearest neighbor of any point p within the triangulation is one of the vertices of the triangle containing p .Alternatively, it is a Delaunay… … Wikipedia
List of mathematics articles (T) — NOTOC T T duality T group T group (mathematics) T integration T norm T norm fuzzy logics T schema T square (fractal) T symmetry T table T theory T.C. Mits T1 space Table of bases Table of Clebsch Gordan coefficients Table of divisors Table of Lie … Wikipedia
Polygon mesh — A polygon mesh or unstructured grid is a collection of vertices, edges and faces that defines the shape of a polyhedral object in 3D computer graphics and solid modeling. The faces usually consist of triangles, quadrilaterals or other simple… … Wikipedia
General relativity — For a generally accessible and less technical introduction to the topic, see Introduction to general relativity. General relativity Introduction Mathematical formulation Resources … Wikipedia
MOHID Water Modelling System — MOHID is short for Modelo Hidrodinâmico which is Hydrodynamic Model in portuguese. MOHID Water Modelling System is a modular (see Modular programming) finite volumes (Finite volume method)water modelling system written in ANSI Fortran95 using an… … Wikipedia
Loop quantum gravity — Not to be confused with the path integral formulation of LQG, see spin foam. This article is about LQG in its Canonical formulation.. Beyond the Standard Model … Wikipedia
Alhazen — For the Moon crater, see Alhazen (crater). For the asteroid, see 59239 Alhazen. Alhazen Alhazen (Ibn al Haytham) … Wikipedia