Fast Polyhedral Cell Sorting for Interactive Rendering of Unstructured Grids

• Published in: Computer graphics forum Vol. 18; no. 3; pp. 369 - 376
• Main Authors: Comba, João, Klosowsk, James T., Max, Nelson, Mitchell, Joseph S. B., Silva, Cláudio T., Williams, Peter L.
• Format: Journal Article
• Language: English
• Published: Oxford, UK and Boston, USA Blackwell Publishers Ltd 01.09.1999
• Subjects: depth ordering; finite element methods; scientific visualization; visibility ordering; Volume rendering; volume visualization
• ISSN: 0167-7055; 1467-8659
• DOI: 10.1111/1467-8659.00357

Direct volume rendering based on projective methods works by projecting, in visibility order, the polyhedral cells of a mesh onto the image plane, and incrementally compositing the cell’s color and opacity into the final image. Crucial to this method is the computation of a visibility ordering of the cells. If the mesh is “well‐behaved” (acyclic and convex), then the MPVO method of Williams provides a very fast sorting algorithm; however, this method only computes an approximate ordering in general datasets, resulting in visual artifacts when rendered. A recent method of Silva et al. removed the assumption that the mesh is convex, by means of a sweep algorithm used in conjunction with the MPVO method; their algorithm is substantially faster than previous exact methods for general meshes. In this paper we propose a new technique, which we call BSP‐XMPVO, which is based on a fast and simple way of using binary space partitions on the boundary elements of the mesh to augment the ordering produced by MPVO. Our results are shown to be orders of magnitude better than previous exact methods of sorting cells.