• Advertisement
Sign in to follow this  

Best way to find portals between cells

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

Hi. To calculate a portal i check the intersection of the bounding boxes of the cells. So if there is n cells the check is n^2. I converted a Quake2 map in a bsp tree but the map have many cells (bsp leaf nodes). About ~ 3800 so 3800^2 is a very large number. Is there a way where i can check it fast? What is the best way to check if a portal is transparent i.e. there's no polygon in the middle like a wall. I'm using a lot of line visibility. Thanks in advance.

Share this post


Link to post
Share on other sites
Advertisement
It sounds like you could use quad/octrees to solve your problem more quickly.

Share this post


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

  • Advertisement