变形棍图使用优化的兼容三角

Vitaly Surazhsky, C. Gotsman
{"title":"变形棍图使用优化的兼容三角","authors":"Vitaly Surazhsky, C. Gotsman","doi":"10.1109/PCCGA.2001.962856","DOIUrl":null,"url":null,"abstract":"A \"stick figure\" is a connected straight-line plane graph, sometimes called a \"skeleton\". Compatible stick figures are those with the same topological structure. We present a method for naturally morphing between two compatible stick figures in a manner that preserves compatibility throughout the morph. In particular, this guarantees that the intermediate shapes are also stick figures (e.g. they do not self-intersect). Our method generalizes existing algorithms for morphing compatible planar polygons using Steiner vertices, and improves the complexity of those algorithms by reducing the number of Steiner vertices used.","PeriodicalId":387699,"journal":{"name":"Proceedings Ninth Pacific Conference on Computer Graphics and Applications. Pacific Graphics 2001","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2001-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"Morphing stick figures using optimized compatible triangulations\",\"authors\":\"Vitaly Surazhsky, C. Gotsman\",\"doi\":\"10.1109/PCCGA.2001.962856\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A \\\"stick figure\\\" is a connected straight-line plane graph, sometimes called a \\\"skeleton\\\". Compatible stick figures are those with the same topological structure. We present a method for naturally morphing between two compatible stick figures in a manner that preserves compatibility throughout the morph. In particular, this guarantees that the intermediate shapes are also stick figures (e.g. they do not self-intersect). Our method generalizes existing algorithms for morphing compatible planar polygons using Steiner vertices, and improves the complexity of those algorithms by reducing the number of Steiner vertices used.\",\"PeriodicalId\":387699,\"journal\":{\"name\":\"Proceedings Ninth Pacific Conference on Computer Graphics and Applications. Pacific Graphics 2001\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-10-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Ninth Pacific Conference on Computer Graphics and Applications. Pacific Graphics 2001\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCGA.2001.962856\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Ninth Pacific Conference on Computer Graphics and Applications. Pacific Graphics 2001","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCGA.2001.962856","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

摘要

“简笔画”是一个相连的直线平面图形,有时被称为“骨架”。兼容的简笔画是指具有相同拓扑结构的简笔画。我们提出了一种在两个兼容的简笔画之间自然变形的方法,以保持整个变形的兼容性。特别是,这保证了中间形状也是简笔画(例如,它们不会自相交)。该方法推广了现有的基于斯坦纳顶点的平面多边形变形算法,并通过减少斯坦纳顶点的数量来提高算法的复杂度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Morphing stick figures using optimized compatible triangulations
A "stick figure" is a connected straight-line plane graph, sometimes called a "skeleton". Compatible stick figures are those with the same topological structure. We present a method for naturally morphing between two compatible stick figures in a manner that preserves compatibility throughout the morph. In particular, this guarantees that the intermediate shapes are also stick figures (e.g. they do not self-intersect). Our method generalizes existing algorithms for morphing compatible planar polygons using Steiner vertices, and improves the complexity of those algorithms by reducing the number of Steiner vertices used.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信