Representing stereo data with the Delaunay triangulation
From MaRDI portal
Publication:2638828
Recommendations
Cites work
- scientific article; zbMATH DE number 3945343 (Why is no real title available?)
- scientific article; zbMATH DE number 3502485 (Why is no real title available?)
- scientific article; zbMATH DE number 3436645 (Why is no real title available?)
- scientific article; zbMATH DE number 3282420 (Why is no real title available?)
- A new point-location algorithm and its practical efficiency: comparison with existing algorithms
- Curvature relations in three-dimensional symmetric axes
- Generalized Delaunay triangulation for planar graphs
- Manfredo P. do Carmo. Selected papers. Edited by Keti Tenenblat
- On the complexity of d-dimensional Voronoi diagrams
- Shape description using weighted symmetric axis features
- Triangulation automatique d’un polyèdre en dimension $N$
Cited in
(9)- Delaunay-based representation of surfaces defined over arbitrarily shaped domains
- Data extraction from dense 3-d surface models
- scientific article; zbMATH DE number 1803169 (Why is no real title available?)
- An upper bound for conforming Delaunay triangulations
- Matching Delaunay graphs
- Point placement algorithms for Delaunay triangulation of polygonal domains
- High quality visual hull reconstruction by Delaunay refinement
- Stereo matching algorithm based on 2D Delaunay triangulation
- A novel model of conforming Delaunay triangulation for sensor network configuration
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)