Delaunay Triangulation

Abstract

Delaunay Triangulation is a geometrical structure widely used in Computational Geometry. It was proposed by Boris Nikolaevich Delone (1890-1980) in 1934. Basically, given a set of n vertices V(n) (n ! 3) a Delaunay Triangulation is a net of non-overlapping triangles whose set of vertices is V(n).

A Comprehensive Survey on Delaunay Triangulation: Applications, Algorithms, and Implementations Over CPUs, GPUs, and FPGAs

“…Also, only [36] focuses on the implementation over CPUs and GPUs. Finally, most of the above surveys do not cover applications, while only few of them consider a single application domain (i.e., [39] focuses on computer vision and [33] on multibeam echosounding). Unlike other works in the literature, the present survey paper aims at providing a holistic overview of Delaunay Triangulation, presenting: • A comprehensive review and a tutorial-like presentation of all the main algorithms.…”

Optimizing Ray Tracing Techniques for Generating Large-Scale 3D Radio Frequency Maps

“…There may be as many rooftop shapes as the number of buildings in the area of interest. We then simply perform a Delaunay Triangulation [25], a well-known triangulation technique, on the rooftops' vertices to obtain their triangular mesh.…”

Optimizing Ray Tracing Techniques for Generating Large-Scale 3D Radio Frequency Maps

“…There may be as many rooftop shapes as the number of buildings in the area of interest. We then simply perform a Delaunay Triangulation [25], a well-known triangulation technique, on the rooftops' vertices to obtain their triangular mesh.…”