In geometry, a triangulation is a subdivision of a planar object into triangles, and by extension the subdivision of a higher-dimension geometric object...

In computational geometry, a Delaunay triangulation or Delone triangulation of a set of points in the plane subdivides their convex hull into triangles...

In computational geometry, polygon triangulation is the partition of a polygonal area (simple polygon) P into a set of triangles, i.e., finding a set...

time algorithm for the MinMax angle triangulation. Proceedings of the sixth annual symposium on Computational geometry. SCG '90. ACM. pp. 44–52. CiteSeerX 10...

In trigonometry and geometry, triangulation is the process of determining the location of a point by forming triangles to the point from known points...

In mathematics, triangulation describes the replacement of topological spaces with simplicial complexes by the choice of an appropriate homeomorphism...

In computational geometry, a constrained Delaunay triangulation is a generalization of the Delaunay triangulation that forces certain required segments...

points to the geometry of an input to be meshed, in a way that causes the Delaunay triangulation or constrained Delaunay triangulation of the augmented...

Delaunay triangulations Marching triangles: reconstruct two-dimensional surface geometry from an unstructured point cloud Polygon triangulation algorithms:...

In computational geometry and computer science, the minimum-weight triangulation problem is the problem of finding a triangulation of minimal total edge...

any three mutually tangent convex sets. A pseudotriangulation (pseudo-triangulations) is a partition of a region of the plane into pseudotriangles, and a...

In computational geometry, the Bowyer–Watson algorithm is a method for computing the Delaunay triangulation of a finite set of points in any number of...

In computational geometry, a fan triangulation is a simple way to triangulate a polygon by choosing a vertex and drawing edges to all of the other vertices...

University of Bern David Eppstein's Geometry in Action, Mesh Generation Jonathan Shewchuk's Meshing and Triangulation in Graphics, Engineering, and Modeling...

one of its vertices. Pure simplicial complexes can be thought of as triangulations and provide a definition of polytopes. A facet is a maximal simplex...

flip distance between two triangulations of the same point set is the number of flips required to transform one triangulation into another. A flip removes...

polygon with three corners and three sides, one of the basic shapes in geometry. The corners, also called vertices, are zero-dimensional points while the...

on a Delaunay triangulation or constrained Delaunay. Delaunay conforming triangulations are recommended over constrained triangulations. This is because...

A kinetic triangulation data structure is a kinetic data structure that maintains a triangulation of a set of moving points. Maintaining a kinetic triangulation...

In computer vision, triangulation refers to the process of determining a point in 3D space given its projections onto two, or more, images. In order to...

mathematics, Sperner's lemma is a combinatorial result on colorings of triangulations, analogous to the Brouwer fixed point theorem, which is equivalent to...

In surveying, triangulation is the process of determining the location of a point by measuring only angles to it from known points at either end of a...

useful to replace the original spaces with simplicial complexes via triangulations: This substitution allows one to assign combinatorial invariants such...

This division is not a triangulation in the geometric sense. It is a topological triangulation, however. A quasi-triangulation may have some of the characteristics...

called a triangulation of G Triangulated graph, and a chordal completion of a graph G may be called a triangulation of G Triangulation (geometry), division...

between binary trees and triangulations of convex polygons, rotation distance is equivalent to the flip distance for triangulations of convex polygons. Rotation...

analysis on 3D random Delaunay triangulation was done by Mucke, Saias and Zhu (ACM Symposium of Computational Geometry, 1996). In both cases, a boundary...

Absolute geometry Affine geometry Algebraic geometry Analytic geometry Birational geometry Complex geometry Computational geometry Conformal geometry Constructive...

rational B-spline Point cloud Polygon mesh Triangulation (topology) Triangulation (geometry) Delaunay triangulation Triangulated irregular network v t e...

the coordinates of the two image points, a process called triangulation. The epipolar geometry is simplified if the two camera image planes coincide. In...