Segmenting Periodic Reliefs on Triangle Meshes

نویسندگان

  • Shenglan Liu
  • Ralph R. Martin
  • Frank C. Langbein
  • Paul L. Rosin
چکیده

Decorative reliefs are widely used for e.g. packaging and porcelain design. In periodic reliefs, the relief repeats a pattern, for example all the way around an underlying surface of revolution. Reverseengineering of existing reliefs allows them to be re-applied to different base surfaces; we show here how to segment a single repeat unit of a periodic relief starting from a scanned triangle mesh. We first briefly review how we segment the relief from the background surface using our previous work. The rest of the paper then concentrates on how we extract a single repeat unit from the relief. To do so, the user provides two points on one relief boundary which are in approximate correspondence on consecutive repeats of the relief. We first refine the relative locations of these points, and then determine a third corresponding point using relief boundary information. These are used to determine three initial cutting planes across the relief. Then surface registration strategies are utilised to refine the correspondence between adjacent repeat units. Finally, we refine the exact locations of the cutting planes by considering only surface information close to the cutting planes. This allows a repeat unit of the periodic relief to be extracted. We demonstrate that our algorithm is successful and practical, using various real scanned models: user input can be quite imprecise, and we can cope with hand-made reliefs in which the pattern units are only approximately copies of each other.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Segmenting Reliefs on Triangle Meshes

!8*&,0*/'& !"#$"%& '/# D)<#&? *7#< )$ >'/)6*7 )$<*70/)#7 96/ ,*/,67#7 7*8" '7 ',,&?)$% 4/'$<7 06 ,'82'%)$% '$< <#86/'0)$% ,6/8#&')$E$ 6/<#/ 06 #'7)&? ',,&? /#&)#97 06 3CF :6<#&7; )0 )7 690#$ <#7)/'4&# 06 /#>#/7#G#$%)$##/ ,/#>)6*7&? <#7)%$#< '$< :'$*9'80*/#< /#&)#97HF 78'$$#/7 8'$ %#$#/'0# 0/)'$%&# :#7"#7 9/6: 64I#807 D)0" /#&)#97J "6D#>#/; ,/#>)6*7 :#7" 7#%:#$0'0)6$ D6/2 "'7 $60 86$7)<#/#< 0"# ...

متن کامل

Segmenting Reliefs on Triangle Meshes

!8*&,0*/'& !"#$"%& '/# D)<#&? *7#< )$ >'/)6*7 )$<*70/)#7 96/ ,*/,67#7 7*8" '7 ',,&?)$% 4/'$<7 06 ,'82'%)$% '$< <#86/'0)$% ,6/8#&')$E$ 6/<#/ 06 #'7)&? ',,&? /#&)#97 06 3CF :6<#&7; )0 )7 690#$ <#7)/'4&# 06 /#>#/7#G#$%)$##/ ,/#>)6*7&? <#7)%$#< '$< :'$*9'80*/#< /#&)#97HF 78'$$#/7 8'$ %#$#/'0# 0/)'$%&# :#7"#7 9/6: 64I#807 D)0" /#&)#97J "6D#>#/; ,/#>)6*7 :#7" 7#%:#$0'0)6$ D6/2 "'7 $60 86$7)<#/#< 0"# ...

متن کامل

1 Unstable periodic discrete minimal surfaces

In this paper we define the new alignment energy for non-conforming triangle meshes, and describes its use to compute unstable conforming discrete minimal surfaces. Our algorithm makes use of the duality between conforming and non-conforming discrete minimal surfaces which was observed earlier. In first experiments the new algorithm allows us the computation of unstable periodic discrete minima...

متن کامل

Shape-Preserving Meshes

Smooth surfaces are approximated by discrete triangle meshes for applications in computer graphics. Various discrete operators have been proposed for estimating differential quantities of triangle meshes, such as curvatures, for geometric processing tasks. Since a smooth surface can be approximated by many different triangle meshes, we propose to investigate which triangle mesh yields an estima...

متن کامل

Subdivision Tree Representation of Arbitrary Triangle Meshes

We investigate a new way to represent arbitrary triangle meshes. We prove that a large class of triangle meshes, called normal triangle meshes, can be represented by a subdivision tree, where each subdivision is one of four elementary subdivision types. We also show how to partition an arbitrary triangle mesh into a small set of normal meshes. The subdivision tree representation can be used to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007