Geometrically deformed models: a method for extracting closed geometric models form volume data
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
Three-dimensional alpha shapes
ACM Transactions on Graphics (TOG)
Piecewise smooth surface reconstruction
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
Robust adaptive floating-point geometric predicates
Proceedings of the twelfth annual symposium on Computational geometry
r-regular shape reconstruction from unorganized points
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
A new Voronoi-based surface reconstruction algorithm
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
A simple provable algorithm for curve reconstruction
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
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)
Detecting undersampling in surface reconstruction
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Robustness Issues in Surface Reconstruction
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Graph-Based Surface Reconstruction Using Structures in Scattered Point Sets
CGI '98 Proceedings of the Computer Graphics International 1998
Boundary filtering approach in surface reconstruction
International Journal of Computational Science and Engineering
Surface reconstruction from large point clouds using virtual shared memory manager
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
| Hi-index | 0.00 |
There is a wide range of applications, such as solid modeling, computer graphics or computer vision, for which surface reconstruction of scattered data points in space is important. Many algorithms were developed in the past depending on the field of application and related properties of the data. This paper presents some improvements to the already existing one-pass CRUST algorithm build on Delaunay tetrahedronization and Voronoi diagrams.