A case study of isosurface generation in 3D visualization

Author

Li, Jianping ; Agathoklis, Pan

Author_Institution

Dept. of Electr. & Comput. Eng., Victoria Univ., BC, Canada

Volume

2

fYear

1993

fDate

19-21 May 1993

Firstpage

622

Abstract

The authors explore the problem of the redundancy of the marching-cube algorithm which is widely used as an isosurface generation technique of 3-D visualization. The redundancy occurs when the pixel value from input volumetric data is equal to the isovalue chosen. A modified version of the marching-cube algorithm is also proposed. The results show that the modified algorith thus can increase the efficiency of the original algorithm in terms of memory space and execution time by removing the redundancy, e.g., a 32 × 32 × 32 sphere can produce 41.7% fewer triangles to represent the isosurface and 26.6% execution time can be saved

Keywords

computational complexity; data visualisation; redundancy; three-dimensional displays; 3-D visualization; efficiency; execution time; isosurface generation; marching-cube algorithm; memory space; redundancy; Assembly; Computed tomography; Computer aided software engineering; Data visualization; Grid computing; Image reconstruction; Interpolation; Isosurfaces; Logic; Topology;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, Computers and Signal Processing, 1993., IEEE Pacific Rim Conference on

Conference_Location

Victoria, BC

Print_ISBN

0-7803-0971-5

Type

conf

DOI

10.1109/PACRIM.1993.407284

Filename

407284