The digital Michelangelo project: 3D scanning of large statues
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Out-of-core simplification of large polygonal models
Proceedings of the 27th 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
Efficient simplification of point-sampled surfaces
Proceedings of the conference on Visualization '02
Fast 3D triangle-box overlap testing
Journal of Graphics Tools
The Ball-Pivoting Algorithm for Surface Reconstruction
IEEE Transactions on Visualization and Computer Graphics
The flow complex: a data structure for geometric modeling
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Fast Surface Reconstruction Using the Level Set Method
VLSM '01 Proceedings of the IEEE Workshop on Variational and Level Set Methods (VLSM'01)
Multi-level partition of unity implicits
ACM SIGGRAPH 2003 Papers
A geometric convection approach of 3-D reconstruction
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
External Memory Management and Simplification of Huge Meshes
IEEE Transactions on Visualization and Computer Graphics
The Marching Intersections algorithm for merging range images
The Visual Computer: International Journal of Computer Graphics
An integrating approach to meshing scattered point data
Proceedings of the 2005 ACM symposium on Solid and physical modeling
Convection-Driven Dynamic Surface Reconstruction
SMI '05 Proceedings of the International Conference on Shape Modeling and Applications 2005
A flexible framework for surface reconstruction from large point sets
Computers and Graphics
A streaming algorithm for surface reconstruction
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
The HybridTree: a hybrid constructive shape representation for free-form modeling
Heterogeneous objects modelling and applications
Feature-Preserving Surface Reconstruction and Simplification from Defect-Laden Point Sets
Journal of Mathematical Imaging and Vision
| Hi-index | 0.00 |
We present a method to reconstruct simplified mesh surfaces from large unstructured point sets, extending recent work on dynamic surface reconstruction. The method consists of two core components: an efficient selective reconstruction algorithm, based on geometric convection, that simplifies the input point set while reconstructing a surface, and a local update algorithm that dynamically refines or coarsens the reconstructed surface according to specific local sampling constraints. We introduce a new data-structure that significantly accelerates the original selective reconstruction algorithm and makes it possible to handle point set models with millions of sample points. Our data-structure mixes a kd-tree with the Delaunay triangulation of the selected points enriched with a sparse subset of landmark sample points. This design efficiently responds to the specific spatial location issues of the geometric convection algorithm. We also develop an out-of-core implementation of the method, that permits to seamlessly reconstruct and interactively update simplified mesh surfaces from point sets that do not fit into main memory.