Optimized View Frustum Culling Algorithms for Bounding Boxes
暂无分享,去创建一个
[1] John R. Wallace,et al. Shaft Culling for Efficient Ray-Cast Radiosity , 1994 .
[2] James H. Clark,et al. Hierarchical geometric models for visible surface algorithms , 1976, CACM.
[3] Ulf Assarsson. Optimized View Frustum Culling Algorithms , 2002 .
[4] Mel Slater,et al. View volume culling using a probabilistic caching scheme , 1997, VRST '97.
[5] Joseph S. B. Mitchell,et al. Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs , 1998, IEEE Trans. Vis. Comput. Graph..
[6] Ned Greene,et al. Detecting Intersection of a Rectangular Solid and a Convex Polyhedron , 1994, Graphics gems.
[7] Carolina Cruz-Neira,et al. Surround-Screen Projection-Based Virtual Reality: The Design and Implementation of the CAVE , 2023 .
[8] Turner Whitted,et al. Designing a PC Game Engine , 1998, IEEE Computer Graphics and Applications.
[9] James H. Clark,et al. Hierarchical geometric models for visible surface algorithms , 1976, CACM.
[10] Walt Donovan,et al. Direct Outcode Calculation for Faster Clip Testing , 1994, Graphics Gems.
[11] Norman Chin. A Walk through BSP Trees , 1995 .
[12] Daniel Green,et al. Fast Polygon-Cube Intersection Testing , 1995 .