Share Email Print
cover

Proceedings Paper

Irregular grid volume rendering with composition networks
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Volumetric irregular grids are the next frontier to conquer in interactive 3D graphics. Visualization algorithms for rectilinear 2563 data volumes have been optimized to achieve one frame/second to 15 frames/second depending on the workstation. With equivalent computational resources, irregular grids with millions of cells may take minutes to render for a new viewpoint. The state of the art for graphics rendering, PixelFlow, provides screen and object space parallelism for polygonal rendering. Unfortunately volume rendering of irregular data is at odds with the sort last architecture. I investigate parallel algorithms for direct volume rendering on PixelFlow that generalize to other compositing architectures. Experiments are performed on the Nasa Langley fighter dataset, using the projected tetrahedra approach of Shirley and Tuchman. Tetrahedral sorting is done by the circumscribing sphere approach of Cignoni et al. Key approaches include sort-first on sort-last, world space subdivision by clipping, rearrangeable linear compositing for any view angle, and static load balancing. The new world space subdivision by clipping provides for efficient and correct rendering of unstructured data by using object space clipping planes. Research results include performance estimates on PixelFlow for irregular grid volume rendering. PixelFlow is estimated to achieve 30 frames/second on irregular grids of 300,00 tetrahedra or 10 million tetrahedra per second.

Paper Details

Date Published: 14 May 1998
PDF: 11 pages
Proc. SPIE 3298, Visual Data Exploration and Analysis V, (14 May 1998); doi: 10.1117/12.309549
Show Author Affiliations
Craig M. Wittenbrink, Hewlett-Packard Co. (United States)


Published in SPIE Proceedings Vol. 3298:
Visual Data Exploration and Analysis V
Robert F. Erbacher; Alex Pang, Editor(s)

© SPIE. Terms of Use
Back to Top