Feature-preserving and memory-efficient simplification of polygonal meshes

M. Hussain, Y. Okada, K. Niijima

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

1 引用 (Scopus)

抄録

We propose a new automatic edge collapse simplification algorithm, which is not only fast and memory efficient but also automatically preserves visually important features of a mesh. In an edge collapse algorithm, a sequence of edge collapse transformations determined by an optimal greedy approach is applied until an approximating mesh of required size or of given tolerance is obtained. The way of measuring the geometric error introduced as a result of an edge collapse transformation plays a crucial role in determining the priority ordering of such transformations. We introduce a new idea to measure this error based only on current simplified mesh and error accumulation. The proposed technique for measuring geometric error is not only simple to implement but also memory efficient. The presented algorithm consumes less memory and takes less execution time than most of the published edge collapse based algorithms. Results and numerical comparisons show that our algorithm generates simplified meshes of good visual fidelity, which are comparable with those by other methods.

元の言語英語
ページ(範囲)253-258
ページ数6
ジャーナルInternational Journal of Modelling and Simulation
25
発行部数4
DOI
出版物ステータス出版済み - 1 1 2005

Fingerprint

Simplification
Mesh
Data storage equipment
Numerical Comparisons
Fidelity
Execution Time
Tolerance

All Science Journal Classification (ASJC) codes

  • Modelling and Simulation
  • Mechanics of Materials
  • Hardware and Architecture
  • Industrial and Manufacturing Engineering
  • Electrical and Electronic Engineering

これを引用

Feature-preserving and memory-efficient simplification of polygonal meshes. / Hussain, M.; Okada, Y.; Niijima, K.

:: International Journal of Modelling and Simulation, 巻 25, 番号 4, 01.01.2005, p. 253-258.

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

@article{136608aad88544cca526e4bdde97dc75,
title = "Feature-preserving and memory-efficient simplification of polygonal meshes",
abstract = "We propose a new automatic edge collapse simplification algorithm, which is not only fast and memory efficient but also automatically preserves visually important features of a mesh. In an edge collapse algorithm, a sequence of edge collapse transformations determined by an optimal greedy approach is applied until an approximating mesh of required size or of given tolerance is obtained. The way of measuring the geometric error introduced as a result of an edge collapse transformation plays a crucial role in determining the priority ordering of such transformations. We introduce a new idea to measure this error based only on current simplified mesh and error accumulation. The proposed technique for measuring geometric error is not only simple to implement but also memory efficient. The presented algorithm consumes less memory and takes less execution time than most of the published edge collapse based algorithms. Results and numerical comparisons show that our algorithm generates simplified meshes of good visual fidelity, which are comparable with those by other methods.",
author = "M. Hussain and Y. Okada and K. Niijima",
year = "2005",
month = "1",
day = "1",
doi = "10.1080/02286203.2005.11442339",
language = "English",
volume = "25",
pages = "253--258",
journal = "International Journal of Modelling and Simulation",
issn = "0228-6203",
publisher = "ACTA Press",
number = "4",

}

TY - JOUR

T1 - Feature-preserving and memory-efficient simplification of polygonal meshes

AU - Hussain, M.

AU - Okada, Y.

AU - Niijima, K.

PY - 2005/1/1

Y1 - 2005/1/1

N2 - We propose a new automatic edge collapse simplification algorithm, which is not only fast and memory efficient but also automatically preserves visually important features of a mesh. In an edge collapse algorithm, a sequence of edge collapse transformations determined by an optimal greedy approach is applied until an approximating mesh of required size or of given tolerance is obtained. The way of measuring the geometric error introduced as a result of an edge collapse transformation plays a crucial role in determining the priority ordering of such transformations. We introduce a new idea to measure this error based only on current simplified mesh and error accumulation. The proposed technique for measuring geometric error is not only simple to implement but also memory efficient. The presented algorithm consumes less memory and takes less execution time than most of the published edge collapse based algorithms. Results and numerical comparisons show that our algorithm generates simplified meshes of good visual fidelity, which are comparable with those by other methods.

AB - We propose a new automatic edge collapse simplification algorithm, which is not only fast and memory efficient but also automatically preserves visually important features of a mesh. In an edge collapse algorithm, a sequence of edge collapse transformations determined by an optimal greedy approach is applied until an approximating mesh of required size or of given tolerance is obtained. The way of measuring the geometric error introduced as a result of an edge collapse transformation plays a crucial role in determining the priority ordering of such transformations. We introduce a new idea to measure this error based only on current simplified mesh and error accumulation. The proposed technique for measuring geometric error is not only simple to implement but also memory efficient. The presented algorithm consumes less memory and takes less execution time than most of the published edge collapse based algorithms. Results and numerical comparisons show that our algorithm generates simplified meshes of good visual fidelity, which are comparable with those by other methods.

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

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

U2 - 10.1080/02286203.2005.11442339

DO - 10.1080/02286203.2005.11442339

M3 - Article

AN - SCOPUS:26844529700

VL - 25

SP - 253

EP - 258

JO - International Journal of Modelling and Simulation

JF - International Journal of Modelling and Simulation

SN - 0228-6203

IS - 4

ER -