Premium
GPU Local Triangulation: an interpolating surface reconstruction algorithm
Author(s) -
Buchart C.,
Borro D.,
Amundarain A.
Publication year - 2008
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/j.1467-8659.2008.01211.x
Subject(s) - delaunay triangulation , bowyer–watson algorithm , computer science , marching cubes , triangulation , point cloud , surface triangulation , algorithm , constrained delaunay triangulation , surface reconstruction , computer graphics (images) , surface (topology) , computer vision , artificial intelligence , mathematics , visualization , geometry
A GPU capable method for surface reconstruction from unorganized point clouds without additional information, called GLT (GPU Local Triangulation), is presented. The main objective of this research is the generation of a GPU interpolating reconstruction based on local Delaunay triangulations, inspired by a pre‐existing reconstruction algorithm. Current graphics hardware accelerated algorithms are approximating approaches, where the final triangulation is usually performed through either marching cubes or marching tetrahedras. GPU‐compatible methods and data structures to perform normal estimation and the local triangulation have been developed, plus a variation of the Bitonic Merge Sort algorithm to work with multi‐lists. Our method shows an average gain of one order of magnitude over previous research.