Title
Constructing isosurfaces from 3D data sets taking account of depth sorting of polyhedra
Abstract
Creating and rendering intermediate geometric primitives is one of the approaches to visualize data sets in 3D space. Some algorithms have been developed to construct isosurface from uniformly distributed 3D data sets. These algorithms assume that the function value varies linearly along edges of each cell. But to irregular 3D data sets, this assumption is inapplicable. Moreover, the depth sorting of cells is more complicated for irregular data sets, which is indispensable for generating isosurface images or semitransparent isosurface images, if Z-buffer method is not adopted. In this paper, isosurface models based on the assumption, that the function value has nonlinear distribution within a tetrahedron are proposed. The depth sorting algorithm and data structures are developed for the irregular data sets in which cells may be subdivided into tetrahedra. The implementation issues of this algorithm are discussed and experimental results are shown to illustrate potentials of this technique.
Year
DOI
Venue
1994
10.1007/BF02939493
J. Comput. Sci. Technol.
Keywords
Field
DocType
depth sorting,polyhedra.,3d data sets,isosurface,data structure,sorting algorithm
Data set,Computer science,Polyhedron,Geometric primitive,Algorithm,Isosurface,Theoretical computer science,Sorting,Rendering (computer graphics),Distributed computing
Journal
Volume
Issue
ISSN
9
2
18604749
Citations 
PageRank 
References 
1
0.37
9
Authors
4
Name
Order
Citations
PageRank
Yong Zhou120.86
Zesheng Tang214928.27
周勇310.37
唐泽圣421.46