TY - GEN

T1 - ZSWEEP

T2 - IEEE Symposium on Volume Visualization, VV 2000

AU - Mitchell, Joseph S B

AU - Silva, Cláudio T.

AU - Farias, Ricardo

PY - 2000

Y1 - 2000

N2 - We present a simple new algorithm that performs fast and memory-efficient cell projection for (exact) rendering of unstructured datasets. The main idea of the "ZSweep" algorithm is very simple; it is based on sweeping the data with a plane parallel to the viewing plane, in order of increasing z, projecting the faces of cells that are incident to vertices as they are encountered by the sweep plane. The efficiency arises from the fact that the algorithm exploits the implicit (approximate) global ordering that the z-ordering of the vertices induces on the cells that are incident on them. The algorithm projects cells by projecting each of their faces, with special care taken to avoid double projection of internal faces and to assure correctness in the projection order. The contribution for each pixel is computed in stages, during the sweep, using a short list of ordered face intersections, which is known to be correct and complete at the instant that each stage of the computation is completed. The ZSweep algorithm is simple enough to be readily adaptable to general (non-tetrahedral) cell formats. It is memory efficient, since its auxiliary data structures have only to store partial information taken from a small number of "slices" of the dataset. We also introduce a simple technique of data sparsification, which may be of interest in its own right. Our implementation is hardware-independent and handles datasets containing tetrahedral and/or hexahedral cells. We give experimental evidence that our method is competitive, up to 5 times faster than the best previously-known exact algorithms that use comparable amounts of memory, while using much less memory than ray-casting.

AB - We present a simple new algorithm that performs fast and memory-efficient cell projection for (exact) rendering of unstructured datasets. The main idea of the "ZSweep" algorithm is very simple; it is based on sweeping the data with a plane parallel to the viewing plane, in order of increasing z, projecting the faces of cells that are incident to vertices as they are encountered by the sweep plane. The efficiency arises from the fact that the algorithm exploits the implicit (approximate) global ordering that the z-ordering of the vertices induces on the cells that are incident on them. The algorithm projects cells by projecting each of their faces, with special care taken to avoid double projection of internal faces and to assure correctness in the projection order. The contribution for each pixel is computed in stages, during the sweep, using a short list of ordered face intersections, which is known to be correct and complete at the instant that each stage of the computation is completed. The ZSweep algorithm is simple enough to be readily adaptable to general (non-tetrahedral) cell formats. It is memory efficient, since its auxiliary data structures have only to store partial information taken from a small number of "slices" of the dataset. We also introduce a simple technique of data sparsification, which may be of interest in its own right. Our implementation is hardware-independent and handles datasets containing tetrahedral and/or hexahedral cells. We give experimental evidence that our method is competitive, up to 5 times faster than the best previously-known exact algorithms that use comparable amounts of memory, while using much less memory than ray-casting.

KW - large datasets

KW - texturing

KW - trilinear interpolation

UR - http://www.scopus.com/inward/record.url?scp=84954133126&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84954133126&partnerID=8YFLogxK

U2 - 10.1109/VV.2000.10001

DO - 10.1109/VV.2000.10001

M3 - Conference contribution

AN - SCOPUS:84954133126

T3 - 2000 IEEE Symposium on Volume Visualization, VV 2000

SP - 91

EP - 100

BT - 2000 IEEE Symposium on Volume Visualization, VV 2000

PB - Institute of Electrical and Electronics Engineers Inc.

Y2 - 9 October 2000 through 10 October 2000

ER -