基于 "尽可能刚性 "变形的二面埃舍尔式结构的创建

IF 7.8 1区 计算机科学 Q1 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Yuichi Nagata, Shinji Imahori
{"title":"基于 \"尽可能刚性 \"变形的二面埃舍尔式结构的创建","authors":"Yuichi Nagata, Shinji Imahori","doi":"10.1145/3638048","DOIUrl":null,"url":null,"abstract":"<p>An Escher-like tiling is a tiling consisting of one or a few artistic shapes of tile. This paper proposes a method for generating Escher-like tilings consisting of two distinct shapes (dihedral Escher-like tilings) that are as similar as possible to the two goal shapes specified by the user. This study is an extension of a previous study that successfully generated Escher-like tilings consisting of a single tile shape for a single goal shape. Building upon the previous study, our method attempts to exhaustively search for which parts of the discretized tile contours are adjacent to each other to form a tiling. For each configuration, two tile shapes are optimized to be similar to the given two goal shapes. By evaluating the similarity based on as-rigid-as possible deformation energy, the optimized tile shapes preserve the local structures of the goal shapes, even if substantial deformations are necessary to form a tiling. However, in the dihedral case, this approach is seemingly unrealistic because it suffers from the complexity of the energy function and the combinatorial explosion of the possible configurations. We developed a method to address these issues and show that the proposed algorithms can generate satisfactory dihedral Escher-like tilings in a realistic computation time, even for somewhat complex goal shapes.</p>","PeriodicalId":50913,"journal":{"name":"ACM Transactions on Graphics","volume":null,"pages":null},"PeriodicalIF":7.8000,"publicationDate":"2023-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Creation of Dihedral Escher-like Tilings Based on As-Rigid-As-Possible Deformation\",\"authors\":\"Yuichi Nagata, Shinji Imahori\",\"doi\":\"10.1145/3638048\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>An Escher-like tiling is a tiling consisting of one or a few artistic shapes of tile. This paper proposes a method for generating Escher-like tilings consisting of two distinct shapes (dihedral Escher-like tilings) that are as similar as possible to the two goal shapes specified by the user. This study is an extension of a previous study that successfully generated Escher-like tilings consisting of a single tile shape for a single goal shape. Building upon the previous study, our method attempts to exhaustively search for which parts of the discretized tile contours are adjacent to each other to form a tiling. For each configuration, two tile shapes are optimized to be similar to the given two goal shapes. By evaluating the similarity based on as-rigid-as possible deformation energy, the optimized tile shapes preserve the local structures of the goal shapes, even if substantial deformations are necessary to form a tiling. However, in the dihedral case, this approach is seemingly unrealistic because it suffers from the complexity of the energy function and the combinatorial explosion of the possible configurations. We developed a method to address these issues and show that the proposed algorithms can generate satisfactory dihedral Escher-like tilings in a realistic computation time, even for somewhat complex goal shapes.</p>\",\"PeriodicalId\":50913,\"journal\":{\"name\":\"ACM Transactions on Graphics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":7.8000,\"publicationDate\":\"2023-12-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Transactions on Graphics\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1145/3638048\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Graphics","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1145/3638048","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

摘要

类埃舍平铺是由一种或几种艺术形状的平铺组成的平铺。本文提出了一种方法,用于生成由两个不同形状组成的类埃舍尔平铺(二面埃舍尔平铺),这些平铺尽可能与用户指定的两个目标形状相似。这项研究是之前一项研究的延伸,之前的研究成功地生成了由单一目标形状的单一瓦片形状组成的类埃舍尔瓦片。在前一项研究的基础上,我们的方法试图详尽地搜索离散瓦片轮廓的哪些部分彼此相邻,从而形成一个瓦片。对于每种配置,都会优化两个瓦片形状,使其与给定的两个目标形状相似。通过基于尽可能刚性的变形能量来评估相似度,优化后的瓦片形状保留了目标形状的局部结构,即使为了形成平铺而必须进行大量变形。然而,在二面体情况下,这种方法似乎并不现实,因为它受到能量函数的复杂性和可能配置的组合爆炸的影响。我们开发了一种方法来解决这些问题,并证明所提出的算法能在实际计算时间内生成令人满意的二面埃舍尔式平铺,即使目标形状有些复杂也不例外。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Creation of Dihedral Escher-like Tilings Based on As-Rigid-As-Possible Deformation

An Escher-like tiling is a tiling consisting of one or a few artistic shapes of tile. This paper proposes a method for generating Escher-like tilings consisting of two distinct shapes (dihedral Escher-like tilings) that are as similar as possible to the two goal shapes specified by the user. This study is an extension of a previous study that successfully generated Escher-like tilings consisting of a single tile shape for a single goal shape. Building upon the previous study, our method attempts to exhaustively search for which parts of the discretized tile contours are adjacent to each other to form a tiling. For each configuration, two tile shapes are optimized to be similar to the given two goal shapes. By evaluating the similarity based on as-rigid-as possible deformation energy, the optimized tile shapes preserve the local structures of the goal shapes, even if substantial deformations are necessary to form a tiling. However, in the dihedral case, this approach is seemingly unrealistic because it suffers from the complexity of the energy function and the combinatorial explosion of the possible configurations. We developed a method to address these issues and show that the proposed algorithms can generate satisfactory dihedral Escher-like tilings in a realistic computation time, even for somewhat complex goal shapes.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
ACM Transactions on Graphics
ACM Transactions on Graphics 工程技术-计算机:软件工程
CiteScore
14.30
自引率
25.80%
发文量
193
审稿时长
12 months
期刊介绍: ACM Transactions on Graphics (TOG) is a peer-reviewed scientific journal that aims to disseminate the latest findings of note in the field of computer graphics. It has been published since 1982 by the Association for Computing Machinery. Starting in 2003, all papers accepted for presentation at the annual SIGGRAPH conference are printed in a special summer issue of the journal.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信