PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
July 1, 1988IEEE Transactions on Pattern Analysis and Machine Intelligence455 citations

The computation of visible-surface representations

View Full Paper
DTDemetri Terzopoulos

Key Points

Key points are not available for this paper at this time.

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.>

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Demetri Terzopoulos (1988) studied this question.

synapsesocial.com/papers/6a1564de5347fbb1739fb662https://doi.org/10.1109/34.3908
Ask AI
Helpful
Bookmark
Share
View Full Paper