The computation of visible-surface representations
Terzopoulos, D.
Schlumberger Palo Alto Res., CA;
This paper appears in: Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publication Date: Jul 1988
Volume: 10,
Issue: 4
On page(s): 417-438
ISSN: 0162-8828
References Cited: 65
CODEN: ITPIDJ
INSPEC Accession Number: 3233329
Digital Object Identifier: 10.1109/34.3908
Current Version Published: 2002-08-06
Abstract
A computational theory of visible-surface representations is
developed. The visible-surface reconstruction process that computes
these quantitative representations unifies formal solutions to the key
problems of: (1) integrating multiscale constraints on surface depth and
orientation from multiple-visual sources; (2) interpolating dense,
piecewise-smooth surfaces from these constraints; (3) detecting surface
depth and orientation discontinuities to apply boundary conditions on
interpolation; and (4) structuring large-scale, distributed-surface
representations to achieve computational efficiency. Visible-surface
reconstruction is an inverse problem. A well-posed variational
formulation results from the use of a controlled-continuity surface
model. Discontinuity detection amounts to the identification of this
generic model's distributed parameters from the data. Finite-element
shape primitives yield a local discretization of the variational
principle. The result is an efficient algorithm for visible-surface
reconstruction
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
