Surface reconstruction from unorganized points
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Piecewise smooth surface reconstruction
SIGGRAPH '94 Proceedings of the 21st 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
Isosurface extraction using particle systems
VIS '97 Proceedings of the 8th conference on Visualization '97
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
Shape dimension and approximation from samples
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Smooth-surface reconstruction in near-linear time
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The Ball-Pivoting Algorithm for Surface Reconstruction
IEEE Transactions on Visualization and Computer Graphics
Efficient Simplicial Reconstructions of Manifolds from Their Samples
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Fast and Efficient Projection-Based Approach for Surface Reconstruction
SIBGRAPI '02 Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing
Smooth surface reconstruction via natural neighbour interpolation of distance functions
Computational Geometry: Theory and Applications
Non-manifold surface reconstruction from high-dimensional point cloud data
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
A new algorithm is presented for surface reconstruction from unorganized points. Unlike many previous algorithms, this algorithm does not select a subcomplex of the Delaunay Triangulation of the points. Instead, it uses an incremental algorithm, adding one simplex of the surface at a time. As a result, the algorithm does not require the surface's embedding space to be R^3; the dimension of the embedding space may vary arbitrarily without substantially affecting the complexity of the algorithm. One result of using this incremental algorithmic technique is that very little can be proven about the reconstruction; nonetheless, it is interesting from an experimental viewpoint, as it allows for a wider variety of surfaces to be reconstructed. In particular, the class of non-orientable surfaces, such as the Klein Bottle, may be reconstructed. Results are shown for surfaces of varying genus.