Delaunay triangulation


Also found in: Acronyms, Wikipedia.

Delaunay triangulation

(mathematics, graphics)
(After B. Delaunay) For a set S of points in the Euclidean plane, the unique triangulation DT(S) of S such that no point in S is inside the circumcircle of any triangle in DT(S). DT(S) is the dual of the voronoi diagram of S.
Mentioned in ?
References in periodicals archive ?
The main techniques of converting these point clouds are for now Delaunay triangulation, alpha shapes and marching cubes.
Moreover, for each area, the proposed deployment algorithm has been initially compared with three other basic algorithms well-known in literature: a mesh based algorithm [8], a pattern based algorithm [13], and a Delaunay Triangulation (DT) based algorithm [26].
In 2011, Morrison used triangle refinement through a constrained Delaunay triangulation (CDT) to improve the skeletonization method [29], and Baga [30] proposed another improvement.
In this research, these techniques and some taken from image processing are applied, some of these navigation strategies have been studied by the research group to check its performance and behavior; in the near future comparisons will be made with each of them, in this specific job we choose a combination of Voronoi diagrams with the use of the Delaunay triangulation, implementation and simulation.
Minutiae triplets are extracted by using Delaunay triangulation.
Otherwise, let T' be the Delaunay triangulation of [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].
The Delaunay triangulation associates in such a conjunction all of the points into triangles, such that a circle circums\cribed on each of the triangles does not contain any other point (the criterion of the circle).
The Delaunay triangulation is a good approximation of well sampled surface S from topological and geometrical points of view.
For the uniform mesh and the Delaunay triangulation computations, we observe from Table 2.
Letscher, Delaunay triangulations and Voronoi diagrams for Riemannian manifolds, Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 341-349, 2000.
Parameters Qt, Qbb, Qc, Qz were used to triangulate all non-simplicial facets before generating results, to scale the last coordinate to [0,m] for Delaunay, to keep coplanar points with nearest facet and to add a point above the paraboloid of lifted sites for a Delaunay triangulation (Barber C, 2002).
The authors imported the Delaunay triangulation Java class developed and maintained by Joseph O'Rourke and his group [16] at the site [http://cs.