Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Ten lectures on wavelets
Surface reconstruction from unorganized points
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Using the refinement equation for evaluating integrals of wavelets
SIAM Journal on Numerical Analysis
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 digital Michelangelo project: 3D scanning of large statues
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
On the adaptive computation of integrals of wavelets
Applied Numerical Mathematics
Proceedings of the sixth ACM symposium on Solid modeling and applications
Reconstruction and representation of 3D objects with radial basis functions
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Delaunay based shape reconstruction from large data
PVG '01 Proceedings of the IEEE 2001 symposium on parallel and large-data visualization and graphics
The Ball-Pivoting Algorithm for Surface Reconstruction
IEEE Transactions on Visualization and Computer Graphics
Multi-level partition of unity implicits
ACM SIGGRAPH 2003 Papers
Dual Marching Cubes: Primal Contouring of Dual Grids
PG '04 Proceedings of the Computer Graphics and Applications, 12th Pacific Conference
Error-guided adaptive Fourier-based surface reconstruction
Computer-Aided Design
Global non-rigid alignment of 3-D scans
ACM SIGGRAPH 2007 papers
Reconstruction of solid models from oriented point sets
SGP '05 Proceedings of the third Eurographics symposium on Geometry processing
Poisson surface reconstruction
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
Multilevel streaming for out-of-core surface reconstruction
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
A streaming algorithm for surface reconstruction
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Provable surface reconstruction from noisy samples
Computational Geometry: Theory and Applications
Fast low-memory streaming MLS reconstruction of point-sampled surfaces
Proceedings of Graphics Interface 2009
Adaptive surface reconstruction based on implicit PHT-splines
Proceedings of the 14th ACM Symposium on Solid and Physical Modeling
Global registration of dynamic range scans for articulated model reconstruction
ACM Transactions on Graphics (TOG)
Parallel and adaptive surface reconstruction based on implicit PHT-splines
Computer Aided Geometric Design
3D object reconstruction using convex hull improved by a peeling process
IWAAL'12 Proceedings of the 4th international conference on Ambient Assisted Living and Home Care
A benchmark for surface reconstruction
ACM Transactions on Graphics (TOG)
Screened poisson surface reconstruction
ACM Transactions on Graphics (TOG)
SIGGRAPH Asia 2013 Technical Briefs
Hi-index | 0.00 |
We present a streaming method for reconstructing surfaces from large data sets generated by a laser range scanner using wavelets. Wavelets provide a localized, multiresolution representation of functions and this makes them ideal candidates for streaming surface reconstruction algorithms. We show how wavelets can be used to reconstruct the indicator function of a shape from a cloud of points with associated normals. Our method proceeds in several steps. We first compute a low-resolution approximation of the indicator function using an octree followed by a second pass that incrementally adds fine resolution details. The indicator function is then smoothed using a modified octree convolution step and contoured to produce the final surface. Due to the local, multiresolution nature of wavelets, our approach results in an algorithm over 10 times faster than previous methods and can process extremely large data sets in the order of several hundred million points in only an hour.