Parallel Peeling of Curvilinear Grids

Abstract

In this paper we present a novel hybrid CPU-GPU approach for rendering curvilinear grids. Visibility sorting is accomplished by parallel peeling cells off the grid, utilizing an active cell peeling front. In each step, we compute the ray-cell intersection coordinates on the GPU, perform accurate volume integration (CPU), and determine the set of active cells for the next iteration (GPU). The approach requires only standard graphics capabilities and can therefore be used on any commodity PC, including laptops. Furthermore, the main memory requirements are negligible since the required data structures are minimal. The main advantage of our algorithm is that we exploit hardware acceleration for the expensive visibility sorting which is beneficial over time due to the faster performance increase of GPUs over CPUs. Due to the simplicity of the algorithm and its low requirements on preprocessing and main memory, it is well suited for thin clients. Last but not least, the approach could easily be extended to irregular grids using tetrahedra.

Keywords: Curvilinear grids, Raycasting, Volume Rendering, Visibility Sorting, Depth Sorting

Download full paper

Parallel Peeling of Curvilinear Grids
Sören Grimm, Michael Meissner, Armin Kanitsar, Eduard Gröller
Technical Report 2004

Image Gallery

Movie Gallery

BibTeX Entry

@TechReport{Grimm:2004:PPC,
  author =      "S\"oren Grimm and Michael Meissner 
   and Armin Kanitsar and Eduard Gr\"oller ",
  title =       "Parallel Peeling of Curvilinear Grids",
  year =        "04",
  month =       "Apr",
  pages =       "1-8",
  keywords =    "Curvilinear grids, Raycasting, Volume Rendering, Visibility Sorting, Depth Sorting",
  number =      "TR-186-2-04-07",
  institution = "Institute of Computer Graphics and Algorithms, Vienna University of Technology",
  address =     "Karlsplatz 13/186/2, A-1040 Vienna, Austria",
  ftp =         "",
  note =        "human contact: technical-report@cg.tuwien.ac.at",
}