|
|
|
|
LEADER |
01000naa a22002652 4500 |
001 |
NLM188353658 |
003 |
DE-627 |
005 |
20231223181757.0 |
007 |
cr uuu---uuuuu |
008 |
231223s2009 xx |||||o 00| ||eng c |
024 |
7 |
|
|a 10.1109/TVCG.2008.200
|2 doi
|
028 |
5 |
2 |
|a pubmed24n0628.xml
|
035 |
|
|
|a (DE-627)NLM188353658
|
035 |
|
|
|a (NLM)19423881
|
040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
041 |
|
|
|a eng
|
100 |
1 |
|
|a Li, Xin
|e verfasserin
|4 aut
|
245 |
1 |
0 |
|a Surface mapping using consistent pants decomposition
|
264 |
|
1 |
|c 2009
|
336 |
|
|
|a Text
|b txt
|2 rdacontent
|
337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
500 |
|
|
|a Date Completed 14.07.2009
|
500 |
|
|
|a Date Revised 08.05.2009
|
500 |
|
|
|a published: Print
|
500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
520 |
|
|
|a Surface mapping is fundamental to shape computing and various downstream applications. This paper develops a pants decomposition framework for computing maps between surfaces with arbitrary topologies. The framework first conducts pants decomposition on both surfaces to segment them into consistent sets of pants patches (a pants patch is intuitively defined as a genus-0 surface with three boundaries), then composes global mapping between two surfaces by using harmonic maps of corresponding patches. This framework has several key advantages over existing techniques. First, it is automatic. It can automatically construct mappings for surfaces with complicated topology, guaranteeing the one-to-one continuity. Second, it is general and powerful. It flexibly handles mapping computation between surfaces with different topologies. Third, it is flexible. Despite topology and geometry, it can also integrate semantics requirements from users. Through a simple and intuitive human-computer interaction mechanism, the user can flexibly control the mapping behavior by enforcing point/curve constraints. Compared with traditional user-guided, piecewise surface mapping techniques, our new method is less labor intensive, more intuitive, and requires no user's expertise in computing complicated surface maps between arbitrary shapes. We conduct various experiments to demonstrate its modeling potential and effectiveness
|
650 |
|
4 |
|a Journal Article
|
700 |
1 |
|
|a Gu, Xianfeng
|e verfasserin
|4 aut
|
700 |
1 |
|
|a Qin, Hong
|e verfasserin
|4 aut
|
773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on visualization and computer graphics
|d 1996
|g 15(2009), 4 vom: 18. Juli, Seite 558-71
|w (DE-627)NLM098269445
|x 1941-0506
|7 nnns
|
773 |
1 |
8 |
|g volume:15
|g year:2009
|g number:4
|g day:18
|g month:07
|g pages:558-71
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TVCG.2008.200
|3 Volltext
|
912 |
|
|
|a GBV_USEFLAG_A
|
912 |
|
|
|a SYSFLAG_A
|
912 |
|
|
|a GBV_NLM
|
912 |
|
|
|a GBV_ILN_350
|
951 |
|
|
|a AR
|
952 |
|
|
|d 15
|j 2009
|e 4
|b 18
|c 07
|h 558-71
|