Proceedings: GI 2001

Accelerated Splatting using a 3D Adjacency Data Structure

Jeff Orchard, Torsten Moeller

Proceedings of Graphics Interface 2001: Ottawa, Ontario, Canada, 7 - 9 June 2001, 191-200

DOI 10.20380/GI2001.23

  • BibTeX

     title = {Accelerated Splatting using a 3D Adjacency Data Structure},
     author = {Jeff Orchard and Torsten Moeller},
     booktitle = {Proceedings of the Graphics Interface 2001 Conference, June 7-9 2001, Ottawa, Ontario, Canada},
     url = {},
     year = {2001},
     month = {June},
     pages = {191--200}


We introduce a new acceleration to the standard splatting volume rendering algorithm. Our method achieves full colour (32-bit), depth-sorted and shaded volume rendering significantly faster than standard splatting. The speedup is due to a 3-dimensional adjacency data structure that efficiently skips transparent parts of the data and stores only the voxels that are potentially visible. Our algorithm is robust and flexible, allowing for depth sorting of the data, including correct back-to-front ordering for perspective projections. This makes interactive splatting possible for applications such as medical visualizations that rely on structure and depth information.