A
Delaunay triangulation is simply the dual graph for a Voronoi tessellation [8,9].
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].
The GNSS station does not measure the distance and that is why a well-tried method of a
Delaunay triangulation was used.
The
Delaunay triangulation D of V, introduced by Delaunay in 1934, is a graph that is defined as follows.
Georgiopoulos, "Fingerprint identification using
delaunay triangulation", In Proc.
The
Delaunay triangulation only considers one of the points which have the same values of x and y coordinates and different z coordinates.
The
Delaunay triangulation (DT) is the straight-line dual structure of the Voronoi diagram; see [20] for the clear definitions of the
Delaunay triangulation and constrained
Delaunay triangulation.
Then the
Delaunay triangulation T := D([??]) coincides with the placing triangulation of [??].