Optimized View Frustum Culling Algorithms for Bounding Boxes

1 January 2000

journal article
research article
Published by Taylor & Francis in Journal of Graphics Tools

Vol. 5 (1) , 9-22
https://doi.org/10.1080/10867651.2000.10487517

Abstract

This paper presents optimizations for faster view frustum culling (VFC) for axis-aligned bounding box (AABB) and oriented bounding box (OBB) hierarchies. We exploit frame-to-frame coherency by caching and by comparing against previous distances and rotation angles. By using an octant test, we potentially halve the number of plane tests needed, and we also evaluate masking, which is a well-known technique. The optimizations can be used for arbitrary bounding volumes, but we present only results for AABBs and OBBs. In particular, we provide solutions which are 2-11 times faster than other VFC algorithms for AABBs and OBBs, depending on the circumstances.

Keywords

This publication has 6 references indexed in Scilit:

View volume culling using a probabilistic caching scheme
Published by Association for Computing Machinery (ACM) ,1997
Fast Polygon-Cube Intersection Testing
Published by Elsevier ,1995
A Walk through BSP Trees
Published by Elsevier ,1995
Shaft Culling for Efficient Ray-Cast Radiosity
Published by Springer Nature ,1994
Direct Outcode Calculation for Faster Clip Testing
Published by Elsevier ,1994
Hierarchical geometric models for visible surface algorithms
Communications of the ACM, 1976