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

input to be meshed, in a way that causes the Delaunay triangulation or constrained Delaunay triangulation of the augmented input to meet the quality requirements...

physicist, Nikolai Borisovich Delone. He is best known for the Delaunay triangulation. Boris Delone got his surname from his ancestor French Army officer...

constrained Delaunay triangulation is a generalization of the Delaunay triangulation that forces certain required segments into the triangulation as edges...

including the relative neighborhood graph and Delaunay triangulation. By constructing the Delaunay triangulation and then applying a graph minimum spanning...

the art gallery problem. The constrained Delaunay triangulation is an adaptation of the Delaunay triangulation from point sets to polygons or, more generally...

triangulations are special cases of planar straight-line graphs. A particularly interesting kind of triangulations are the Delaunay triangulations. They...

other. The Voronoi diagram of a set of points is dual to that set's Delaunay triangulation. The Voronoi diagram is named after mathematician Georgy Voronoy...

The triangulation of a surface should not be confused with the triangulation of a discrete prescribed plane set of points. See Delaunay triangulation. Triangulation:...

convex polygon. The Delaunay triangulation is a tessellation that is the dual graph of a Voronoi tessellation. Delaunay triangulations are useful in numerical...

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

mathematician, inventor of Delaunay triangulation Charles-Eugène Delaunay (1816–1872), French astronomer and mathematician Nikolai Delaunay, Junior (1926–2008)...

paths among obstacles. The best upper bound known for the Euclidean Delaunay triangulation is that it is a 1.998 {\displaystyle 1.998} -spanner for its vertices...

Voronoi diagram as the weak dual of the Delaunay triangulation. Although the Voronoi diagram and Delaunay triangulation are dual, their embedding in the plane...

intersection: Find the intersections between a given set of line segments. Delaunay triangulation Voronoi diagram: Given a set of points, partition the space according...

Related structures include the orthogonal convex hull, convex layers, Delaunay triangulation and Voronoi diagram, and convex skull. A set of points in a Euclidean...

Alternatively, it is a Delaunay triangulation in which each internal edge crosses its dual Voronoi diagram edge. Pitteway triangulations are named after Michael...

triangulation of the convex hull of a set of points. A Delaunay triangulation is another way to create a triangulation based on a set of points. The associahedron...

them are collinear. The usual lifting transform that relates the Delaunay triangulation to the bottom half of a convex hull (i.e., giving each point p an...

partition any 3D geometry into tetrahedrons by employing a form of Delaunay triangulation whose algorithm was developed by the author. TetGen has since been...

For instance in a randomized incremental algorithm for Delaunay triangulation, the triangulation changes by replacing one triangle by three smaller triangles...

the Delaunay triangulation. The Urquhart graph was described by Urquhart (1980), who suggested that removing the longest edge from each Delaunay triangle...

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

which are subcomplexes of the Delaunay triangulation of the point set. Each edge or triangle of the Delaunay triangulation may be associated with a characteristic...

the number of discrete changes is an important open problem. The Delaunay triangulation seems like a natural candidate, but a tight worst-case analysis...

construction of the Voronoi diagram (Fortune's algorithm) and the Delaunay triangulation or boolean operations on polygons. Topological sweeping is a form...

"hexes." Many meshing techniques are built on the principles of the Delaunay triangulation, together with rules for adding vertices, such as Ruppert's algorithm...

A quasi-triangulation may have some of the characteristics of a Delaunay triangulation. Luzin S.Y.; Lyachek Y.T.; Petrosyan G.S.; Polubasov O.B. (2010)...

Gabriel graph, which is a subgraph of the Delaunay triangulation. If pq is an edge of the Delaunay triangulation that is not an edge of the β-skeleton, then...

relative neighborhood graph can be computed in linear time from the Delaunay triangulation of the point set. Because it is defined only in terms of the distances...