An Algorithm to Triangulate Surfaces in 3D Using Unorganised Point Clouds

Part of the Computing book series (COMPUTING, volume 14)


Reconstructing surfaces from a set of unorganised sample points in the 3D space is a very important problem in reverse engineering. Most algorithms first build a triangular mesh to obtain an approximate surface representation. In this paper we describe an algorithm which works by creating and merging local triangular complexes to obtain an unambiguous 2D-manifold triangulation. We use all the given sample points as vertices, which is a natural requirement. Our method is able to handle open boundaries and holes, different geni (for example tori) and unoriented surfaces in a computationally efficient way.


Point Cloud Delaunay Triangulation Triangular Mesh Neighbourhood Graph Triangle Mesh 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Amenta, N., Bern, M., Kamvysselis, M.: A New Voronoi-based surface reconstruction algorithm. Comput. Graphics 415–421 (1998).Google Scholar
  2. [2]
    Bajaj C., Bernardini, F., Chen, J., Schikore, D.: Automatic reconstruction of 3D CAD models. Proc. of the Int. J. Conf. on Theory and Practice of Geometric Modeling, Blaubeuren, Germany, October 1996.Google Scholar
  3. [3]
    Bernardini, F.: Automatic reconstruction of CAD Models and properties from digital scans. Ph.D. Thesis, Purdue University, 1997.Google Scholar
  4. [4]
    Boissonnat, J.-D.: Geometric structures for three-dimensional shape representation. ACM Trans. Graphics 3, 266–286 (1984).CrossRefGoogle Scholar
  5. [5]
    Choi, B. K., Shin, H. Y., Yoon, Y. I., Lee, J. W.: Triangulation of scattered data in 3D space. Comput. Aided Des. 20 239–248 (1988).MATHCrossRefGoogle Scholar
  6. [6]
    Edelsbrunner, H., Mücke, E. P.: Three-dimensional alpha shapes. ACM Trans. Graphics 13 43–72 (1994).MATHCrossRefGoogle Scholar
  7. [7]
    Edelsbrunner, H.: Weighted alpha shapes. Technical Report UIUCDCD-R- 92–1760. Comp. Sci. Dept., Univ. Illinois, Urbana, Ill, 1992.Google Scholar
  8. [8]
    Guo, B., Mennon, J., Willette, B.: Surface reconstruction using alpha shapes. Comput. Graphics 16 177–190 (1997).Google Scholar
  9. [9]
    Hoppe, H., et al.: Surface reconstruction from unorganised points. Comput. Graphics, 71–76 (1992).Google Scholar
  10. [10]
    Várady, T., Martin, R. R., Cox, J.: Reverse engineering of geometric models — an introduction. Comput. Aided Des. 29 255–268 (1997).CrossRefGoogle Scholar
  11. [11]
    Veltkamp, R. C.: Boundaries through scattered points of unknown density. Graph. Models Image Proc. 57 441–452 (1995).MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Wien 2001

Authors and Affiliations

  • G. Kós
    • 1
  1. 1.Computer and Automation Research Institute, BudapestBudapestHungary

Personalised recommendations