Fast, Simple, Feature Preserving and Memory Efficient Simplification of Triangle Meshes

Muhammad Hussain, Yoshihiro Okada, Koichi Niijima

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

We propose a new iterative algorithm for the automatic geometric simplification of a triangle mesh based on edge collapse transformations. The way how geometric deviation resulted from an edge collapse transformation is measured plays a basic role in inducing a priority ordering on the set of edge collapse transformations to control the simplification process. We introduce a new technique to measure this deviation based only on current simplified mesh and the new concept of accumulating the cost of collapse, which are easy to implement and involve simple computations making the algorithm computationally efficient. No geometric history is needed to be retained, so the resulting algorithm is also memory efficient. Results and numerical comparisons show that our algorithm generates simplified meshes of good visual fidelity, which compares well with those by other methods in terms of maximum and mean geometric error and it preserves the visually important features of the original mesh.

Original languageEnglish
Pages (from-to)653-670
Number of pages18
JournalInternational Journal of Image and Graphics
Volume3
Issue number4
DOIs
Publication statusPublished - Oct 1 2003

Fingerprint

Data storage equipment
Costs

All Science Journal Classification (ASJC) codes

  • Computer Vision and Pattern Recognition
  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design

Cite this

Fast, Simple, Feature Preserving and Memory Efficient Simplification of Triangle Meshes. / Hussain, Muhammad; Okada, Yoshihiro; Niijima, Koichi.

In: International Journal of Image and Graphics, Vol. 3, No. 4, 01.10.2003, p. 653-670.

Research output: Contribution to journalArticle

@article{85abc92f7dac4dcfaca2500d9beb5421,
title = "Fast, Simple, Feature Preserving and Memory Efficient Simplification of Triangle Meshes",
abstract = "We propose a new iterative algorithm for the automatic geometric simplification of a triangle mesh based on edge collapse transformations. The way how geometric deviation resulted from an edge collapse transformation is measured plays a basic role in inducing a priority ordering on the set of edge collapse transformations to control the simplification process. We introduce a new technique to measure this deviation based only on current simplified mesh and the new concept of accumulating the cost of collapse, which are easy to implement and involve simple computations making the algorithm computationally efficient. No geometric history is needed to be retained, so the resulting algorithm is also memory efficient. Results and numerical comparisons show that our algorithm generates simplified meshes of good visual fidelity, which compares well with those by other methods in terms of maximum and mean geometric error and it preserves the visually important features of the original mesh.",
author = "Muhammad Hussain and Yoshihiro Okada and Koichi Niijima",
year = "2003",
month = "10",
day = "1",
doi = "10.1142/S021946780300124X",
language = "English",
volume = "3",
pages = "653--670",
journal = "International Journal of Image and Graphics",
issn = "0219-4678",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "4",

}

TY - JOUR

T1 - Fast, Simple, Feature Preserving and Memory Efficient Simplification of Triangle Meshes

AU - Hussain, Muhammad

AU - Okada, Yoshihiro

AU - Niijima, Koichi

PY - 2003/10/1

Y1 - 2003/10/1

N2 - We propose a new iterative algorithm for the automatic geometric simplification of a triangle mesh based on edge collapse transformations. The way how geometric deviation resulted from an edge collapse transformation is measured plays a basic role in inducing a priority ordering on the set of edge collapse transformations to control the simplification process. We introduce a new technique to measure this deviation based only on current simplified mesh and the new concept of accumulating the cost of collapse, which are easy to implement and involve simple computations making the algorithm computationally efficient. No geometric history is needed to be retained, so the resulting algorithm is also memory efficient. Results and numerical comparisons show that our algorithm generates simplified meshes of good visual fidelity, which compares well with those by other methods in terms of maximum and mean geometric error and it preserves the visually important features of the original mesh.

AB - We propose a new iterative algorithm for the automatic geometric simplification of a triangle mesh based on edge collapse transformations. The way how geometric deviation resulted from an edge collapse transformation is measured plays a basic role in inducing a priority ordering on the set of edge collapse transformations to control the simplification process. We introduce a new technique to measure this deviation based only on current simplified mesh and the new concept of accumulating the cost of collapse, which are easy to implement and involve simple computations making the algorithm computationally efficient. No geometric history is needed to be retained, so the resulting algorithm is also memory efficient. Results and numerical comparisons show that our algorithm generates simplified meshes of good visual fidelity, which compares well with those by other methods in terms of maximum and mean geometric error and it preserves the visually important features of the original mesh.

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

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

U2 - 10.1142/S021946780300124X

DO - 10.1142/S021946780300124X

M3 - Article

AN - SCOPUS:3042784714

VL - 3

SP - 653

EP - 670

JO - International Journal of Image and Graphics

JF - International Journal of Image and Graphics

SN - 0219-4678

IS - 4

ER -