Data perturbation for fewer triangles in marching tetrahedra

Authors:
Seungtaik Oh;Bon Ki Koo
Affiliations:
Electronics and Telecommunications Research Institute, Digital Contents Research Division, Gajeong, Yusong, Dajeon, Republic of Korea;Electronics and Telecommunications Research Institute, Digital Contents Research Division, Gajeong, Yusong, Dajeon, Republic of Korea
Venue:
Graphical Models
Year:
2007

Citing 6
Cited 0

Polyhedral approximation approach to molecular orbital graphics

Journal of Molecular Graphics
Marching cubes: A high resolution 3D surface construction algorithm

SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Simplicial pivoting for mesh generation of implicitly defined surfaces

Computer Aided Geometric Design
Decimation of triangle meshes

SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Surface simplification using quadric error metrics

Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Superfaces: Polygonal Mesh Simplification with Bounded Error

IEEE Computer Graphics and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A simple efficient method is proposed to reduce the total number of triangles in an isosurface extraction method based on tetrahedral decomposition. We slightly perturb the input volumetric data so that useless small and thin triangles are removed. The perturbed volumetric data contain the exact isovalues from which a mesh is extracted. Since the proposed method is a pre-process of an isosurface extraction, it is not necessary to modify the mesh structure unlike the other similar methods.