Generating antialiased images at low sampling densities
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
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
Zippered polygon meshes from range images
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
SIGGRAPH '96 Proceedings of the 23rd 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 approximation power of moving least-squares
Mathematics of Computation
Feature Detection with Automatic Scale Selection
International Journal of Computer Vision
Dual contouring of hermite data
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Proceedings of the conference on Visualization '01
Reliable Surface Reconstructiuon from Multiple Range Images
ECCV '96 Proceedings of the 4th European Conference on Computer Vision-Volume I - Volume I
Multi-resolution geometric fusion
NRC '97 Proceedings of the International Conference on Recent Advances in 3-D Digital Imaging and Modeling
Compatible Triangulations of Spatial Decompositions
VIS '04 Proceedings of the conference on Visualization '04
Provably good sampling and meshing of surfaces
Graphical Models - Solid modeling theory and applications
Sparse surface reconstruction with adaptive partition of unity and radial basis functions
Graphical Models - Special issue on SMI 2004
A Comparison and Evaluation of Multi-View Stereo Reconstruction Algorithms
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1
ACM SIGGRAPH 2007 papers
Poisson surface reconstruction
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
Voronoi-based variational reconstruction of unoriented point sets
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Unconstrained isosurface extraction on arbitrary octrees
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Building Rome on a cloudless day
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part IV
Scale robust multi view stereo
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part III
Visibility probability structure from sfm datasets and applications
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part V
Hierarchical surface reconstruction from multi-resolution point samples
Proceedings of the 15th international conference on Theoretical Foundations of Computer Vision: outdoor and large-scale real-world scene analysis
Dense scene reconstruction with points of interest
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
Scalable real-time volumetric surface reconstruction
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
Depth synthesis and local warps for plausible image-based navigation
ACM Transactions on Graphics (TOG)
Hi-index | 0.00 |
Multi-view stereo systems can produce depth maps with large variations in viewing parameters, yielding vastly different sampling rates of the observed surface. We present a new method for surface reconstruction by integrating a set of registered depth maps with dramatically varying sampling rate. The method is based on the construction of a hierarchical signed distance field represented in an incomplete primal octree by incrementally adding triangulated depth maps. Due to the adaptive data structure, our algorithm is able to handle depth maps with varying scale and to consistently represent coarse, low-resolution regions as well as small details contained in high-resolution depth maps. A final surface mesh is extracted from the distance field by construction of a tetrahedral complex from the scattered signed distance values and applying the Marching Tetra-hedra algorithm on the partition. The output is an adaptive triangle mesh that seamlessly connects coarse and highly detailed regions while avoiding filling areas without suitable input data.