any bbox miss is sufficient

This commit is contained in:
Jan Petykiewicz 2022-04-07 17:59:16 -07:00
parent 6b7d8fe478
commit 44e2d6fa13

View File

@ -87,7 +87,7 @@ def intersects(poly_a: ArrayLike, poly_b: ArrayLike) -> bool:
max_a = poly_a.max(axis=0)
max_b = poly_b.max(axis=0)
if ((min_a > max_b) | (min_b > max_a)).all():
if ((min_a > max_b) | (min_b > max_a)).any():
return False
#TODO: Check against sorted coords?