行政院國家科學委員會專題研究計畫 成果報告
三維網格參數化及其應用之研究(2/2)
計畫類別： 個別型計畫
計畫編號： NSC93-2213-E-009-032-
執行期間： 93 年 08 月 01 日至 94 年 07 月 31 日
執行單位： 國立交通大學資訊工程學系(所)
計畫主持人： 莊榮宏
計畫參與人員： 陳治君、李汪曄、何丹期、簡民昇、彭其瀚
報告類型： 完整報告
報告附件： 出席國際會議研究心得報告及發表論文
處理方式： 本計畫可公開查詢
中 華 民 國 94 年 7 月 5 日
Z
Z
Z`
`
`
3ëîè ×ÍÏÝλW¨ ×Í!ÏÎÝÄ&ÆÌ ëîÎ 3D metamorphosis or 3D morphing 3êG Ý@~KÄ6ÞÎ6vW9ÍET s3 &ET s/I®ßÎÝETn;Ah¸àï Ä68 9Ý` õÞß3 sÝñõ©ÇF ݼ î .hÍ¡ZÝxêÝÎèº× vb[ݸàïß +«ã¸àïqAàÆ Îî©ÇÝETFÙÞ®ßÌ8! ç}cRÝÎWç}ÝÄ Í¡ Z)[7]õ[1]Ý]P §Îç}Ý6võÎc Rç}Ý¥ ´0)ÊÝ6v5¸ç}5¿ ÝÌ Õ×ÍÞîÝ¿«î3¿«îñÎÝ ETn;qA&ÎÝ¿¢£Gõ ÎÌ Ä Ý´ËX ±!ç}FÝ5µÏµÞ5µ 3Þî¿«îÝãøFBãå§×Ýqz¹ë; constrained Delaunay triangulation ñ!Ý cRç} qA8!ÝcRç}¥&ÎÝ¿¢ £GBã!=bÝcRç}®ßÎç} Ý ETn; 3ÄqA` ;¿àaP /-Ý]PÕ Î3ÄHW ÎÝÄz
z
zZ
Z
Z`
`
`
The metamorphosis or the 3D morphing is the process of continuously transforming one object into another. Many morphing techniques for polygonal objects have been proposed. Most techniques par-tition a given mesh into several patches. User of-ten suffers from assigning partition path and patch correspondence between objects. In this thesis, we tried to alleviate such user intervention. In the pro-posed morphing system, the user is required to spec-ify correspondence of feature vertices among objects by intuition. According to topological and geomet-ric information, finding a suitable cutting path on the mesh and then cutting mesh into a patch. We apply mesh parameterization to assign a 2D para-meter value to each vertex of patch. Then adjust 2D parameter value for each vertex, and construct meshes’ correspondence on 2D coordinate. Using im-age processing technique and constrained Delaunay
triangulation decides the point distribution of new common mesh topology. According to the common mesh topology and original mesh geometric position constructs new object with the same mesh topology. In morphing stage, interpolation mesh is constructed by a traditional linear interpolation between corre-sponding vertices.
1
G
G
G
1.1
@
@
@~
~
~
^
^
^
3ëîè ×ÍÏÝλW¨ ×Í!ÏÎÝÄÌ ëîÎç} 3D metamorphosis or 3D morphing O ¼ ½é\I*\ÝMëîè Ý* Tàyé\i ¼'CÍ9ª Ý%®Ä '/T¸àï©m ! n"i«ÝÎÏ key frame objects ¿à Ý*Ç|®ßiÄÝÍi« W×Í=ÝiW` ÍO¥FÎj EGenus>0Ýç} ×P¢ó;C¿à¢ó;ê [ÝÇ`óãç}ÆN\ ëîÎÝÄÎÏÝ;ÎÞ ¼ÙÎ source object êýÎ destination object Ë￢Ϯ/-¼X ÝtÝÎ Ï ²Î«Ý©ÇÄ6BÄ/-ÝÕ ÀÝì%C²õ°' 3êGÝs" Ý*$^bèº×Íb[v">Ý]P¼ß Ý]°I5Ý]P/èº×Íå§×Ý f ÍÝx^Îèºvb[ × Î©Ç;ݸàïE®]Pã¸àï¼ Î Ý©ÇF®ßÍõÝETn;W ÝÄ2
@
@
@~
~
~ê
ê
êÝ
Ý
Ý
2.1
@
@
@~
~
~P
P
P
ê
ê
êý
ý
ý
Í@~Ýêý5WëÍI5躸àï JvàÆݸàï+«">X Îç}Û Ý5µñÌETn;ÝÎ3× ÝàH î Î;ð2à9\ç}î°.h&Æ @~ÝPjEÌ8!cRòPÝ9\ç} polygon mesh Î ÝÄ x3GHM»5WëI5Ï×MµïÎÝc RòPñETÝç}6v5ñ× sç }ÏÞM qAÎÝ¿¢õcR£]ÞÎ Ì ÕÞîÝ¢óè ¿àhÞîè ñÎ ÝETn;ÏëMÞÌETÝ¢óè qA ¸àïÝmOx!ÞÞvÌ8!ETcRn ;ÝÎ3Æ$ðÞËÎîETÝF| aP/-Ý]PÕÄÝ2ýH | WÄÝ
3
Z
Z
Z¤
¤
¤D
D
D¡
¡
¡
ëîÎÝÕ°º ½ÎÓ¨]P ! ê G Î Ó ¨ ] P ´  ½ ¸ à Ý ] P b ëË 1 î° volumetric representa-tion 2 d{% elevation map 3 9\ç}î° polyhedral representation jE!Ýî°ºb!ÝÕ° ¼¾ÕÍ ÝêÝ3h¸à9\ç}¼îÎ ¢ã®ß±Ý8ETç}ñÎ ÝET n; ÆhaÞE9\ç}Õ°õ¥ç }Ý]P|D¡3.1
ë
ë
ëî
î
îÎ
Î
Î
*
*
*
Ã
Ã
Ã
3ëîÎÝÕ°P¡ÍÎÝÓ¨] P ¢ÄÀ|ìËÍ¥ÝÞ 1. 0ËÎ 8ETÝF×ͼ¼ÙÎ ×ͼêýÎ àhËFHõ8 =n;¼X ÎÝÏCFÝH 2. X ÄÎÝF£G/æ (interpola-tion)Ý]P X Ý8ETFX A¢q AhËFÝ£G¼X FÝɪ 3ÄÝ@~KjEÎõÎ ÝET ]P@~3/-Ý]PK2àaP/-Ý] P¼X ɪ |ìÞjEÎ!Ó¨] P+ÛÍÎÝ]°3.2
F
F
FÙ
Ù
Ù9
9
9\
\
\
êGèÝ]°9ÎjEcRòP ëÝÎET7ÅET°[9]Ϋãø °[2][3] § ycRòP ëÝÎÍ7ÅE T°ËÍÎÄ6È7Å×Í!ÝÎ ÏîAi¦iÖ¬37ÅÝ2ýî ´0ETn; KentParentõCarlson[9]XèÝ7ÅET°x ÎjEÏÏÎ 1 star-shape object ã¸àï ¼ÙÎêýÎ/IÝTF¬vE ÎÝYw]' orientation Þ«îÝF7 ÅÕi¦î¿à7Å3i¦îÝF8nH0 FÝETn;h]°EyÏÏÎÝb ?Ý[¬3× Ýµì 9óÝά Ð)ÏÏÎÝf Lazarus õ VerroustXè ÝΫãø°[2]Î3Î/I0Õ×f/L ÎÝ`a3`aøEΫ¥±ãø | !øÝãøļñÎ FETn;.h Î/IÄ6D3×f`a curve ÎÝ T 3hTîÝF×Í¿Ý¿ «h¿«Î«X6¼ÝÏÄ6ÎÏÏ 9\ 2 Ah¸T'²EΫ0 Ñ@ÝãøF¬AhÎÝϵºbX§× ¬ÊàyXbÝÎî 3Gregory[6]õKanai[8]Ý s¥P°]°/ |¢óÕÞî¿«Ý sç}8!¥PÝ]P ¼ xÎ ÝcRETn;ÞÎ6vW9Í s¸àïÄ63ËÎî5½ 8ETÝF ¬ ETF 8!Ý=#n; 3Ϋî WÝ ×ç} control mesh h ×ç}Þ ÎÝ«6vW´Ý svËÎîX6v WÝ sóÎ8vETÝ #½Þ sç}£ ]ETÕÞî¿«¡-|3¿«î´0FET n;3[6]õ[8] ´0ETn;Ý]PÎ×lÝ ¿à sÌ ¡ ¥P)¿¥P¡ÕX b\ÝøF±ÝøFÞæ¼Ý\6vW&9ð Q¡EXbÝF âæ¼ÝFõ±ÝøF õÍ ÏF lãÎÍ ëÚxÞÎç}ë ; h]Pñ¼ÝETç}ãÌ Ý )¿¥P®ßÝ\øF¼Ý¸ñÝç}®ß 8 9±ÝF 3[13][11][10]à|ñÎ ÝETn ;]° ¥±EÎ×lPÝãøÿÕ«y æ¼ÎÝëîÿl¸ÍÎ=b8!ÝcRn ; 36vç} sî3[13]¸àï 1ÏÏÎ star-shape object μÎ/IKD3×Í
FhF|&Ë aNf aõΫ©b× ÍøF
2ÏÏ9\μ9\/ID3×ÍFãhF'9\Ý
Î bÝÃÍç} base domain ¡¸ àïqA ÃÍç}îÝF3&Îî××¼ Í 8ETÝFqAÃÍç}îÝFÝ=#n;õÎ ç}Ý¿¢£]3Îç}î0´ =#&FÝ 5µïh56vç}¸Î Ìb8!ó v8!ETÝ s 3[11]6vç}Ý]P «Gregory[6]õKanai[8]]°8! ã¸àï¼ Î îÝETFF Ý=]PPqAFÝ =#]P0ÕÎî8ETÝ6v5qA5 6vç}W8!óÝ s #켸àï3× ×¼ s ÝETn;¸Î Ìb8!ó vET s 3[10] Ý3K¸àïÝ H3Ý s6vî¸àï©m3Îî¼ °ÍETFPqAh°ETFÞÎ6vW ËÍ s h`¸àï3ETÝ s/¼ Xm ÝETF¼ ®#ì¼3Þîè ñET n;|¥±ãøñ×ͱ!cRç}Ý]P ñÎ ÝETn; [13][11]|L]Ýë 6v]PÞÞîè Ýë6vW°Í¬ Õ±ñ ë3ëîè ÝHA%??Xî 3[10]|°\ ç}ÝÃͺàÌ Ä XCWÝëî£]õÞî£] Ý´Ë ¾\ç}5vÝH 3¢ó¿«´Ët{ Ý2]õ°ÍÞî¿«cF8=3°\îqAt {F´ËÝ3\î®ß±ÝF ãL]6vç}Ý]P5½E&Î8!Ý 6v¸®ßݱÎç}/b×E×v8! ETÝn; ¿àh×E×Ýn;ÞETÝFq A` |/-Ý]PWÎÄÝ Î
4
@
@
@~
~
~]
]
]°
°
°
4.1
ç
ç
ç}
}
}
ø
ø
ø
+
+
+
3ÄÝç}]° ݾÕ?Ýç} ÄT¸àïÝ[ ¸àïm&9 ` õÞß3¼ ËÎ ÝETn;îLÍ 3[8],[11] ¸àïÄ6î&9` ¼ Î ÝETFõETF Ý=n; ¬. s5vÝ`ÆP°¼ ay!ET s/ ÝF ETF¸ETFݼ åÕ§×P°¾ ÕÝç}Ý[ ÍxÝêÝ3y3K¸àï3¼ sE Tî H%1 JÍÙÝø% P躸 àï&«¯¸àïqAàÆT¾ÕÝç} [¼ Îç}îÝETF PqA¸àïX ¼ ÝETF¯8!òP genus ÝÎç}= b8ETÝ6v5Bã6v5ÞTÝÎ 6vW×Í×Ýëî sç} ºà¢ó;Ý *ÞÎÝëîç}Ì ÕÞî¿«î¸ëî ç}õÞîç}Ìb×E×vÌWÝn; Bã-` warping ÝĸËÎÝ©ÇETFJ Õ8!Ý¢ó¿«Hî¸Î3¢ó¿«î ñ8!ÝFETÝn; ÎîFETn;ñ¡|ñ!cRç} Ý]PñÎ ÝETn;¥ç}Þ2àã ø resampling Ý]PX ÎÝç}5µ ÝÝ\±cRç}ãøFÝHÞqAæëî Îç}ÍÝ©Põ¢ó;ÄXCWæç} õÞîç}Ý-²P ®ß`£% curvature õ«´Ë% area distortion map qA¸à ï!ÝmO5g`£%õ«%f»®ß ×% control map ¥PkñETn;ÎÝ × % ¸ãøÝÎcRç}!`=b&ÎÝ© P¿àÅ § halftoning Ý]P Þv$Ý ×%»ðWFpÝãø% ãø%î AFÝHµÎÎîãøFÝH ÿÎî FÝH¡¿àqz¹ë; Delaunay triangu-lation ñãøF Ý=n;ÿÕ±ÝcRç } Þh!ÝcRç}5½à3&Îî ÕÞîcRç}ET3&Îëîè îÝH Ah¥±ñÝÎ=b8!cRç}¸Î Ìb8ETÝn;3ç}ÝÄ /-8 ETFîÝH°'Ý...¾Õç} Ý4.2
ñ
ñ
ñÎ
Î
Î
ç
ç
ç}
}
}î
î
îÝ
Ý
Ý6
6
6v
v
v
5
5
5
3cR.&Æá¼uÞ×ÍTÝ`«Ì Õ×ÍÞîÝè v ^b5P¨ésß´ 3ç}î0Õ×àÊ)Ý\ ®6vÝ5|6 v5ÞÎ6vWëîÝ s Ahµ5¿Þ ×T`«¢ó;Õ×ÍÞîÝ¿«è î ¬0Õ×Ít·Ý6v5ÍÕ°Ý ÕÓÎ8 {ÝÎ×ÍNP-hardÝ®ÞÆ 3[7]è×Í#åÝ] °0Õ×Í)ÊÝ ´&ÆBãÎÍÝcR©PÿáÎ ÝcRòP nv− ne+ nf= 2 − 2g (1)% 1: Õ°ø% Í nv ne nf 5½îÎîF\« ÝÍó g cRòPÿáÎcRòP¡ 5 ½EòP ëõyëÝÎÕ6v5 4.2.1 ÎÎÎcccRRRòòòPPP ëëëÝÝÝ666vvv555 EycRòP ëÝ΢×àÎîÝ6v aµÞÎ6vWëîÝ s ¬ ݸëî sÝ\&8!ETÆ6vÎÝ5ôbE Tn; ®ßETtàÆÝ]PµÎ¿à¸ àïX¼ ÝETFqA¸àï¼ ÝG"ÍE TF 3ç}î0´Ï×ÍETFõÍ¡°ÍET FÝty5|°f5xWÎÝ6vaA %2 4.2.2 ÎÎÎcccRRRòòòPPPyyyëëëÝÝÝ666vvv555 ÎÝcRòPyë`Ý6v5¬P °5¿ÝÞ×ÍTÝ`«×E×ÝÌ Õ×ÍÞ îÝ¿«î Í2à[7]Ý]P0Õ)ÊÝ6 v5!`¬á¸àï¼ ÝETFÝ ¸6vaºayETFî¹®ßETFP° Jݵsß JÍÕ°5W°ÍM» % 2: cRòP ëÝ56v 1. ݸ6vabÃÍÝETX|qA¸à ïX¼ ÝÍ×ÍETF0ÍÏÝ× Íë RF seed triangle ÞR ëõhëÝ\ÉtµÞhë ÏÝëóá×ÍÌb85Ý priority queue hµAëõR ëÝûÒ4 2. 3ãõRFûÒtÝëÞ hëõÍ\Ét¬ÞhëÏ Î ÉtÝëá ¥M»2àÕ ÞXbÝëÉtÞIëÉt¡ ºyìxW9ÍÏÝ\ loop õ,Ý\ dangling edge 3. Àt,Ý\ dangling edge 0©b× Í\=ÝFÞhFõ\ dangling edge É t¥M»3àÕXbFKbËÍ|îÝ\ 8= h`ºyìÈWÏ=Ý\ 4. yìÝ\ºxWÝ(loop)µAty5Ý] PÞµÝZà3KÝt¡ W6v5 ¸àï¼ ETFay¢ó¿«Ý\&ø `ºCWFP°3¢óç}îÉJ¸E TFP°8!EÆ3Õ6v5` tÝ ÊÎç}ÍÝcR©P²¬ÞETFá X|3M»2`ÞETFøëÝJ
(a) Þ6vaîÝFH43\ &î (b)W/IFÝ¢ó; % 3: ¢ó;Ä ª±¸ÍøÝëÉt AhETF µºa36v5î
4.3
ë
ë
ëî
î
îç
ç
ç}
}Ý
}
Ý
Ý¢
¢
¢ó
ó
ó;
;
;
&Æ¢[4]Ý®°Þëîç}¢ó;ÞîÝ¿« î´Þëî s5WËI5×I Î\& îÝF¨×I Î s/ÝF ËI55½¿à ì]PÌ ÕÞîè î \&Ì ∂M → ∂V Í ∂M Îëîè s M Ý\& ∂V ÎÞî¢ó s V Ý\& 34.2;&ÆÿÕÝÎÝ6va¬vµA6 va6 ήßëî s6 6vaµW Ýhëî sÝ\& qAëî s\&3ëîè ÝõH¶ïf»5µÝ]PÞ&FH 43×Í]sîA%3(a)Xî /IÌ M → V¿à[4]Ý]P¸ÐóuE y/IÝN×ÍFviÈìËÍ]P u(vi) = X k∈V(i) λi,ku(vk), (2) X k∈V(i) λi,k = 1, i = 1, 2, ..., n (3) ÍV(i)îFviÏÝF 1-ring n s FÝÍó4.4
E
E
ET
T
TF
F
F3
3
3¢
¢
¢ó
ó
óè
è
è
î
î
îÝ
Ý
Ý
J
J
J
Bã4.3¢ó;¡ÝÞîç} µÌbETn; ¬hETn;©ÊÎÍëîç}Ý¿¢© P Æm¢ã¸àïX¼ Ý©ÇETF¢ã ©ÇFÝET¸Þîç} =b¸àïXmÝ ETn; ãy¢ó;¬^bÊ©ÇFÝ HÆ!ÎÝ©ÇETFºay!Ý¢óè Hî&ÆÞ¢ãJ¢óç} HÝ]P ÞÎÝ©ÇFÉÕ8!Ý¢óè Hî¸ ©ÇF3¢óè 8E &Æ2à[5]Ý]P¼ JÞîç}ÝHÍÕ°5WìM» 1. ¼ ETFJ¡ÝH|ETF3&Î ¢óè HÝ¿í t¡JÝêÝ Hª±¢óç}JÝ-² 2. ñç}ã¢ó¿«Ý°ÍÐFõÍ /IÝETFBãÞîÝqz¹ë; ñ Ý=n;ñÍç} warp mesh 3. Õ¢óç}îÝF3X3Ýç}ë Ý¥T2ý barycentric coordinate 4. Jç}óã$ÎÉÕêÝ2ÝE TFÉETFÕêÝHîÉÄ 3æHõêÝH ¿àÞ-¨ ´ binary search Ý]P¾\ÎͺCW ç}ëö´¯ÝsßubJJ ç}Ýë;n; ¬¥±Õay ç}ëî&FÝ¥T2ý barycentric co-ordinate ¥M»4×àÕXbETF/ JÕêÝHî 5. ¥±Õ¢óç}ÝH¿à¢óç}î& FBÝ¥T2ý barycentric coordinate õ J¡Ýç}ëÐFH¥±Õ F3¢ó¿«H 6. ãy¢ó¿«ç}BãZ4CW¢óç}´ ¢ó;Ý©Pt¡Þá IÝJ J&©ÇFÝHª±¢ó;XCWÝ´ Ë|¾Õ´?Ý¢ó; ãy[5]ÝÕ°ÊàyÅ Ý-` warping îºà3Ì¢óç}Ý¿«`º¸ ¬ yç}îÝëBãç}J¡CW¢ó ç}5Pݨéh5P¨é3¢óç}îÎ) °Ý3h ݹ¬ç}ÝëD3 &ÆÞº½ç}îÝ\6væç}îÝë ¸æ¼¬y!ç}îÝë6vWË Í|¹5P¨éÝ®ßA%4Xî(a)¢ó;ç} (b)ñç}
(c)qAç}6væ
ç} (d)Wç}
% 4: ç}ø
4.5
¥
¥
¥
ç
ç
ç}
}
}
& Æ Þ 2 à & í 8(non-uniform)Ý ] P ¼ ¥ ç }&Æ¿àãø resampling [1]Ý]P qA æç}Ý`£;õ¢ó;ÄXCWÝÞî£ ]Ý´ËñÞî`£5µ%õ«´Ë% Þ `£%õ«´Ë%)ñ ×%¿à ×% v$5µÝµX ±ÎÝãø5µ ¢ ãÅ §Ý]PÞv$Ý ×%»ðW FpÝãø%3ãø%AFÝ5µµÎãøF 3¢óè îÝH qAãøF3¢óè Ý H¿àå§×Ýqz¹ë;ñç}8=n ; 4.5.1 ñññãããøøø%%% ãy¢ó;*ݧ×ëîç}ë«P° ¶ïf»¢ó;ÞîÝç}îh` u&Æ3 Þîè îí8ãøÍãøFET3ëîè î ¬× í8Ý5µÆ3X ãøÝ` & ÆÞá¢ó;ÄXCWÝ«´Ë¸ãø F3ëîè îí8Ý5µ 3&ÆÞæÎ`£õ¢ó;Ä XCWÝç}´Ëá5½C«´ Ë% area distortion map õ `£% curvature map ¸àïµ ÝmOJ«´Ë%õ` £%Ýf»®ß ×% control map ×% v$ÝÅ Ýv² `£T«´Ë´{ Ý2]¿àÅ § Ý]PÞ ×% »ðWãø%¯æ ×%v$´{Ý2] ÿ´{ÝãøÛ|ìÞ@M××1 1. ñ«´Ë%&ÆáëîÎç}3B Ä¢ó;ÝÄ¡¢ó;è Ýë« õæ¼3ëîè P°1¹8 X| Ýÿáë3ëîè õ¢ó;è Ý« -²ÕNÍë´Ë A3D/A2D Í A3D ë3ëîè Ý« A2D ë3¢óè îÝ«Â3Þî¢óè î.ëëcFqA A3D/A2D ®cF v$ÝÝ0%3¢ó¿«î Þë×× iÿÕ«´Ë% 2. ñ`£%&ÆENÍÎëîè îÝF ÕÍ{ú`£´EXbFviÕÍF õøëXWÝvoronoi regionA%5X î ëvI5 FP3ëPQRî
Ývoronoi regionÕëõ&ë voronoi region]P! uë & ë non-obtuse JF3hë Ývoronoi regoion AV oronoi=1 8 X j∈N1(i) (cot(αij)+cot(βij)k xi− xjk2 (4) uë ëJà£Ý]Pãÿ ëîÝvoronoi regoionuF ë î JF3hëîÝvoronoi re-goion hë«ÝÞ5 × uFÎë îÝvoronoi regoion hë« Ý°5 × JÕÎîF3øëX WÝvoronoi regoionÝ]P|Õ°Ý]P ¼î 1
Algorithm 1Õ voronoi regoion
AM ixed= 0
for each triangle T from the 1-ring neighborhood of x do
if T is non-obtuse then
AM ixed+=Voronoi region of x in T //Voronoi
safe,Add Voronoi formula else
//Voronoi inappropriate,Add either area(T)/2 or area(T)/4
if the angle of T at x is obtuse then AM ixed+ = area(T )/2 else AM ixed+ = area(T )/4 end if end if end for JÕhFÝ{ú`£ KG(Xi)= (2π − #f X j=1 θj)/AM ixed (5) ÿÕNFÝ{ú`£¿à{ú`£ ®FÝÝÞë××0%¼ÿÕ` £% 3. qA¸àïÝmO)«´Ë%õ`£ %ñ ×% ݸãøFÝ5µÌb % 5: voronoi regoionî% &ÎÝ©PÞ&ÎÝ ×%¿íÿÕ !Ý ×% 4. Þ ×%Bã §ÿÕãø% Å §Þ×v$%n»ðW×AçF p%ÝÕ° 3 ×%¯Î`£{Ý I5õ«´ËÝI5Ý´¸Bã §¡ÿÕ´{ÛÝãøf» æ¼ Õ°ºCWi÷2 dead zone ¸ Å 2]ºãø ݹi÷2 ݨé Þ ×%DH¬%× ÞæbÝÅ õ%ÝÅ îìPwW±ÝÅ hÅ DÄ §ÿÕîìPwÝãø%ã Íî]ÝI5 ÎÝÞîãøH¹ã øݨé 4.5.2 ñññççç}}}£££GGG ñFpÝãø%¡[ã%AFÝ2ý Hh2ýH ±ãøFÝH ÊãøFÝ 5µõëîç}\&Ý=P±ñÝÎÝF Àãø%îÝãøF¢óç}\&îÝFõ¸ àïX¼ ÝETF ÿÎFÝÞîH¡ ÞBãå§×Ýqz¹ë; ¥F Ý=£ G¥ç}£] ñ!ÝÞîç}¡&ÎqAh!Ýç }cRõæbÝο¢ÝHÞÞîç}î ÝF»ðÕëîÝHîAhñ±ÝëîÎ ÕÞîè F3ëîîÝHÄ6X hFayøÍæ¢óç}ëîu××
Çݨ´ÕÓ8 { Ý>Õ &ÆÞñ«õS% face index map Ý ñ«õS%¯ ç}îÝë!ÝÝ ÂµAëÝÞç}0%3«õS%î ã yÅ ÝÝݧ×X|Îç}«ÝÍ óy16581375(255*255*255)tÝç}ë ÍóÝ§× Å ÝõÒ÷Ý©P¸ ÕFÝaF®Þ`bìëË 1. Ñ@ÝÿÕFÝaFHFÝHayë 3«õS%îݪAÝH Æ©à# ÕF3«õSîÝݵÿáFÝ3ç} îÝaFH 2. ãÿÑ@ÝaFH. Å ÌbÒ÷Ý ©PãøFÝ2ý =Ý ÆãøF HBã; quantization »ðÒ÷Å ÝHî¬h;ÝĺCW aF¾\Ý ý0îh`¢ã¨´Å îÏFÝÝ ¹`ÝǨ´M» 3. ^bÑ@ÝëÝõSãyÅ b§Æç}îÝëP°3«õS%îª b Ýh`3µÇ¨´Ý]PX FÝa Fë X FayøÍë¡¿à¢óè Ý2 ýÕhF3hëÝ¥T2ý barycentric coordinate ¿àh¥T2ýõë3ëîè Ý2ýHÕF3ëîè ÝH 4.5.3 ëëëîîîÎÎÎççç}}}ttt···;;; 34.5.2;qz¹ë;qAÞîè Ý£G ñç}Ý=H¬hë;Ý3ëîè ¬× Ê ÆÊëîÝ£GÞç}=Ñ ;¾Õ?Ý=#n;ht·;5Wì«¿ÍI 5 1. 8ÌP regularity J8=n;¢ãø ð\=]' edge swap ¸ç}îNF8= Ý\Íó8
2. «Ý«õøf» face aspect ratio ¢ ãøð\=]' edge swap ¸ÎÝ îN Í«Ý«/ø2 ÝÂt¹«ë ÝD3 3. ;¿¢ÝH°JF3ëîè Ý H¸JÍÎ?¿â smooth Í] P ì]P 4p = 4t X i∈N (p) wi(qi− p) (6) Í 4t ×ÍÝðó N (p) ΫF p8=ÝFqi pÝ8=F wi ìP wi= (A3D
i cot(αi) + A3Di−1cot(βi))
Pn j=1A3Dj (7) Ï12I5x¸ç}=t·; connectivity optimization Ï3I 5 ¿ ¢ Ý t · ; geometry optimization Î ¥ B ã hëI5¸Î¼¿â smooth
4.6
ç
ç
ç}
}
}
kÝÎBãîÝM»¡¿à!ÝcR ç}®ß±ÝθΠÝFõF\õ\ «õ«Kb×E×vÌWÝn; X|3ÝÄ ©mÞËÎETFÝHqA` a P/-µ¾Õç}ÝêÝ5
D
D
D¡
¡
¡
Í Ý @ ® Î |C/C+++ à g )OpenGL0%ÐP0õGLUT;àÚѧÐP 03MS windows 2000®¼Ùì ¿àVisual C++6.0ÝPs"(ÙÝ s8n? Î3AMD Athlon TM XP 1500MHz CPU î 512MB DDRAMÝ PCîg)Nvidia Geforce4 Ti 4400ÝîþnXÿÍa ??; GH §Ý 5.1; Ä5.1
ç
ç
ç}
}
}
A % 6 Î B ° ò ù Ý ] P ? Î A µ¸àï¼ Î]'õETFÝ]P Ý!Þº¸Äb×øÝÓ¨[5.2
ç
ç
ç}
}
}
*
*
*
f
f
f´
´
´
|9\î°Ó¨ÝÎç}Õ°´ OÎ ÝETn;ÎtæpôÎt¥Ý× ½ÎÝcRòPÝÓ¦õ-²PÝ Þº¸Õ°?Óvp| ×ÝÄ 3[12]õ[14]à#3ëîÝè ÕÎ ÝETn; Ý3KÕÝÓÞæÎ ç}Bãç};Ýĸ&Î9\; 8!ÝÍó3ëîè Õ ç}ë Ý ¿¢ûÒ|¿¢ûÒ µA´0Îë Ý ETÿÕË;ç} ÝETn;¡;Ýç } Bã8!M»ÝL]6v subdivision scheme ÿÕ#æÎvÌETn;Ýç}ÿl h]Pà#¿à ο¢ûÒÝ-ûñETn ;4QBã;Ä3KÕÓ¬h]P ´ÊàyÏ8ÝÎîvp|E ©ÇF ÝET)§Ý × 3[8]õ[11]¿àÎ ÝET©ÇF6vç} W9Íëîç} s ÞæÓÝ©ÇFETÝ ®Þ;W s ÝET4Qh]P3ç} b?Ý[¬º¦¸àï 3¼ ©ÇF õ©ÇF =ÝHuÎÍÝcRò PÓ`Ê Ýç}6vX®ßÝëîç}Þ P°Ì ¿« CWç}¢ó;îÝæpvã y¼ 6vÝÓ{¸V;©ÇFÞÎ×Í pÞ Í¿àÕ°%´08!cRòPÎ ÝET6v]PÞÎ6vW×Ýëîç} à#3¢ó;ç}î¢ã ©ÇFÝETñJÍÎ ÝETn;h]P3K¸àï3¼ ©ÇF îÝHv. 6v]På©ÇFÝÅ( Æ@ 6v]P¡V;©ÇFÝ' ¬ êG6vÎW× sÝÕ°Ó ½Î cRòPÓ¦ ÆA¢Õ×Í?ÝE T6vÕ°ÞÎh]PÝ×Í¥ÞReferences
[1] Pierre Alliez, Mark Meyer, and Mathieu Des-brun. Interactive geometry remeshing. ACM
Transactions on Graphics, 21(3):347–354, July
2002.
[2] Lazarus F and Verroust A. Feature-based shape transformation for polyhedral objects. 1994.
[3] Lazarus F and Verroust A. Metamorphosis of cylinder-like objects. 1997.
[4] M. S. Floater. Parametrization and smooth ap-proximation of surface triangulations. Comp.
Aided Geom, 14:231–250, 1997.
[5] K. Fujimura and M. Makarov. Foldover-free image warping. Graphical Models and Image
Processing, 60(2):100–111, March 1998.
[6] A. Gregory, A. State, M. Lin, D. Manocha, and M. Livingston. Feature-based surface decompo-sition for correspondence and morphing between polyhedra. In Computer Animation ’98, June 1998.
[7] Xianfeng Gu, Steven J. Gortler, and Hugues Hoppe. Geometry images. ACM Transactions
on Graphics, 21(3):355–361, July 2002.
[8] Takashi Kanai, Hiromasa Suzuki, and Fumihiko Kimura. Metamorphosis of arbitrary triangular meshes. IEEE Computer Graphics &
Applica-tions, 20(2):62–75, 2000.
[9] James R. Kent, Wayne E. Carlson, and Richard E.Parent. Shape transformation for polyhedral objects. In Computer Graphics (Proceedings of
SIGGRAPH 92), volume 26, pages 47–54, July
1992.
[10] Jian-Liang Lin, Jung-Hong Chuang, Cheng-Chung Lin, and Chih-Chun Chen. Consistent mesh parametrizations using quinary patch sub-division. International Computer Symposium, 2002.
[11] Takashi Michikawa, Takashi Kanai, Masahiro Fujita, and Hiroaki Chiyokura. Multiresolution interpolation meshes. In Pacific Graphics 2001, Proc. 9th Pacific Graphics International Confer-ence, pages 60–69, October 2001.
[12] Ryutarou Ohbuchi, Yoshiyuki Kokojima, and Shigeo Takahashi. Blending shapes by using subdivision surfaces. Computers and Graphics, 25:41–58, 2001.
[13] Emil Praun, Wim Sweldens, and Peter Schr¨oder. Consistent mesh parameterizations. In
Pro-ceedings of ACM SIGGRAPH 2001, Computer
Graphics Proceedings, Annual Conference Se-ries, pages 179–184, August 2001.
[14] Shigeo Takahashi, Yoshiyuki Kokojima, and Ryutarou Ohbuchi. Explicit control of topologi-cal transitions in morphing shapes of 3d meshes.
Proc. 9th Pacific Graphics International Confer-ence, 2001.
