Home » Proceedings » GI 2001 » Accelerated Splatting using a 3D Adjacency Data Structure

Accelerated Splatting using a 3D Adjacency Data Structure

Jeff Orchard, Torsten Moeller


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

Abstract

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.

Michael A. J. Sweeney Award

Alain Fournier Awards

Bill Buxton Awards

CHCCS Service Awards

CHCCS Achievement Awards

Canadian Digital Media Pioneer Awards

Connect with us

Prix Pionnier des médias numériques

Early Career Researcher Award

primary_navigation_menu