|
|
|
|
ROA算法的优化 |
|
|
|
作者：未知 来源：月光软件站 加入时间：2005-2-28 月光软件站 |
s. We can use a more tricky data structure of our patches than just a simple grid - a quadtree. This will allow us to do quick and effective occlusion. Do not forget that when checking whether a quad is in or out of the frustum, that the nodes are not simply 2D squares but also have a third component - height. Cylinders can be reused, as they have already been prepared for an "up" orientated check.
Spatial sorting
Once built (tessellated), our triangle binary tree can be used for "back to front" or "front to back" sorting of the triangles, which can increase performance or help us with special effects. Before making recursive calls, we only need to check which child is closer to the camera and then use the appropriate call order.
Back to front: if you do not have | 
|
|
相关文章：相关软件： |
|
本类阅读TOP10