Visual Form pp 99-108 | Cite as

Three-Dimensional Surface Reconstruction Using Delaunay Triangulation in the Image Plane

  • E. Bruzzone
  • G. Garibotto
  • F. Mangili


In this paper a technique for 3D surface reconstruction from stereo segments by using a constrained 2D Delaunay triangulation in the image plane is described. The proposed approach provides an appropriate tessellation of stereo data, being consistent with the visibility constraints of the imaging system. It results in a scene surface representation suitable for various applications of computer vision, as 3D object recognition and obstacle detection. Results and comparisons between our approach and Delaunay tetrahedralization are illustrated on real data together with some considerations about computational complexity and running time efficiency.


Delaunay Triangulation World Space Stereo Data Constrain Delaunay Triangulation Delaunay Edge 
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]
    Asano T., Edahiro M., Imai H., Iri M., Practical Use of Bucketing Techniques in Computational Geometry, in: Toussaint G.T. (editor), Computational Geometry, Elsevier Science Publishers, Amsterdam (1985).Google Scholar
  2. [2]
    Ayache N., Lustman F., Fast an Reliable Passive Trinocular Stereovision., Proc. 1st International Conference on Computer Vision, London (1987).Google Scholar
  3. [3]
    Boissonnat J.D., Geometric Structures for Three-Dimensional Stage Representation, ACM Trans. on Graphics, 3, No. 4, (1984).Google Scholar
  4. [4]
    Buffa M., Faugeras O.D., Zhang Z., Obstacle Avoidance and Trajectory Planning for an Indoors Mobile Robot using Stereo Vision and Delaunay Triangulation, Proc. of the Round Discussion on Vision-based Vehicle Guidance, Tokyo (1990).Google Scholar
  5. [5]
    De Floriani L., Surface Representation Based on Triangular Grids, The Visual Computer (1987).Google Scholar
  6. [6]
    De Floriani L., Puppo E., A Survey of Constrained Delaunay Triangulation Algorithms for Surface Representation, in: Pieroni G.G. (editor) Issues on Machine Vision, Springer-Verlag (1988).Google Scholar
  7. [7]
    De Floriani L., Puppo E., An On-Line Algorithm for Constrained Delaunay Triangulation, Technical Report IMA-CNR, Genova (1990).Google Scholar
  8. [8]
    Faugeras O.D., Le Bras-Mehlman E., Boissonnat J.D., Representing Stereo Data with the Delaunay Triangulation, Artificial Intelligence 44 (1990).Google Scholar
  9. [9]
    Lee D.T., Proximity and Reachability in the Plane, Ph.D. Dissertation, Coordinated Science Laboratory Report ACT-12, University of Illinois, Urbana (1978).Google Scholar
  10. [10]
    Musso G., Depth and Motion Analysis: the Esprit Project P940, Proc. 6th Annual ESPRIT Conference, Brussels (1989).Google Scholar
  11. [11]
    Preparata F., Shamos M.I., Computation Geometry: an Introduction, Springer-Verlag, New York (1985).Google Scholar
  12. [12]
    Watson D.F., Computing the n-dimensional Delaunay Triangulation with application to Voronoi Polytopes, Computer Journal 24 (1981).Google Scholar

Copyright information

© Springer Science+Business Media New York 1992

Authors and Affiliations

  • E. Bruzzone
    • 1
  • G. Garibotto
    • 1
  • F. Mangili
    • 1
  1. 1.SRC Central Research DepartmentELSAG spaGenovaItaly

Personalised recommendations