The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—We present a brute-force ray tracing system for interactive volume visualization. The system runs on a conventional (distributed) shared-memory multiprocessor machine. For each pixel we trace a ray through a volume to compute the color for that pixel. Although this method has high intrinsic computational cost, its simplicity and scalability make it ideal for large datasets on current high-end parallel systems. To gain efficiency several optimizations are used including a volume bricking scheme and a shallow data hierarchy. These optimizations are used in three separate visualization algorithms: isosurfacing of rectilinear data, isosurfacing of unstructured data, and maximum-intensity projection on rectilinear data. The system runs interactively (i.e., several frames per second) on an SGI Reality Monster. The graphics capabilities of the Reality Monster are used only for display of the final color image.</p>
Ray tracing, visualization, isosurface, maximum-intensity projection.

P. Shirley, P. Sloan, S. Parker, C. Hansen, M. Parker and Y. Livnat, "Interactive Ray Tracing for Volume Visualization," in IEEE Transactions on Visualization & Computer Graphics, vol. 5, no. , pp. 238-250, 1999.
88 ms
(Ver 3.3 (11022016))