3D model generation by morphing

研究成果: 著書/レポートタイプへの貢献会議での発言

1 引用 (Scopus)

抄録

This paper proposes a 3D model generation system that outputs intermediate3D 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.

元の言語英語
ホスト出版物のタイトルProceedings - Computer Graphics, Imaging and Visualisation
ホスト出版物のサブタイトルTechniques and Applications, CGIV'06
ページ341-346
ページ数6
2006
DOI
出版物ステータス出版済み - 12 1 2006
イベントInternational Conference on Computer Graphics, Imaging and Visualisation, CGIV'06 - Sydney, オーストラリア
継続期間: 7 26 20067 28 2006

その他

その他International Conference on Computer Graphics, Imaging and Visualisation, CGIV'06
オーストラリア
Sydney
期間7/26/067/28/06

Fingerprint

Animation
Semantics
Topology

All Science Journal Classification (ASJC) codes

  • Computer Graphics and Computer-Aided Design
  • Software

これを引用

Kaneko, K., Okada, Y., & Niijima, K. (2006). 3D model generation by morphing. : Proceedings - Computer Graphics, Imaging and Visualisation: Techniques and Applications, CGIV'06 (巻 2006, pp. 341-346). [1663814] https://doi.org/10.1109/CGIV.2006.4

3D model generation by morphing. / Kaneko, Kosuke; Okada, Yoshihiro; Niijima, Koichi.

Proceedings - Computer Graphics, Imaging and Visualisation: Techniques and Applications, CGIV'06. 巻 2006 2006. p. 341-346 1663814.

研究成果: 著書/レポートタイプへの貢献会議での発言

Kaneko, K, Okada, Y & Niijima, K 2006, 3D model generation by morphing. : Proceedings - Computer Graphics, Imaging and Visualisation: Techniques and Applications, CGIV'06. 巻. 2006, 1663814, pp. 341-346, International Conference on Computer Graphics, Imaging and Visualisation, CGIV'06, Sydney, オーストラリア, 7/26/06. https://doi.org/10.1109/CGIV.2006.4
Kaneko K, Okada Y, Niijima K. 3D model generation by morphing. : Proceedings - Computer Graphics, Imaging and Visualisation: Techniques and Applications, CGIV'06. 巻 2006. 2006. p. 341-346. 1663814 https://doi.org/10.1109/CGIV.2006.4
Kaneko, Kosuke ; Okada, Yoshihiro ; Niijima, Koichi. / 3D model generation by morphing. Proceedings - Computer Graphics, Imaging and Visualisation: Techniques and Applications, CGIV'06. 巻 2006 2006. pp. 341-346
@inproceedings{2f8062bb76124ddfbf04732d2e1830f2,
title = "3D model generation by morphing",
abstract = "This paper proposes a 3D model generation system that outputs intermediate3D 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.",
author = "Kosuke Kaneko and Yoshihiro Okada and Koichi Niijima",
year = "2006",
month = "12",
day = "1",
doi = "10.1109/CGIV.2006.4",
language = "English",
isbn = "0769526063",
volume = "2006",
pages = "341--346",
booktitle = "Proceedings - Computer Graphics, Imaging and Visualisation",

}

TY - GEN

T1 - 3D model generation by morphing

AU - Kaneko, Kosuke

AU - Okada, Yoshihiro

AU - Niijima, Koichi

PY - 2006/12/1

Y1 - 2006/12/1

N2 - This paper proposes a 3D model generation system that outputs intermediate3D 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.

AB - This paper proposes a 3D model generation system that outputs intermediate3D 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.

UR - http://www.scopus.com/inward/record.url?scp=34247599017&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34247599017&partnerID=8YFLogxK

U2 - 10.1109/CGIV.2006.4

DO - 10.1109/CGIV.2006.4

M3 - Conference contribution

AN - SCOPUS:34247599017

SN - 0769526063

SN - 9780769526065

VL - 2006

SP - 341

EP - 346

BT - Proceedings - Computer Graphics, Imaging and Visualisation

ER -