Category
page 1Triangulation (geometry)
Delaunay triangulation
triangulation method named after Boris Delaunay
simplicial complex
a geometrical object (set composed of points, line segments, triangles, and their n-dimensional counterpart) useful to describe certain topological spaces
triangulated irregular network
geometric data structure
polygon triangulation
decomposition of a simple polygon into triangles
triangulation
subdivision of a planar object into triangles
Sperner's lemma
lemma that every Sperner coloring of a triangulated simplex contains a properly colored simplex
mesh generation
dividing a geometric space into discrete cells
triangle mesh
polygon mesh composed of triangles
Bowyer–Watson algorithm
Computation method in geometry
point set triangulation
division of the convex hull of a point set into triangles using only that set as triangle vertices
Barycentric subdivision
way of dividing a simplicial complex