Edge Groups: An approach to understanding the mesh quality of marching methods

Carlos A. Dietrich, Carlos Eduardo Scheidegger, João L D Comba, Luciana P. Nedel, Cláudio T. Silva

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

Marching Cubes is the most popular isosurface extraction algorithm due to its simplicity, efficiency and robustness. It has been widely studied, improved, and extended. While much early work was concerned with efficiency and correctness issues, lately there has been a push to improve the quality of Marching Cubes meshes so that they can be used in computational codes. In this work we present a new classification of MC cases that we call Edge Groups, which helps elucidate the issues that impact the triangle quality of the meshes that the method generates. This formulation allows a more systematic way to bound the triangle quality, and is general enough to extend to other polyhedral cell shapes used in other polygonization algorithms. Using this analysis, we also discuss ways to improve the quality of the resulting triangle mesh, including some that require only minor modifications of the original algorithm.

Original languageEnglish (US)
Article number4658187
Pages (from-to)1651-1658
Number of pages8
JournalIEEE Transactions on Visualization and Computer Graphics
Volume14
Issue number6
DOIs
StatePublished - Nov 2008
Externally publishedYes

Keywords

  • Isosurface extraction
  • Marching cubes

ASJC Scopus subject areas

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

Cite this

Edge Groups : An approach to understanding the mesh quality of marching methods. / Dietrich, Carlos A.; Scheidegger, Carlos Eduardo; Comba, João L D; Nedel, Luciana P.; Silva, Cláudio T.

In: IEEE Transactions on Visualization and Computer Graphics, Vol. 14, No. 6, 4658187, 11.2008, p. 1651-1658.

Research output: Contribution to journalArticle

Dietrich, Carlos A. ; Scheidegger, Carlos Eduardo ; Comba, João L D ; Nedel, Luciana P. ; Silva, Cláudio T. / Edge Groups : An approach to understanding the mesh quality of marching methods. In: IEEE Transactions on Visualization and Computer Graphics. 2008 ; Vol. 14, No. 6. pp. 1651-1658.
@article{bd0be4ab80864801aec495284470366c,
title = "Edge Groups: An approach to understanding the mesh quality of marching methods",
abstract = "Marching Cubes is the most popular isosurface extraction algorithm due to its simplicity, efficiency and robustness. It has been widely studied, improved, and extended. While much early work was concerned with efficiency and correctness issues, lately there has been a push to improve the quality of Marching Cubes meshes so that they can be used in computational codes. In this work we present a new classification of MC cases that we call Edge Groups, which helps elucidate the issues that impact the triangle quality of the meshes that the method generates. This formulation allows a more systematic way to bound the triangle quality, and is general enough to extend to other polyhedral cell shapes used in other polygonization algorithms. Using this analysis, we also discuss ways to improve the quality of the resulting triangle mesh, including some that require only minor modifications of the original algorithm.",
keywords = "Isosurface extraction, Marching cubes",
author = "Dietrich, {Carlos A.} and Scheidegger, {Carlos Eduardo} and Comba, {Jo{\~a}o L D} and Nedel, {Luciana P.} and Silva, {Cl{\'a}udio T.}",
year = "2008",
month = "11",
doi = "10.1109/TVCG.2008.122",
language = "English (US)",
volume = "14",
pages = "1651--1658",
journal = "IEEE Transactions on Visualization and Computer Graphics",
issn = "1077-2626",
publisher = "IEEE Computer Society",
number = "6",

}

TY - JOUR

T1 - Edge Groups

T2 - An approach to understanding the mesh quality of marching methods

AU - Dietrich, Carlos A.

AU - Scheidegger, Carlos Eduardo

AU - Comba, João L D

AU - Nedel, Luciana P.

AU - Silva, Cláudio T.

PY - 2008/11

Y1 - 2008/11

N2 - Marching Cubes is the most popular isosurface extraction algorithm due to its simplicity, efficiency and robustness. It has been widely studied, improved, and extended. While much early work was concerned with efficiency and correctness issues, lately there has been a push to improve the quality of Marching Cubes meshes so that they can be used in computational codes. In this work we present a new classification of MC cases that we call Edge Groups, which helps elucidate the issues that impact the triangle quality of the meshes that the method generates. This formulation allows a more systematic way to bound the triangle quality, and is general enough to extend to other polyhedral cell shapes used in other polygonization algorithms. Using this analysis, we also discuss ways to improve the quality of the resulting triangle mesh, including some that require only minor modifications of the original algorithm.

AB - Marching Cubes is the most popular isosurface extraction algorithm due to its simplicity, efficiency and robustness. It has been widely studied, improved, and extended. While much early work was concerned with efficiency and correctness issues, lately there has been a push to improve the quality of Marching Cubes meshes so that they can be used in computational codes. In this work we present a new classification of MC cases that we call Edge Groups, which helps elucidate the issues that impact the triangle quality of the meshes that the method generates. This formulation allows a more systematic way to bound the triangle quality, and is general enough to extend to other polyhedral cell shapes used in other polygonization algorithms. Using this analysis, we also discuss ways to improve the quality of the resulting triangle mesh, including some that require only minor modifications of the original algorithm.

KW - Isosurface extraction

KW - Marching cubes

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

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

U2 - 10.1109/TVCG.2008.122

DO - 10.1109/TVCG.2008.122

M3 - Article

C2 - 18989022

AN - SCOPUS:54949119489

VL - 14

SP - 1651

EP - 1658

JO - IEEE Transactions on Visualization and Computer Graphics

JF - IEEE Transactions on Visualization and Computer Graphics

SN - 1077-2626

IS - 6

M1 - 4658187

ER -