A Computational Geometric Approach to Visual Hulls
From MaRDI portal
Recommendations
Cites work
- Algebraic geometry and computer vision: Polynomial systems, real and complex roots
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- Arrangements of segments that share endpoints: Single face results
- On the complexity and computation of view graphs of piecewise smooth algebraic surfaces
- The internal representation of solid shape with respect to vision
- Visibility of disjoint polygons
Cited in
(11)- Curve and surface duals and the recognition of curved 3D objects from their silhouettes
- Matching convex polygons and polyhedra, allowing for occlusion
- Diamond inclusion reconstruction
- Reconstruction of 3D Object Meshes from Silhouette Images
- Properties of a level set algorithm for the visibility problems
- Computer Vision - ECCV 2004
- COMPUTING THE SET OF ALL THE DISTANT HORIZONS OF A TERRAIN
- Projective visual hulls
- High quality visual hull reconstruction by Delaunay refinement
- Visibility and its dynamics in a PDE based implicit framework
- 3D shape recovery of complex objects from multiple silhouette images
This page was built for publication: A Computational Geometric Approach to Visual Hulls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4513219)
