A fast and memory-efficient method for LOD modeling of polygonal models

M. Hussain, Yoshihiro Okada, K. Niijima

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

8 Citations (Scopus)

Abstract

Ever growing complexity of polygonal models hinders the rendering and manipulation of such models on available graphics hardware resources. LOD (level of detail) management only can make such models suitable for various applications. We propose an automatic method for generating LODs of a given polygonal model that is based on edge collapse operation. In an edge collapse algorithm, the way how to measure the error introduced as a result of an edge collapse transformation plays a crucial role in determining the ordering of such transformations. We introduce a measure of geometric deviation, which is based on local evaluation and accumulation of error, and is simple to implement, involves short running times, is memory efficient and preserves geometric features and discontinuities automatically. Results and numerical comparisons show that our algorithm generates simplified models at different LODs of good visual fidelity, which are comparable with those by other methods.

Original languageEnglish
Title of host publicationProceedings - 2003 International Conference on Geometric Modeling and Graphics, GMAG 2003
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages137-142
Number of pages6
ISBN (Electronic)0769519857, 9780769519852
DOIs
Publication statusPublished - Jan 1 2003
Event2003 International Conference on Geometric Modeling and Graphics, GMAG 2003 - London, United Kingdom
Duration: Jul 16 2003Jul 18 2003

Other

Other2003 International Conference on Geometric Modeling and Graphics, GMAG 2003
CountryUnited Kingdom
CityLondon
Period7/16/037/18/03

Fingerprint

Data storage equipment
Computer simulation
Modeling
Graphics Hardware
Model
Numerical Comparisons
Rendering
Fidelity
Manipulation
Discontinuity
Deviation
Hardware
Resources
Evaluation

All Science Journal Classification (ASJC) codes

  • Modelling and Simulation
  • Computer Graphics and Computer-Aided Design
  • Geometry and Topology

Cite this

Hussain, M., Okada, Y., & Niijima, K. (2003). A fast and memory-efficient method for LOD modeling of polygonal models. In Proceedings - 2003 International Conference on Geometric Modeling and Graphics, GMAG 2003 (pp. 137-142). [1219678] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/GMAG.2003.1219678

A fast and memory-efficient method for LOD modeling of polygonal models. / Hussain, M.; Okada, Yoshihiro; Niijima, K.

Proceedings - 2003 International Conference on Geometric Modeling and Graphics, GMAG 2003. Institute of Electrical and Electronics Engineers Inc., 2003. p. 137-142 1219678.

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

Hussain, M, Okada, Y & Niijima, K 2003, A fast and memory-efficient method for LOD modeling of polygonal models. in Proceedings - 2003 International Conference on Geometric Modeling and Graphics, GMAG 2003., 1219678, Institute of Electrical and Electronics Engineers Inc., pp. 137-142, 2003 International Conference on Geometric Modeling and Graphics, GMAG 2003, London, United Kingdom, 7/16/03. https://doi.org/10.1109/GMAG.2003.1219678
Hussain M, Okada Y, Niijima K. A fast and memory-efficient method for LOD modeling of polygonal models. In Proceedings - 2003 International Conference on Geometric Modeling and Graphics, GMAG 2003. Institute of Electrical and Electronics Engineers Inc. 2003. p. 137-142. 1219678 https://doi.org/10.1109/GMAG.2003.1219678
Hussain, M. ; Okada, Yoshihiro ; Niijima, K. / A fast and memory-efficient method for LOD modeling of polygonal models. Proceedings - 2003 International Conference on Geometric Modeling and Graphics, GMAG 2003. Institute of Electrical and Electronics Engineers Inc., 2003. pp. 137-142
@inproceedings{25f0fe165fcd4ad998e4846d331cffef,
title = "A fast and memory-efficient method for LOD modeling of polygonal models",
abstract = "Ever growing complexity of polygonal models hinders the rendering and manipulation of such models on available graphics hardware resources. LOD (level of detail) management only can make such models suitable for various applications. We propose an automatic method for generating LODs of a given polygonal model that is based on edge collapse operation. In an edge collapse algorithm, the way how to measure the error introduced as a result of an edge collapse transformation plays a crucial role in determining the ordering of such transformations. We introduce a measure of geometric deviation, which is based on local evaluation and accumulation of error, and is simple to implement, involves short running times, is memory efficient and preserves geometric features and discontinuities automatically. Results and numerical comparisons show that our algorithm generates simplified models at different LODs of good visual fidelity, which are comparable with those by other methods.",
author = "M. Hussain and Yoshihiro Okada and K. Niijima",
year = "2003",
month = "1",
day = "1",
doi = "10.1109/GMAG.2003.1219678",
language = "English",
pages = "137--142",
booktitle = "Proceedings - 2003 International Conference on Geometric Modeling and Graphics, GMAG 2003",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

T1 - A fast and memory-efficient method for LOD modeling of polygonal models

AU - Hussain, M.

AU - Okada, Yoshihiro

AU - Niijima, K.

PY - 2003/1/1

Y1 - 2003/1/1

N2 - Ever growing complexity of polygonal models hinders the rendering and manipulation of such models on available graphics hardware resources. LOD (level of detail) management only can make such models suitable for various applications. We propose an automatic method for generating LODs of a given polygonal model that is based on edge collapse operation. In an edge collapse algorithm, the way how to measure the error introduced as a result of an edge collapse transformation plays a crucial role in determining the ordering of such transformations. We introduce a measure of geometric deviation, which is based on local evaluation and accumulation of error, and is simple to implement, involves short running times, is memory efficient and preserves geometric features and discontinuities automatically. Results and numerical comparisons show that our algorithm generates simplified models at different LODs of good visual fidelity, which are comparable with those by other methods.

AB - Ever growing complexity of polygonal models hinders the rendering and manipulation of such models on available graphics hardware resources. LOD (level of detail) management only can make such models suitable for various applications. We propose an automatic method for generating LODs of a given polygonal model that is based on edge collapse operation. In an edge collapse algorithm, the way how to measure the error introduced as a result of an edge collapse transformation plays a crucial role in determining the ordering of such transformations. We introduce a measure of geometric deviation, which is based on local evaluation and accumulation of error, and is simple to implement, involves short running times, is memory efficient and preserves geometric features and discontinuities automatically. Results and numerical comparisons show that our algorithm generates simplified models at different LODs of good visual fidelity, which are comparable with those by other methods.

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

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

U2 - 10.1109/GMAG.2003.1219678

DO - 10.1109/GMAG.2003.1219678

M3 - Conference contribution

AN - SCOPUS:84902264478

SP - 137

EP - 142

BT - Proceedings - 2003 International Conference on Geometric Modeling and Graphics, GMAG 2003

PB - Institute of Electrical and Electronics Engineers Inc.

ER -