Cell-projection of cyclic meshes

We present the first algorithm that employs hardware-accelerated cell-projection for direct volume rendering of cyclic meshes, i.e., meshes with visibility cycles. The visibility sorting of a cyclic mesh is performed by an extended topological sorting, which computes and isolates visibility cycles. Measured sorting times are comparable to previously published algorithms, which are, however, restricted to acyclic meshes. In practice, our algorithm is also useful for acyclic meshes as numerical instabilities can lead to false visibility cycles. Our method includes a simple, hardware-assisted algorithm based on image compositing that renders visibility cycles correctly. For tetrahedral meshes this algorithm allows us to render each tetrahedral cell (whether it is part of a cycle or not) by hardware-accelerated cell-projection. In its basic form our method applies only to convex cyclic meshes; however, we present an exact and a simpler but inexact extension of our method for nonconvex meshes.

[1]  Peter L. Williams Visibility-ordering meshed polyhedra , 1992, TOGS.

[2]  Joseph S. B. Mitchell,et al.  Fast Polyhedral Cell Sorting for Interactive Rendering of Unstructured Grids , 1998, Comput. Graph. Forum.

[3]  Peter Shirley,et al.  A polygonal approximation to direct scalar volume rendering , 1990, SIGGRAPH 1990.

[4]  Joseph S. B. Mitchell,et al.  An exact interactive time visibility ordering algorithm for polyhedral cell complexes , 1998, IEEE Symposium on Volume Visualization (Cat. No.989EX300).

[5]  P. Gács,et al.  Algorithms , 1992 .

[6]  V. T. Rajan,et al.  Visualization of Three-Dimensional Delaunay Meshes , 1997, Algorithmica.

[7]  Cláudio T. Silva,et al.  A Hardware-Assisted Visibility-Ordering Algorithm With Applications To Volume Rendering , 2001, VisSym.

[8]  Henry Fuchs,et al.  Predetermining visibility priority in 3-D scenes (Preliminary Report) , 1979, SIGGRAPH '79.

[9]  Ricardo Farias,et al.  ZSWEEP: An Efficient and Exact Projection Algorithm for Unstructured Volume Rendering , 2000, 2000 IEEE Symposium on Volume Visualization (VV 2000).

[10]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[11]  Paolo Cignoni,et al.  On the Optimization of Projective Volume Rendering , 1995, Visualization in Scientific Computing.

[12]  John M. Snyder,et al.  Visibility sorting and compositing without splitting for image layer decompositions , 1998, SIGGRAPH.

[13]  Martin Kraus,et al.  Hardware-accelerated volume and isosurface rendering based on cell-projection , 2000, Proceedings Visualization 2000. VIS 2000 (Cat. No.00CH37145).

[14]  Nelson L. Max,et al.  A High Accuracy Volume Renderer for Unstructured Data , 1998, IEEE Trans. Vis. Comput. Graph..

[15]  Herbert Edelsbrunner,et al.  An acyclicity theorem for cell complexes ind dimension , 1990, Comb..

[16]  Herbert Edelsbrunner,et al.  An acyclicity theorem for cell complexes in d dimensions , 1989, SCG '89.

[17]  Craig M. Wittenbrink CellFast: Interactive Unstructured Volume Rendering , 1999 .

[18]  Nelson L. Max,et al.  Sorting and hardware assisted rendering for volume visualization , 1994, VVS '94.

[19]  P. Hanrahan,et al.  Area and volume coherence for efficient visualization of 3D scalar functions , 1990, VVS.

[20]  Z. Kedem Predetermining Visibility Priority in 3-d Scenes Predetermining Visibility Priority in 3-d Scenes , 1979 .

[21]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[22]  R. Sedgewick,et al.  Algorithms (2nd ed.) , 1988 .