Representing stereo data with the Delaunay triangulation
From MaRDI portal
Publication:2638828
DOI10.1016/0004-3702(90)90098-KzbMATH Open0717.68102MaRDI QIDQ2638828FDOQ2638828
Authors: Olivier Faugeras, E. Le Bras-Mehlman, Jean-Daniel Boissonnat 
Publication date: 1990
Published in: Artificial Intelligence (Search for Journal in Brave)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized Delaunay triangulation for planar graphs
- A new point-location algorithm and its practical efficiency: comparison with existing algorithms
- Shape description using weighted symmetric axis features
- On the complexity of d-dimensional Voronoi diagrams
- Triangulation automatique d’un polyèdre en dimension $N$
- Title not available (Why is that?)
- Manfredo P. do Carmo. Selected papers. Edited by Keti Tenenblat
- Curvature relations in three-dimensional symmetric axes
Cited In (9)
- Delaunay-based representation of surfaces defined over arbitrarily shaped domains
- Data extraction from dense 3-d surface models
- An upper bound for conforming Delaunay triangulations
- Stereo matching algorithm based on 2D Delaunay triangulation
- A novel model of conforming Delaunay triangulation for sensor network configuration
- Point placement algorithms for Delaunay triangulation of polygonal domains
- High quality visual hull reconstruction by Delaunay refinement
- Title not available (Why is that?)
- Matching Delaunay graphs
This page was built for publication: Representing stereo data with the Delaunay triangulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2638828)
