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

Delaunay triangulation is an effective way to build a triangulation of a cloud of points, i.e., a partitioning of the points into simplices (triangles in 2D, tetrahedra in 3D, and so on), such that no two simplices overlap and every point in the set is a vertex of at least one simplex. Such a triang...

Descripció completa

Dades bibliogràfiques

Autors principals:	Yahia S. Elshakhs, Kyriakos M. Deliparaschos, Themistoklis Charalambous, Gabriele Oliva, Argyrios Zolotas
Format:	Artigo
Idioma:	Inglês
Publicat:	IEEE 2024-01-01
Col·lecció:	IEEE Access
Matèries:	Delaunay triangulation applications of Delaunay triangulation algorithmic approaches to Delaunay triangulation CPU implementation of Delaunay triangulation GPU implementation of Delaunay triangulation FPGA implementation of Delaunay triangulation
Accés en línia:	https://ieeexplore.ieee.org/document/10400424/
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!