TY - GEN
T1 - Displaced subdivision meshes
AU - Hussain, Muhammad
AU - Okada, Yoshihiro
AU - Niijima, Koichi
PY - 2003
Y1 - 2003
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. and the resulting surface has more levels of detail due to the specific nature of √3 sub-division 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. and the resulting surface has more levels of detail due to the specific nature of √3 sub-division 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=1542433804&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=1542433804&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:1542433804
SN - 0889863725
SN - 9780889863729
T3 - Proceedings of the IASTED International Conference on Modelling, Simulation and Optimatization
SP - 214
EP - 219
BT - Proceedings of the IASTED International Conference on Modelling, Simulation and Optimatization
A2 - Hamza, M.H.
A2 - Hamza, M.H.
T2 - Proceedings of the IASTED International Conference on Modelling, Sumulation and Optimization
Y2 - 2 July 2003 through 4 July 2003
ER -