A Computational Geometric Approach to Visual Hulls
From MaRDI portal
Publication:4513219
DOI10.1142/S0218195998000229zbMath1035.68540MaRDI QIDQ4513219
Publication date: 7 November 2000
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (4)
Visibility and its dynamics in a PDE based implicit framework ⋮ Projective visual hulls ⋮ Properties of a level set algorithm for the visibility problems ⋮ COMPUTING THE SET OF ALL THE DISTANT HORIZONS OF A TERRAIN
Cites Work
- Algebraic geometry and computer vision: Polynomial systems, real and complex roots
- Visibility of disjoint polygons
- The internal representation of solid shape with respect to vision
- Arrangements of segments that share endpoints: Single face results
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- On the complexity and computation of view graphs of piecewise smooth algebraic surfaces
This page was built for publication: A Computational Geometric Approach to Visual Hulls
