Efficient Space Leaping for Ray casting Architectures
| dc.contributor.author | Meißner, M. | en_US |
| dc.contributor.author | Doggett, M. | en_US |
| dc.contributor.author | Hirche, J. | en_US |
| dc.contributor.author | Kanus, U. | en_US |
| dc.contributor.editor | K. Mueller and A. Kaufman | en_US |
| dc.date.accessioned | 2014-01-29T17:20:51Z | |
| dc.date.available | 2014-01-29T17:20:51Z | |
| dc.date.issued | 2001 | en_US |
| dc.description.abstract | One of the most severe problems for ray casting architectures is the waste of computation cycles and I/O bandwidth, due to redundant sampling of empty space. While several techniques exist for software implementations to skip these empty regions, few are suitable for hardware implementation. The few which have been presented either require a tremendous amount of logic or are not feasible for high frequency designs (i.e. running at 100 MHz) where latency is the one of the biggest issues. In this paper, we present an efficient space leaping mechanism which requires only a small amount of SRAM (4 Kbit for a 256<sup>3</sup> volume) and can be easily integrated into ray casting architectures. For each sub-cube of the volume, a bit is stored in an occupancy map, which can be generated in real-time, using the VIZARD II architecture. Hence, space leaping can be classification dependent achieving yet another significant speed-up over skipping only the empty space (voxel | en_US |
| dc.description.seriesinformation | Volume Graphics | en_US |
| dc.identifier.isbn | 3-211-83737-X | en_US |
| dc.identifier.issn | 1727-8376 | en_US |
| dc.identifier.uri | https://doi.org/10.2312/VG/VG01/149-161 | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.title | Efficient Space Leaping for Ray casting Architectures | en_US |