Ignoring nonvisible surfaces

Started by
1 comment, last by mbenic 22 years ago
Any suggestions on a good, efficient algorithm for testing for the visibility of an object? Thanks --- Matt Benic "Programming today is a race between software engineers striving to build bigger and better idiot-proof programs, and the Universe trying to produce bigger and better idiots. So far, the Universe is winning."
Advertisement
1. bounding sphere round each object.
2. hierarchy of bounding spheres to group objects.
3. test spheres hierarchically against a cone representing the frustum.

That should be enough to cull away the vast majority of what isn''t visible.


Other search terms of interest:
- Portal
- PVS
- Quadtree/Octree/BSPTree
- Occlusion Culling

--
Simon O''Connor
Creative Asylum Ltd
www.creative-asylum.com

Simon O'Connor | Technical Director (Newcastle) Lockwood Publishing | LinkedIn | Personal site

thanks, greatly apprecited.

---
Matt Benic

"Programming today is a race between software engineers striving to build
bigger and better idiot-proof programs, and the Universe trying to produce
bigger and better idiots. So far, the Universe is winning."

This topic is closed to new replies.

Advertisement