Displaced subdivision meshes

Muhammad Hussain, Yoshihiro Okada, Koichi Niijima

研究成果: ジャーナルへの寄稿記事

抄録

In various visualization application contexts, shapes are often represented by triangular meshes, which are of extreme complexity and their storage, transmission, and rendering is a threat to the available graphics hardware. The displaced subdivision mesh is an alternative surface representation, which because of its regular connectivity and being amenable to multiresolution structure successfully tackles these problems. This surface representation defines a detailed mesh with a displacement map over a smooth domain surface. The construction of smooth domain surface is the challenging task in this representation. In this paper we introduce a new method to define smooth domain surface based on √3 subdivision. In our algorithm, we exploit a memory efficient and fast simplification method with simple heuristic that helps preserve the normal space of the original surface and linear sparse system to define optimized control mesh, so it is computationally more efficient and consumes less memory as compared to the original algorithm by Lee et al.[10] and the resulting surface has more levels of detail due to the specific nature of √3 subdivision if a prescribed target complexity of the mesh must not be exceeded. To corroborate our approach, we present the conversion results using several models.

元の言語英語
記事番号415-061
ページ(範囲)497-502
ページ数6
ジャーナルUnknown Journal
出版物ステータス出版済み - 2004

Fingerprint

Data storage equipment
heuristics
hardware
visualization
connectivity
Visualization
Hardware
method
preserve

All Science Journal Classification (ASJC) codes

  • Engineering(all)

これを引用

Hussain, M., Okada, Y., & Niijima, K. (2004). Displaced subdivision meshes. Unknown Journal, 497-502. [415-061].

Displaced subdivision meshes. / Hussain, Muhammad; Okada, Yoshihiro; Niijima, Koichi.

:: Unknown Journal, 2004, p. 497-502.

研究成果: ジャーナルへの寄稿記事

Hussain, M, Okada, Y & Niijima, K 2004, 'Displaced subdivision meshes', Unknown Journal, pp. 497-502.
Hussain M, Okada Y, Niijima K. Displaced subdivision meshes. Unknown Journal. 2004;497-502. 415-061.
Hussain, Muhammad ; Okada, Yoshihiro ; Niijima, Koichi. / Displaced subdivision meshes. :: Unknown Journal. 2004 ; pp. 497-502.
@article{fc06ae5c3f164be5af6dab5bb72a5458,
title = "Displaced subdivision meshes",
abstract = "In various visualization application contexts, shapes are often represented by triangular meshes, which are of extreme complexity and their storage, transmission, and rendering is a threat to the available graphics hardware. The displaced subdivision mesh is an alternative surface representation, which because of its regular connectivity and being amenable to multiresolution structure successfully tackles these problems. This surface representation defines a detailed mesh with a displacement map over a smooth domain surface. The construction of smooth domain surface is the challenging task in this representation. In this paper we introduce a new method to define smooth domain surface based on √3 subdivision. In our algorithm, we exploit a memory efficient and fast simplification method with simple heuristic that helps preserve the normal space of the original surface and linear sparse system to define optimized control mesh, so it is computationally more efficient and consumes less memory as compared to the original algorithm by Lee et al.[10] and the resulting surface has more levels of detail due to the specific nature of √3 subdivision if a prescribed target complexity of the mesh must not be exceeded. To corroborate our approach, we present the conversion results using several models.",
author = "Muhammad Hussain and Yoshihiro Okada and Koichi Niijima",
year = "2004",
language = "English",
pages = "497--502",
journal = "Quaternary International",
issn = "1040-6182",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - Displaced subdivision meshes

AU - Hussain, Muhammad

AU - Okada, Yoshihiro

AU - Niijima, Koichi

PY - 2004

Y1 - 2004

N2 - In various visualization application contexts, shapes are often represented by triangular meshes, which are of extreme complexity and their storage, transmission, and rendering is a threat to the available graphics hardware. The displaced subdivision mesh is an alternative surface representation, which because of its regular connectivity and being amenable to multiresolution structure successfully tackles these problems. This surface representation defines a detailed mesh with a displacement map over a smooth domain surface. The construction of smooth domain surface is the challenging task in this representation. In this paper we introduce a new method to define smooth domain surface based on √3 subdivision. In our algorithm, we exploit a memory efficient and fast simplification method with simple heuristic that helps preserve the normal space of the original surface and linear sparse system to define optimized control mesh, so it is computationally more efficient and consumes less memory as compared to the original algorithm by Lee et al.[10] and the resulting surface has more levels of detail due to the specific nature of √3 subdivision if a prescribed target complexity of the mesh must not be exceeded. To corroborate our approach, we present the conversion results using several models.

AB - In various visualization application contexts, shapes are often represented by triangular meshes, which are of extreme complexity and their storage, transmission, and rendering is a threat to the available graphics hardware. The displaced subdivision mesh is an alternative surface representation, which because of its regular connectivity and being amenable to multiresolution structure successfully tackles these problems. This surface representation defines a detailed mesh with a displacement map over a smooth domain surface. The construction of smooth domain surface is the challenging task in this representation. In this paper we introduce a new method to define smooth domain surface based on √3 subdivision. In our algorithm, we exploit a memory efficient and fast simplification method with simple heuristic that helps preserve the normal space of the original surface and linear sparse system to define optimized control mesh, so it is computationally more efficient and consumes less memory as compared to the original algorithm by Lee et al.[10] and the resulting surface has more levels of detail due to the specific nature of √3 subdivision if a prescribed target complexity of the mesh must not be exceeded. To corroborate our approach, we present the conversion results using several models.

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

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

M3 - Article

SP - 497

EP - 502

JO - Quaternary International

JF - Quaternary International

SN - 1040-6182

M1 - 415-061

ER -