Efficient Space Leaping for Raycasting Architectures

One of the most severe problems for ray casting architectures is the waste of computation cycles and I/O bandwidth, due to redundant sampling of empty space. While several techniques exist for software implementations to skip these empty regions, few are suitable for hardware implementation. The few which have been presented either require a tremendous amount of logic or are not feasible for high frequency designs (i.e. running at 100 MHz) where latency is the one of the biggest issues. In this paper, we present an efficient space leaping mechanism which requires only a small amount of SRAM (4 Kbit for a 2563 volume) and can be easily integrated into ray casting architectures. For each sub-cube of the volume, a bit is stored in an occupancy map, which can be generated in real-time, using the VIZARD II architecture. Hence, space leaping can be classification dependent achieving yet another significant speed-up over skipping only the empty space (voxel = 0). Using a set of real-world datasets, we show that frame-rates well above 15 frames per second can be accomplished for the VIZARD II architecture.

[1]  Roni Yagel,et al.  Accelerating volume animation by space-leaping , 1993, Proceedings Visualization '93.

[2]  Günter Knittel,et al.  A pel-based Volume Rendering Accelerator , 1995, Workshop on Graphics Hardware.

[3]  M. Meißner,et al.  Vizard II, a PCI-card for real-time volume rendering , 1998, SIGGRAPH 1998.

[4]  Wolfgang Straßer,et al.  VIZARD—visualization accelerator for realtime display , 1997, HWWS '97.

[5]  Michael C. Doggett,et al.  A low-cost memory architecture for PCI-based interactive ray casting , 1999, Workshop on Graphics Hardware.

[6]  Deborah Silver,et al.  The RACE II engine for real-time volume rendering , 2000, Workshop on Graphics Hardware.

[7]  Max A. Viergever,et al.  Acceleration of ray-casting using 3-D distance transforms , 1992, Other Conferences.

[8]  Sarah F. Frisken.  Using Distance Maps for Accurate Surface Representation in Sampled Volumes , 1998, VVS.

[9]  Deborah Silver,et al.  A MEMORY EFFICIENT ARCHITECTURE FOR REAL-TIME PARALLEL AND PERSPECTIVE DIRECT VOLUME RENDERING , 1999 .

[10]  Milos Srámek,et al.  Fast surface rendering from raster data by voxel traversal using chessboard distance , 1994, Proceedings Visualization '94.

[11]  Hanspeter Pfister,et al.  The VolumePro real-time ray-casting system , 1999, SIGGRAPH.

[12]  Reinhard Klein,et al.  Reconstruction and simplification of surfaces from contours , 1999, Proceedings. Seventh Pacific Conference on Computer Graphics and Applications (Cat. No.PR00293).

[13]  R.T. Whitaker,et al.  3D scan conversion of CSG models into distance volumes , 1998, IEEE Symposium on Volume Visualization (Cat. No.989EX300).

[14]  Michael C. Doggett,et al.  A ray queueing and sorting design for real time ray casting , 2000, 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353).

[15]  M. Levoy,et al.  Fast volume rendering using a shear-warp factorization of the viewing transformation , 1994, SIGGRAPH.

[16]  Jürgen Hesser,et al.  Solving the Hazard Problem for Algorithmically Optimized Real-Time Volume Rendering , 2000 .

[17]  B. Gudmundsson,et al.  Incremental generation of projections of CT-volumes , 1990, [1990] Proceedings of the First Conference on Visualization in Biomedical Computing.