Soft Maps Between Surfaces

The problem of mapping between two non‐isometric surfaces admits ambiguities on both local and global scales. For instance, symmetries can make it possible for multiple maps to be equally acceptable, and stretching, slippage, and compression introduce difficulties deciding exactly where each point s...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Computer graphics forum Ročník 31; číslo 5; s. 1617 - 1626
Hlavní autori: Solomon, Justin, Nguyen, Andy, Butscher, Adrian, Ben-Chen, Mirela, Guibas, Leonidas
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Oxford, UK Blackwell Publishing Ltd 01.08.2012
Predmet:
Algebra
Algorithms
Ambiguity
and systems
Approximation
Computer graphics
I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling-Geometric algorithms
I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling—Geometric algorithms, languages, and systems
languages
Linear algebra
Mapping
Mathematical analysis
Matrices
Spreads
Studies
ISSN:0167-7055, 1467-8659
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The problem of mapping between two non‐isometric surfaces admits ambiguities on both local and global scales. For instance, symmetries can make it possible for multiple maps to be equally acceptable, and stretching, slippage, and compression introduce difficulties deciding exactly where each point should go. Since most algorithms for point‐to‐point or even sparse mapping struggle to resolve these ambiguities, in this paper we introduce soft maps, a probabilistic relaxation of point‐to‐point correspondence that explicitly incorporates ambiguities in the mapping process. In addition to explaining a continuous theory of soft maps, we show how they can be represented using probability matrices and computed for given pairs of surfaces through a convex optimization explicitly trading off between continuity, conformity to geometric descriptors, and spread. Given that our correspondences are encoded in matrix form, we also illustrate how low‐rank approximation and other linear algebraic tools can be used to analyze, simplify, and represent both individual and collections of soft maps.
Bibliografia:ArticleID:CGF3167
ark:/67375/WNG-0TN6K757-G
istex:D23EC97E2AC878F6A805F915954DD568E99844FC
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0167-7055
1467-8659
DOI:10.1111/j.1467-8659.2012.03167.x