Applying two-dimensional delaunay triangulation to stereo data interpolation

  • E. Bruzzone
  • M. Cazzanti
  • L. De Floriani
  • F. Mangili
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 588)


Interpolation of 3D segments obtained through a trinocular stereo process is achieved by using a 2D Delaunay triangulation on the image plane of one of the vision system cameras. The resulting two-dimensional triangulation is backprojected into the 3D space, generating a surface description in terms of triangular faces. The use of a constrained Delaunay triangulation in the image plane guarantees the presence of the 3D segments as edges of the surface representation.


Voronoi Diagram Delaunay Triangulation Simple Polygon Stereo Data Scene Reconstruction 
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.


  1. [AL1]
    Ayache N., Lustman F.: Fast an Reliable Passive Trinocular Stereovision, Proceedings 1st International Conference on Computer Vision, London (1987).Google Scholar
  2. [Bo1]
    Boissonnat J.D.: Geometric Structures for Three-Dimensional Shape Representation, ACM Transaction on Graphics, 3, 4 (1984).Google Scholar
  3. [BG1]
    Bruzzone E., Garibotto G., Mangili F.: Three-Dimensional Surface Reconstruction using Delaunay Triangulation in the Image Plane, Proceedings International Workshop on Visual Form, Capri (1991).Google Scholar
  4. [Ch1]
    Chew, L.P.: Constrained Delaunay Triangulation, Proceedings 3rd Symposium on Computational Geometry, Waterloo (1987).Google Scholar
  5. [DP1]
    De Floriani L., Puppo E.: Constrained Delaunay Triangulation for Multiresolution Surface Description, Proceedings 9th International Conference on Pattern Recognition, Roma (1988).Google Scholar
  6. [FL1]
    Faugeras O.D., Le Bras-Mehlman E., Boissonnat J.D.: Representing Stereo Data with the Delaunay Triangulation, Artificial Intelligence, 44 (1990).Google Scholar
  7. [GK1]
    Guibas L.Y., Knuth D.K., Sharir M.: Randomized Incremental Construction of Delaunay Triangulations and Voronoi Diagrams, Proceedings ICALP (1990).Google Scholar
  8. [LL1]
    Lee D.T., Lin, A.K.: Generalized Delaunay Triangulation for Planar Graphs, Discrete Computational Geometry, 1 (1986).Google Scholar
  9. [LR1]
    Lewis B.A., Robinson, J.S.: Triangulation of Planar Regions with Applications, The Computer Journal, 21, 4 (1979).Google Scholar
  10. [Mu1]
    Musso G.: Depth and Motion Analysis: the Esprit Project P940, Proceedings 6th Annual ESPRIT Conference, Brussels (1989).Google Scholar
  11. [PS1]
    Preparata F., Shamos M.I.: Computation Geometry: an Introduction, Springer-Verlag, New York (1985).Google Scholar
  12. [Wa1]
    Watson D.F.: Computing the n-dimensional Delaunay Triangulation with Application to Voronoi Polytopes, The Computer Journal, 24 (1981).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • E. Bruzzone
    • 1
  • M. Cazzanti
    • 2
  • L. De Floriani
    • 2
  • F. Mangili
    • 1
  1. 1.Research & DevelopmentElsag Bailey spaGenovaItaly
  2. 2.Dipartimento di MatematicaUniversità di GenovaGenovaItaly

Personalised recommendations