Optimized View Frustum Culling Algorithms
نویسندگان
چکیده
This paper presents new techniques for fast view frustum culling. View frustum cullers (VFCs) are typically used in virtual reality software, walkthrough algorithms, scene graph APIs or other 3D graphics applications. First we develop a fast basic VFC algorithm. Then we suggest and evaluate four further optimizations, which are independent of each other and works for all kinds of VFC algorithms that test the bounding volumes (BVs) against the planes of the view frustum. Results when optimizing specifically for axis aligned bounding boxes (AABBs), oriented bounding boxes (OBBs), bounding spheres and different kinds of navigation are delivered. In particular, we provide solutions which give average speed ups of 3-10 times for AABBS and OBBs depending on the circumstances, compared to the conventional AABB algorithm used for instance in DirectModel [DirectModel], and speed ups of 1.2-1.4 for bounding spheres, compared to Silicon Graphics’ implementation in Cosmo3D [Cosmo3D] and Performer [Performer].
منابع مشابه
Optimized View Frustum Culling Algorithms for Bounding Boxes
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...
متن کاملConservative From-Point Visibility
Visibility determination has been an important part of the computer graphics research for several decades. First studies of the visibility were hidden line removal algorithms, and later hidden surface removal algorithms. Today’s visibility determination is mainly concentrated on conservative, object level visibility determination techniques. Conservative methods are used to accelerate the rende...
متن کاملGeneration of Subdivision Hierarchies for Efficient Occlusion Culling of Large Polygonal Models
Efficient handling of large polygonal scenes has always been a challenging task. In recent years, view-frustum and occlusion culling have drawn a lot of attention for reducing the complexity of those scenes. The problem of how to efficiently organize such scenes for fast image synthesis is widely neglected, although the answer heavily affects the overall performance. In this paper, we present t...
متن کاملHierarchical Visibility Culling for Spline Models
We present hierarchical algorithms for visibility culling of spline models This includes back patch culling a generalization of back face culling for poly gons to splines These algorithms are extended to trimmed surfaces as well We propose di erent spa tial approximations for enclosing the normals of a spline surface and compare them for e ciency and e ectiveness on di erent graphics systems We...
متن کاملGeneration of Decomposition Hierarchies for Efficient Occlusion Culling of Large Polygonal Models
Efficient handling of large polygonal scenes has always been a challenging task and in recent years, view-frustum and occlusion culling have drawn a lot of attention for accomplishing this goal. The problem of how to efficiently organize such scenes for fast image synthesis is widely neglected, although the answer heavily affects the overall performance. In this paper, we present three adapted ...
متن کامل