Jump to content
  • Advertisement


This topic is now archived and is closed to further replies.

Lab Rat

Bounded volumes

This topic is 5731 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

Hey all, I have the following problem and I can''t figure out a good way to solve it: A point in 3-space is bounded by an arbitrary number of known planes. These planes may or may not form a closed, bounded volume. Is there an easy way to find out if they do? I''ve tried various methods, including Seidel''s randomized LP algorithm, but it does not seem the most efficient way to do this. Any help would be great. Thank, LR

Share this post

Link to post
Share on other sites

  • 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!