SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
SIGGRAPH '92 Proceedings of the 19th 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)
Zippered polygon meshes from range images
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
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 signal processing approach to fair surface design
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
SIGGRAPH '96 Proceedings of the 23rd 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
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
r-regular shape reconstruction from unorganized points
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Controlled simplification of genus for polygonal models
VIS '97 Proceedings of the 8th conference on Visualization '97
A new Voronoi-based surface reconstruction algorithm
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
A simple algorithm for homeomorphic surface reconstruction
Proceedings of the sixteenth annual symposium on Computational geometry
Geometric structures for three-dimensional shape representation
ACM Transactions on Graphics (TOG)
New techniques for topologically correct surface reconstruction
Proceedings of the conference on Visualization '00
Detecting undersampling in surface reconstruction
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
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
Shape Reconstruction with Delaunay Complex
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
Interpolation and Approximation of Surfaces from Three-dimensional Scattered Data Points
Dagstuhl '97, Scientific Visualization
Surface Reconstruction Using Adaptive Clustering Methods
Geometric Modelling
The power crust, unions of balls, and the medial axis transform
Computational Geometry: Theory and Applications
Natural neighbor coordinates of points on a surface
Computational Geometry: Theory and Applications
Shape matching and modeling using skeletal context
Pattern Recognition
Shape matching and modeling using skeletal context
Pattern Recognition
3D modeling of complex and detailed cultural heritage using multi-resolution data
Journal on Computing and Cultural Heritage (JOCCH)
Shape modeling using automatic landmarking
MICCAI'05 Proceedings of the 8th international conference on Medical image computing and computer-assisted intervention - Volume Part II
Hi-index | 0.00 |
Shape modeling is an integral part of many visualization problems. Recent advances in scanning technology and a number of surface reconstruction algorithms have opened up a new paradigm for modeling shapes from samples. Many of the problems currently faced in this modeling paradigm can be traced back to two anomalies in sampling, namely undersampling and oversampling. Boundaries, non-smoothness and small features create undersampling problems, whereas oversampling leads to too many triangles. We use Voronoi cell geometry as a unified guide to detect undersampling and oversampling. We apply these detections in surface reconstruction and model simplification. Guarantees of the algorithms can be proved. In this paper we show the success of the algorithms empirically on a number of interesting data sets.