Impossible Shortest Path Sometimes Ignoring Holes?

[ThomasSchellenbergNextCentury]

Hello,

I'm not sure if I'm doing something wrong here. I'm trying to make a path that should be impossible (and thus return None), but instead I'm getting a path that's ignoring a hole. Is this a mistake on my part, or a bug in the library? Thanks for your help.

Ubuntu 20.04
Python 3.8.5
extremitypathfinder 2.0.0

env = PlottingEnvironment(plotting_dir='./tmp/')
env.store(
    [(5, 5), (-5, 5), (-5, -5), (5, -5)],
    [[(-5, 1), (-5, 2), (5, 2), (5, 1)]],
    validate=True
)
env.prepare()
path, length = env.find_shortest_path(
    (0, 0),
    (0, 4)
)
assert path == None # path is actually [(0, 0), (0, 4)]

[jannikmi]

Thanks for reporting this. It indeed looks like a bug. I will have a look into it.

[jannikmi]

I was able to resolve this issue. Please note that the way you have specified the input polygons, a path would be allowed due to the way the algorithms was implemented:

In order to "block" the view the polygons must truly overlap like this:

[ThomasSchellenbergNextCentury]

This works for me. Thank you for your quick response!

[jannikmi]

Work progress tracked in #24