Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Surface reconstruction from unorganized points
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Three-dimensional alpha shapes
ACM Transactions on Graphics (TOG)
A level set approach for computing solutions to incompressible two-phase flow
Journal of Computational Physics
The NURBS book
Automatic reconstruction of surfaces and scalar fields from 3D scans
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
A volumetric method for building complex models from range images
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
The crust and the &Bgr;-Skeleton: combinatorial curve reconstruction
Graphical Models and Image Processing
A Level-Set Approach to 3D Reconstruction from Range Data
International Journal of Computer Vision
Shape transformation using variational implicit functions
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Volume-of-fluid interface tracking with smoothed surface stress methods for three-dimensional flows
Journal of Computational Physics
A non-oscillatory Eulerian approach to interfaces in multimaterial flows (the ghost fluid method)
Journal of Computational Physics
The ghost fluid method for deflagration and detonation discontinuities
Journal of Computational Physics
A PDE-based fast local level set method
Journal of Computational Physics
Geometric structures for three-dimensional shape representation
ACM Transactions on Graphics (TOG)
Computer Vision and Image Understanding
A level-set algorithm for tracking discontinuities in hyperbolic conservation laws
Journal of Computational Physics
Proceedings of the sixth ACM symposium on Solid modeling and applications
Level set methods: an overview and some recent results
Journal of Computational Physics
Journal of Computational Physics
Smooth surface reconstruction from noisy range data
Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia
Computing and Rendering Point Set Surfaces
IEEE Transactions on Visualization and Computer Graphics
A Cartesian grid method with transient anisotropic adaptation
Journal of Computational Physics
Shape Reconstruction with Delaunay Complex
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
Ray Tracing Point Set Surfaces
SMI '03 Proceedings of the Shape Modeling International 2003
Fast Surface Reconstruction Using the Level Set Method
VLSM '01 Proceedings of the IEEE Workshop on Variational and Level Set Methods (VLSM'01)
Implicit Meshes for Surface Reconstruction
IEEE Transactions on Pattern Analysis and Machine Intelligence
Anisotropic point set surfaces
AFRIGRAPH '06 Proceedings of the 4th international conference on Computer graphics, virtual reality, visualisation and interaction in Africa
Mathematical Problems in Image Processing: Partial Differential Equations and the Calculus of Variations (Applied Mathematical Sciences)
A fast and accurate semi-Lagrangian particle level set method
Computers and Structures
On the shape of a set of points in the plane
IEEE Transactions on Information Theory
Geometric and radiometric modeling of 3D scenes
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
| Hi-index | 0.00 |
In this article we propose an algorithm for fast reconstruction of 3D surfaces starting from large sets of unorganized sample points. The proposed algorithm is based on the temporal evolution of a volumetric implicit function. The evolving front can be thought as the surface that separates two different fluids obeying specific fluid dynamics laws. One remarkable feature of this approach is its ability to model complex topologies using a set of intuitive tools derived from fluid physics: Global and local surface descriptors are used allowing the parallelization of the algorithm on different processes each of one can operate on different sub-sets of the whole cloud with different resolutions and accuracies. Tests on large and complex clouds of 3D points show an high efficiency of the proposed approach: between one and two orders of magnitude faster than traditional implicit solutions.