Jump to content
  • Advertisement
Sign in to follow this  
maxest

Finding viewing-frustum vertices

This topic is 3621 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

What is the easiest way to obtain viewing-frustm vertices? Can I take: [-1, -1, 0] // 1 [-1, -1, 1] // 2 ... ... [1, 1, 0] // 7 [1, 1, 1] // 8 and transform them by the inverse of view-projection matrix?

Share this post


Link to post
Share on other sites
Advertisement
Thanks for the link - great that author describes so many approaches to this problem :).
However my solution also seems to work - I would say that it is even easier than the methods described in the article :).

Share this post


Link to post
Share on other sites
Good you're happy with your own method.
But it's what you do with them that counts, the radar approach can eliminate a sphere test uber-quickly.

Share this post


Link to post
Share on other sites
Sign in to follow this  

  • Advertisement
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

We are the game development community.

Whether you are an indie, hobbyist, AAA developer, or just trying to learn, GameDev.net is the place for you to learn, share, and connect with the games industry. Learn more About Us or sign up!

Sign me up!