An efficient space partitioning method using binary maps

Authors:
Vaclav Skala
Affiliations:
Department of Computer Science and Engineering, University of West Bohemia, Faculty of Applied Sciences, Plzen, Czech Republic
Venue:
SITE'12 Proceedings of the 11th international conference on Telecommunications and Informatics, Proceedings of the 11th international conference on Signal Processing
Year:
2012

Citing 6
Cited 0

Heuristics for ray tracing using space subdivision

The Visual Computer: International Journal of Computer Graphics
Graphics gems II

Graphics gems II
Programming principles in computer graphics (2nd ed.)

Programming principles in computer graphics (2nd ed.)
Use of residency masks and object space partitioning to eliminate ray-object intersection calculations

Graphics Gems III
Graphics Gems III

Graphics Gems III
Graphics Gems

Graphics Gems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Space partitioning techniques are well known especially because of their use in computer graphics, especially within ray-tracing acceleration techniques. The primary aim of those techniques is to enable fast test whether a geometric object resides at least partially within the given area. There are many modifications that proved the applicability despite of high memory requirements of complexity O(M2) for the two dimensional space, resp. O(M3) for the three dimensional space. The space division technique is used in standard software packages like PovRay etc. A new technique with O(M) memory complexity and its comparison with original space subdivision and residency mask techniques is presented.