{"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}
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.