{"title":"通过变形生成3D模型","authors":"Kosuke Kaneko, Y. Okada, K. Niijima","doi":"10.1109/CGIV.2006.4","DOIUrl":null,"url":null,"abstract":"This paper proposes a 3D model generation system that outputs intermediate 3D shape models between two already existing 3D models by morphing. Although there have been a lot of computer animation software, it takes a long time to create a 3D shape model even using such computer animation software. Morphing is one of the techniques used to easily create 3D models. If we have two different 3D shape models, it is possible to generate intermediate 3D shape models between them by morphing. However, there are two main problems in the morphing of polygonal models. Those are vertex mismatch and semantic topology mismatch. In this paper, the authors propose an algorithm that is free from the vertex mismatch problem and that automatically determines the semantic topology match. The proposed system based on the algorithm decomposes both two polygonal models, makes decomposed element pairs between them, and then generates intermediate 3D shape models by morphing as for the decomposed element pairs automatically","PeriodicalId":264596,"journal":{"name":"International Conference on Computer Graphics, Imaging and Visualisation (CGIV'06)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"3D Model Generation by Morphing\",\"authors\":\"Kosuke Kaneko, Y. Okada, K. Niijima\",\"doi\":\"10.1109/CGIV.2006.4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a 3D model generation system that outputs intermediate 3D shape models between two already existing 3D models by morphing. Although there have been a lot of computer animation software, it takes a long time to create a 3D shape model even using such computer animation software. Morphing is one of the techniques used to easily create 3D models. If we have two different 3D shape models, it is possible to generate intermediate 3D shape models between them by morphing. However, there are two main problems in the morphing of polygonal models. Those are vertex mismatch and semantic topology mismatch. In this paper, the authors propose an algorithm that is free from the vertex mismatch problem and that automatically determines the semantic topology match. The proposed system based on the algorithm decomposes both two polygonal models, makes decomposed element pairs between them, and then generates intermediate 3D shape models by morphing as for the decomposed element pairs automatically\",\"PeriodicalId\":264596,\"journal\":{\"name\":\"International Conference on Computer Graphics, Imaging and Visualisation (CGIV'06)\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Computer Graphics, Imaging and Visualisation (CGIV'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CGIV.2006.4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Computer Graphics, Imaging and Visualisation (CGIV'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CGIV.2006.4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper proposes a 3D model generation system that outputs intermediate 3D shape models between two already existing 3D models by morphing. Although there have been a lot of computer animation software, it takes a long time to create a 3D shape model even using such computer animation software. Morphing is one of the techniques used to easily create 3D models. If we have two different 3D shape models, it is possible to generate intermediate 3D shape models between them by morphing. However, there are two main problems in the morphing of polygonal models. Those are vertex mismatch and semantic topology mismatch. In this paper, the authors propose an algorithm that is free from the vertex mismatch problem and that automatically determines the semantic topology match. The proposed system based on the algorithm decomposes both two polygonal models, makes decomposed element pairs between them, and then generates intermediate 3D shape models by morphing as for the decomposed element pairs automatically