Representing stereo data with the Delaunay triangulation
From MaRDI portal
Publication:2638828
DOI10.1016/0004-3702(90)90098-KzbMath0717.68102MaRDI QIDQ2638828
Jean-Daniel Boissonnat, Olivier Faugeras, E. Le Bras-Mehlman
Publication date: 1990
Published in: Artificial Intelligence (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68U10: Computing methodologies for image processing
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Matching Delaunay graphs, An upper bound for conforming Delaunay triangulations, Point placement algorithms for Delaunay triangulation of polygonal domains
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