View : 20 Download: 0

Learning to segment and unfold polyhedral mesh from failures

Title
Learning to segment and unfold polyhedral mesh from failures
Authors
Xi, ZhonghuaKim, Yun-hyeongKim, Young J.Lien, Jyh-Ming
Ewha Authors
김영준
SCOPUS Author ID
김영준scopus
Issue Date
2016
Journal Title
COMPUTERS & GRAPHICS-UK
ISSN
0097-8493JCR Link1873-7684JCR Link
Citation
vol. 58, pp. 139 - 149
Keywords
UnfoldingFoldingSegmentationShape analysisPaper craftMesh processing
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Indexed
SCIE; SCOPUS WOS scopus
Abstract
Folding planar sheets to make 3D shapes from is an ancient practice with many new applications, ranging from personal fabrication of customized items to design of surgical instruments for minimally invasive surgery in self-folding machines. Given a polyhedral mesh, unfolding is an operation of cutting and flattening the mesh. The flattened polyhedral nets are then cut out of planar materials and folded back to 3D. Unfolding a polyhedral mesh into planar nets usually require segmentation. Either used as a preprocessing step to simplify the mesh and provide semantics or as the result of unfolding to avoid overlapping, the segmentation and the unfolding operations are decoupled. Consequently, segmented components may not be unfoldable and unfolded nets usually provide no semantic meaning and make folding difficult. In this paper, we propose a strategy that tightly couples unfolding and segmentation. We show that the proposed method produces unfoldable segmentation that resembles carefully designed paper craft. The key idea that enables this capability is an algorithm that learns from failed unfoldings. (C) 2016 Elsevier Ltd. All rights reserved.
DOI
10.1016/j.cag.2016.05.022
Appears in Collections:
엘텍공과대학 > 컴퓨터공학과 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE