Sign in to follow this  
arithma

Visibility Problem

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

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

Sign in to follow this