Jump to content
  • Advertisement
Sign in to follow this  
arithma

Visibility Problem

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

The space is a 2D one. The environment is created with directed segments. A clockwise wounded polygon (list of segments, no strips) specifies an unaccessible region. And it is also nonseethrough. What I need to determine is the set of all segments that can be seen (through a noninterupted straight ray) from a certain position. The segments are static. A naive implementation would be to check for each line the respective culled lines. I was considering using a BSP tree for the job. But since this is my first confrontation with it, am a bit fuzzy on the use of it. Resources are always talking about the view frustum in relation to the planes. The bottom line: Is the BSP fit for the job? How? If not, what shall I do?

Share this post


Link to post
Share on other sites
Advertisement
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!