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...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 tetrahedroll 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.展开更多
文摘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 tetrahedroll 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.
