how to find out if a shape is passable

Posted by jd on Stack Overflow See other posts from Stack Overflow or by jd
Published on 2010-05-05T21:01:56Z Indexed on 2010/05/05 21:08 UTC
Read the original article Hit count: 150

Filed under:
|

I have a complex polygon (possibly concave) and a few of its edges marked as entry/exit points. there is a possibility that inside this polygon may lie one or more blockades of arbitrary shape. what approaches could I use to determine whether a path of certain width exists between a pair of entry/exit edges?

having read through the question it looks like a homework type - it is not. I just wish to have a at least a few leads I could pursue, as this is new to me.

© Stack Overflow or respective owner

Related posts about algorithm

Related posts about pathfinding