Continuous deformation of flat-foldable crease patterns via interpretation as set of twist-patterns

IF 4.8 2区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Journal of Computational Design and Engineering Pub Date : 2023-04-25 DOI:10.1093/jcde/qwad036
Yohei Yamamoto, J. Mitani
{"title":"Continuous deformation of flat-foldable crease patterns via interpretation as set of twist-patterns","authors":"Yohei Yamamoto, J. Mitani","doi":"10.1093/jcde/qwad036","DOIUrl":null,"url":null,"abstract":"In the study of origami, various parametric methods have been proposed to design crease patterns under geometric conditions for flat-folding. Each design method contributes to finding a desirable crease pattern, e.g., one with superior engineering properties, by manipulating parameters. On the other hand, to continuously deform other crease patterns, it is necessary to recreate it once with such a parametric method; however, this inverse problem is less studied. This paper is basic research to solve this problem and to allow parametric deformation of flat-foldable crease patterns. Given crease patterns are interpreted as networks consisting of twist-folding patterns that can be generated by an existing parametric method named Twist-based design method. Then, by manipulating the parameters, the crease pattern is deformed. Importantly, any flat-foldable crease pattern having no crease line connecting two points on the boundary can be targeted, and it is locally guaranteed that deformed crease patterns have non-intersecting crease lines and are flat-foldable. The proposed method contributes to increased origami variations by deformations of existing crease patterns.","PeriodicalId":48611,"journal":{"name":"Journal of Computational Design and Engineering","volume":"28 1","pages":"979-991"},"PeriodicalIF":4.8000,"publicationDate":"2023-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Design and Engineering","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1093/jcde/qwad036","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

In the study of origami, various parametric methods have been proposed to design crease patterns under geometric conditions for flat-folding. Each design method contributes to finding a desirable crease pattern, e.g., one with superior engineering properties, by manipulating parameters. On the other hand, to continuously deform other crease patterns, it is necessary to recreate it once with such a parametric method; however, this inverse problem is less studied. This paper is basic research to solve this problem and to allow parametric deformation of flat-foldable crease patterns. Given crease patterns are interpreted as networks consisting of twist-folding patterns that can be generated by an existing parametric method named Twist-based design method. Then, by manipulating the parameters, the crease pattern is deformed. Importantly, any flat-foldable crease pattern having no crease line connecting two points on the boundary can be targeted, and it is locally guaranteed that deformed crease patterns have non-intersecting crease lines and are flat-foldable. The proposed method contributes to increased origami variations by deformations of existing crease patterns.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过将可平折折痕图解释为一组扭转图而引起的连续变形
在折纸学的研究中,提出了各种参数化方法来设计几何条件下的平折折痕图。每种设计方法都有助于通过操纵参数找到理想的折痕图,例如具有优越工程性能的折痕图。另一方面,要使其他折痕图连续变形,则需要用这种参数化方法对折痕图进行一次重建;然而,这一反问题的研究较少。本文是解决这一问题,实现可平折折痕图参数化变形的基础研究。给定的折痕图案被解释为由扭曲折叠图案组成的网络,可以通过现有的参数化方法——基于扭曲的设计方法来生成。然后,通过操纵参数,使折痕图案变形。重要的是,任何在边界上没有连接两点的折痕线的可平折折痕图都可以被定位,并且局部保证变形的折痕图具有不相交的折痕线和可平折性。提出的方法有助于增加折纸变化的变形,现有的折痕模式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Computational Design and Engineering
Journal of Computational Design and Engineering Computer Science-Human-Computer Interaction
CiteScore
7.70
自引率
20.40%
发文量
125
期刊介绍: Journal of Computational Design and Engineering is an international journal that aims to provide academia and industry with a venue for rapid publication of research papers reporting innovative computational methods and applications to achieve a major breakthrough, practical improvements, and bold new research directions within a wide range of design and engineering: • Theory and its progress in computational advancement for design and engineering • Development of computational framework to support large scale design and engineering • Interaction issues among human, designed artifacts, and systems • Knowledge-intensive technologies for intelligent and sustainable systems • Emerging technology and convergence of technology fields presented with convincing design examples • Educational issues for academia, practitioners, and future generation • Proposal on new research directions as well as survey and retrospectives on mature field.
期刊最新文献
A Study on Ship Hull Form Transformation Using Convolutional Autoencoder A new approach for solving global optimization and engineering problems based on modified Sea Horse Optimizer Multi-strategy enhanced kernel search optimization and its application in economic emission dispatch problems BRepGAT: Graph neural network to segment machining feature faces in a B-rep model Embedding Deep Neural Network in Enhanced Schapery Theory for Progressive Failure Analysis of Fiber Reinforced Laminates
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1