Computer Graphics Forum · 2008 · 17 citations · 19 references
ComputingComputer ScienceHigh-performance Computing3D ModelingComputational GeometryComputer Graphics3D ReconstructionDelaunay TriangulationsGeometry ProcessingPoint Cloud ProcessingSurface InterpolationSurface ReconstructionBitonic SortInterpolation Of Point CloudsMerge SortNormal EstimationPoint Cloud Surface ReconstructionThree-dimensional Surface ReconstructionTriangulation AlgorithmsTriangulations
Abstract 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.
19
Marching cubes: A high resolution 3D surface construction algorithm
William E. Lorensen, H. E. Cline · 1987 · 10.2K citations · Full text
Computing, Radiology, Visualization +17
Surface reconstruction from unorganized points
Hugues Hoppe, Tony DeRose, Tom Duchamp et al. · 1992 · 2.7K citations · Full text
Sorting networks and their applications
Kenneth E. Batcher · 1968 · 2.4K citations
Surface reconstruction from unorganized points
Hugues Hoppe, Tony DeRose, Tom Duchamp et al. · ACM SIGGRAPH Computer Graphics · 1992 · 1.1K citations