Share Email Print

Proceedings Paper

Data compression method for tetrahedral meshes
Author(s): Shyh-Kuang Ueng; Kris Sikorski
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In this paper, a looseless compression scheme is presented for Finite Element Analysis(FEA) data. In this algorithm, all FEA cells are assumed to be tetrahedra. Therefore a cell has at most four neighboring cells. Our algorithm starts with computing the indices of the four adjacent cells for each cell. The adjacency graph is formed by representing a cell by a vertex and by drawing an edge between two cells if they are adjacent. The adjacency graph is traversed by using a depth first search, and the mesh is split into tetrahedral strips. In a tetrahedral strip, every two consecutive cells share a face, and thus only one vertex index has to be specified for defining a tetrahedron. Therefore the memory space required for storing the mesh is reduced. The tetrahedral strips are encoded by using four types of instructions and converted into a sequence of bytes. Unlike most 3D geometrical compression algorithms, vertex indices are not changed in our scheme. Rearrangement of vertex indices is not required.

Paper Details

Date Published: 12 March 2002
PDF: 8 pages
Proc. SPIE 4665, Visualization and Data Analysis 2002, (12 March 2002); doi: 10.1117/12.458780
Show Author Affiliations
Shyh-Kuang Ueng, National Taiwan Ocean Univ. (Taiwan)
Kris Sikorski, Univ. of Utah (United States)

Published in SPIE Proceedings Vol. 4665:
Visualization and Data Analysis 2002
Robert F. Erbacher; Philip C. Chen; Matti Groehn; Jonathan C. Roberts; Craig M. Wittenbrink, Editor(s)

© SPIE. Terms of Use
Back to Top