Hello everyone,
Problem statement:
We have n > 2 pairs: < line, side > , side . How can we check fast if they make non-empty polygon (or point)?
Cheers
Polygon and N lines
Hello everyone,
Problem statement:
We have n > 2 pairs: < line, side > , side . How can we check fast if they make non-empty polygon (or point)?
Cheers