Representing stereo data with the Delaunay triangulation

DOI10.1016/0004-3702(90)90098-KzbMath0717.68102MaRDI QIDQ2638828

E. Le Bras-Mehlman, Jean-Daniel Boissonnat, Olivier Faugeras

Publication date: 1990

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

Delaunay triangulationpolyhedral surfacestereo datathree-dimensional data

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

Point placement algorithms for Delaunay triangulation of polygonal domains ⋮ A novel model of conforming Delaunay triangulation for sensor network configuration ⋮ Matching Delaunay graphs ⋮ An upper bound for conforming Delaunay triangulations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of d-dimensional Voronoi diagrams
• Generalized Delaunay triangulation for planar graphs
• Shape description using weighted symmetric axis features
• Manfredo P. do Carmo – Selected Papers
• Curvature relations in three-dimensional symmetric axes
• Triangulation automatique d’un polyèdre en dimension $N$
• A new point-location algorithm and its practical efficiency: comparison with existing algorithms

This page was built for publication: Representing stereo data with the Delaunay triangulation