LOD modelling of polygonal models

Muhammad Hussain, Yoshihiro Okada, Koichi Niijima

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

An automatic edge-collapse based simplification method has been proposed for decimation of polygonal models and generating their LODs (Levels of detail). The measure of geometric fidelity employed is motivated by the normal space deviation of a polygonal model arising during its decimation process and forces the algorithm to minimize the normal space deviation. In spite of the global nature of the evaluation of geometric deviation, the algorithm is memory efficient and involves less execution time then the state-of-the art simplification algorithms. This automatically prevents the creation of folds and automatically preserves visually important features of the model even at low levels of detail. LODs generated by our method compare favorably with those produced by the standard QEM-based algorithm QSlim [8] in terms of the mean and maximum geometric errors, whereas its performance in preserving normal space of the original model is better than that of QSlim.

Original languageEnglish
Pages (from-to)325-343
Number of pages19
JournalMachine Graphics and Vision
Volume14
Issue number3
Publication statusPublished - Dec 1 2005

Fingerprint

Data storage equipment

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Vision and Pattern Recognition
  • Computer Graphics and Computer-Aided Design

Cite this

Hussain, M., Okada, Y., & Niijima, K. (2005). LOD modelling of polygonal models. Machine Graphics and Vision, 14(3), 325-343.

LOD modelling of polygonal models. / Hussain, Muhammad; Okada, Yoshihiro; Niijima, Koichi.

In: Machine Graphics and Vision, Vol. 14, No. 3, 01.12.2005, p. 325-343.

Research output: Contribution to journalArticle

Hussain, M, Okada, Y & Niijima, K 2005, 'LOD modelling of polygonal models', Machine Graphics and Vision, vol. 14, no. 3, pp. 325-343.
Hussain M, Okada Y, Niijima K. LOD modelling of polygonal models. Machine Graphics and Vision. 2005 Dec 1;14(3):325-343.
Hussain, Muhammad ; Okada, Yoshihiro ; Niijima, Koichi. / LOD modelling of polygonal models. In: Machine Graphics and Vision. 2005 ; Vol. 14, No. 3. pp. 325-343.
@article{11c282e0981b495ebbca70fd93cbc508,
title = "LOD modelling of polygonal models",
abstract = "An automatic edge-collapse based simplification method has been proposed for decimation of polygonal models and generating their LODs (Levels of detail). The measure of geometric fidelity employed is motivated by the normal space deviation of a polygonal model arising during its decimation process and forces the algorithm to minimize the normal space deviation. In spite of the global nature of the evaluation of geometric deviation, the algorithm is memory efficient and involves less execution time then the state-of-the art simplification algorithms. This automatically prevents the creation of folds and automatically preserves visually important features of the model even at low levels of detail. LODs generated by our method compare favorably with those produced by the standard QEM-based algorithm QSlim [8] in terms of the mean and maximum geometric errors, whereas its performance in preserving normal space of the original model is better than that of QSlim.",
author = "Muhammad Hussain and Yoshihiro Okada and Koichi Niijima",
year = "2005",
month = "12",
day = "1",
language = "English",
volume = "14",
pages = "325--343",
journal = "Machine Graphics and Vision",
issn = "1230-0535",
publisher = "Polska Akademia Nauk",
number = "3",

}

TY - JOUR

T1 - LOD modelling of polygonal models

AU - Hussain, Muhammad

AU - Okada, Yoshihiro

AU - Niijima, Koichi

PY - 2005/12/1

Y1 - 2005/12/1

N2 - An automatic edge-collapse based simplification method has been proposed for decimation of polygonal models and generating their LODs (Levels of detail). The measure of geometric fidelity employed is motivated by the normal space deviation of a polygonal model arising during its decimation process and forces the algorithm to minimize the normal space deviation. In spite of the global nature of the evaluation of geometric deviation, the algorithm is memory efficient and involves less execution time then the state-of-the art simplification algorithms. This automatically prevents the creation of folds and automatically preserves visually important features of the model even at low levels of detail. LODs generated by our method compare favorably with those produced by the standard QEM-based algorithm QSlim [8] in terms of the mean and maximum geometric errors, whereas its performance in preserving normal space of the original model is better than that of QSlim.

AB - An automatic edge-collapse based simplification method has been proposed for decimation of polygonal models and generating their LODs (Levels of detail). The measure of geometric fidelity employed is motivated by the normal space deviation of a polygonal model arising during its decimation process and forces the algorithm to minimize the normal space deviation. In spite of the global nature of the evaluation of geometric deviation, the algorithm is memory efficient and involves less execution time then the state-of-the art simplification algorithms. This automatically prevents the creation of folds and automatically preserves visually important features of the model even at low levels of detail. LODs generated by our method compare favorably with those produced by the standard QEM-based algorithm QSlim [8] in terms of the mean and maximum geometric errors, whereas its performance in preserving normal space of the original model is better than that of QSlim.

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

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

M3 - Article

AN - SCOPUS:33645299816

VL - 14

SP - 325

EP - 343

JO - Machine Graphics and Vision

JF - Machine Graphics and Vision

SN - 1230-0535

IS - 3

ER -