Displaced subdivision meshes

Muhammad Hussain, Yoshihiro Okada, Koichi Niijima

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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. 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.

Original languageEnglish
Title of host publicationProceedings of the IASTED International Conference on Modelling, Simulation and Optimatization
EditorsM.H. Hamza, M.H. Hamza
Pages214-219
Number of pages6
Publication statusPublished - 2003
EventProceedings of the IASTED International Conference on Modelling, Sumulation and Optimization - Banff, Alta., Canada
Duration: Jul 2 2003Jul 4 2003

Other

OtherProceedings of the IASTED International Conference on Modelling, Sumulation and Optimization
CountryCanada
CityBanff, Alta.
Period7/2/037/4/03

Fingerprint

Subdivision
Mesh
visualization
hardware
heuristics
threat
Data storage equipment
Graphics Hardware
Normal Space
Sparse Linear Systems
Triangular Mesh
Multiresolution
Rendering
Simplification
connectivity
Connectivity
Extremes
Visualization
Heuristics
Hardware

All Science Journal Classification (ASJC) codes

  • Development
  • Modelling and Simulation

Cite this

Hussain, M., Okada, Y., & Niijima, K. (2003). Displaced subdivision meshes. In M. H. Hamza, & M. H. Hamza (Eds.), Proceedings of the IASTED International Conference on Modelling, Simulation and Optimatization (pp. 214-219)

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

Proceedings of the IASTED International Conference on Modelling, Simulation and Optimatization. ed. / M.H. Hamza; M.H. Hamza. 2003. p. 214-219.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hussain, M, Okada, Y & Niijima, K 2003, Displaced subdivision meshes. in MH Hamza & MH Hamza (eds), Proceedings of the IASTED International Conference on Modelling, Simulation and Optimatization. pp. 214-219, Proceedings of the IASTED International Conference on Modelling, Sumulation and Optimization, Banff, Alta., Canada, 7/2/03.
Hussain M, Okada Y, Niijima K. Displaced subdivision meshes. In Hamza MH, Hamza MH, editors, Proceedings of the IASTED International Conference on Modelling, Simulation and Optimatization. 2003. p. 214-219
Hussain, Muhammad ; Okada, Yoshihiro ; Niijima, Koichi. / Displaced subdivision meshes. Proceedings of the IASTED International Conference on Modelling, Simulation and Optimatization. editor / M.H. Hamza ; M.H. Hamza. 2003. pp. 214-219
@inproceedings{53d1cf44be254addac72d7d5d9bd481f,
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. 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.",
author = "Muhammad Hussain and Yoshihiro Okada and Koichi Niijima",
year = "2003",
language = "English",
isbn = "0889863725",
pages = "214--219",
editor = "M.H. Hamza and M.H. Hamza",
booktitle = "Proceedings of the IASTED International Conference on Modelling, Simulation and Optimatization",

}

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

SP - 214

EP - 219

BT - Proceedings of the IASTED International Conference on Modelling, Simulation and Optimatization

A2 - Hamza, M.H.

A2 - Hamza, M.H.

ER -