Michal Varnuska
ABSTRACT
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.
- AMENTA, N., BERN, M. AND KAMVYSSELIS, M. 1998. The crust and -skeleton: combinatorical surface reconstruction. Proceedings of ACM SIGGRAPH 1998, pages 415--421. Google Scholar
Digital Library
- ATTALI, D. 1997. R-regular shape reconstruction from unorganized points. Proceedings of 13th ACM Sympos. Comput. Geom. 1997, pages 248--253. Google ScholarDigital Library
- DEY, T. K., KUMAR, P. 1999. A simple provable algorithm for curve reconstruction. Proceedings of ACM-SIAM Sympos. Discr. Algorithms 1999, 893--894. Google ScholarDigital Library
- MENCL, R. AND MÜLLER, H. 1998. Interpolation and approximation of surfaces from three-dimensional scattered data points. Eurographics 1998.Google Scholar
- MILLER, J. V., BREEN, D. E., LORENZEM, W. E., O'BARA, R. M. AND WOZNY M. J., 1991. Geometrically deformed models: A Method for extracting closed geometric models from volume data. Computer Graphics, pages 217--226, July 1991. Proceedings of ACM SIGGRAPH 1991. Google ScholarDigital Library
- BOISSONAT, J. D. 1984. Geometric structures for three-dimensional shape representation. ACM Trans. Graphics 3, 1984, pages 266--286. Google ScholarDigital Library
- MENCL, R. AND MÜLLER, H. 1998. Graph based surface reconstruction using structures in scattered point sets. In Proceedings of CGI 98 (Computer Graphics International), Hanover, Germany, June 22--26th 1998. Google ScholarDigital Library
- HOPPE, H., DEROSE, T., DUCHAMP, T., HALSTEAD, M., JIN, H., MCDONALD, J., SCHWEITZER, J. AND STUETZLE, W. 1994. Piecewise smooth surface reconstruction. Comput. Graphics Proceedings 1994, pp. 295--302 (annual conference series of ACM SIGGRAPH 1994). Google ScholarDigital Library
- ALGORRI, M. E. AND SCHMITT, F. 1996. Surface reconstruction from unstructured 3D data. Computer Graphic Forum 1996, 15(1): pages 47--60.Google Scholar
- EDELSBRUNNER, H., AND MÜCKE, E. P. 1994. Three-dimensional alpha shapes. ACM Trans. Graphics 13, 1994, pages 43--72. Google ScholarDigital Library
- AMENTA, N., BERN, M. AND KAMVYSSELIS M. 1998. A new Voronoi based surface reconstruction algorithm. Proceedings of ACM SIGGRAPH 1998, pages 415--421. Google ScholarDigital Library
- AMENTA, N., CHOI, S., DEY, T. K. AND LEEKHA, N. 1998. A simple algorithm for homeomorphic surface reconstruction. 16th. Sympos. Comput. Geom. 2000. Google ScholarDigital Library
- DEY, T. K. AND GIESEN, J. 2001. Detecting undersampling in surface reconstruction. Proceedings of 17th ACM Sympos. Comput. Geom. 2001, pages 257--263. Google ScholarDigital Library
- DEY, T. K., GIESEN, J. AND ZHAO, W. 2001. Robustness issues in surface reconstruction. Proceedings of the International Conference of Computer Science, San Fancisco, Calif., May 28--30, (2001). Google ScholarDigital Library
- SHEWCHUCK, J. R. 1996. Robust adaptive floating-point geometric predicates. Proceedings of 12th Sympos. Comput. Geom., ACM, 1996. Google ScholarDigital Library
- MAUR, P. 2002. Delaunay triangulation in 3D. Technical report NO. DCSE/TR-2002-02. University of West Bohemia, Pilsen, January, 2002.Google Scholar
- STANFORD COMPUTER GRAPHICS LABORATORY http://graphics.stanford.edu/data/3Dscanrep/.Google Scholar
- Improvements to surface reconstruction by the CRUST algorithm
Recommendations
Surface reconstruction by layer peeling
Given an input point cloud P in ℜ3, this paper proposes a novel algorithm to identify surface neighbors of each point p∈P respecting the underlying surface S and then to construct a piecewise linear surface for P. The algorithm utilizes the simple k-...
Boundary filtering approach in surface reconstruction
One of the methods for 3D data model acquisition is real object digitisation followed by surface reconstruction. Many algorithms have been developed to do this, each with its advantages and disadvantages. We use for the reconstruction a CRUST algorithm ...
Direct reconstruction of a displaced subdivision surface from unorganized points
Pacific graphics 2001In this paper we describe the generation of a displaced subdivision surface directly from a set of unorganized points. The displaced subdivision surface is an efficient mesh representation that defines a detailed mesh with a displacement map over a ...
Comments