T. M. Murali (tmax++at++cs.duke.edu)
Fri, 12 Sep 1997 12:12:33 -0400 (EDT)
Thanks for the pointer. I know about the portal culling algorithm. I
would like to clarify that I have my own algorithm for occlusion
culling that I want to implement. This algorithm inherently depends on
a BSP; it traverses the BSP in front-to-back order to determine what
triangles are (potentially) visible. It then renders these triangles
using the z-buffer. What I am trying to figure out is the best way to
interface this algorithm with Performer so that I can extract the
maximum benefit from the support built into Performer for real-time
graphics applications.
Once I finish the implementation, I hope to compare its performance to
the performance of the portal culling algorithm.
=======================================================================
List Archives, FAQ, FTP: http://www.sgi.com/Technology/Performer/
Submissions: info-performer++at++sgi.com
Admin. requests: info-performer-request++at++sgi.com
This archive was generated by hypermail 2.0b2 on Mon Aug 10 1998 - 17:55:56 PDT