Computational geometry: an introduction
Computational geometry: an introduction
Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
An introduction to ray tracing
An introduction to ray tracing
Surface reconstruction from unorganized points
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Object modelling by registration of multiple range images
Image and Vision Computing - Special issue: range image understanding
Incremental topological flipping works for regular triangulations
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Three-dimensional alpha shapes
ACM Transactions on Graphics (TOG)
Surround-screen projection-based virtual reality: the design and implementation of the CAVE
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Computational geometry in C
Zippered polygon meshes from range images
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
A General Surface Approach to the Integration of a Set of Range Views
IEEE Transactions on Pattern Analysis and Machine Intelligence
Building 3-D models from unregistered range images
Graphical Models and Image Processing
A volumetric method for building complex models from range images
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Geometric structures for three-dimensional shape representation
ACM Transactions on Graphics (TOG)
| Hi-index | 0.00 |
This paper describes an algorithm for surface reconstruction from a set of scattered three-dimensional points extracted from an image sequence. In this process, additional information (such as location of the viewpoints and the points visible from a particular viewpoint) is available and can be exploited for accurately recovering the shape of the objects portrayed in the images. Initially, the set of points is subjected to a Delaunay triangulation that fills the convex hull of the set of points with disjoint tetrahedra. The key idea of the shape recovery algorithm is to eliminate triangles that obstruct the visibility of points from certain viewpoints, whose locations are known from the image acquisition process. The major contribution of this paper is that we have been able to design an algorithm for surface reconstruction that handles a wide variety of shapes, as opposed to currently existing techniques.