3
$\begingroup$

I'm working on an algorithm which should check if two polygons, described by their vertex coordinates, are: one inside the other, are intersecting or are separated

image below describe this three cases: example

i'm thinking about how to do it but i'm not having any idea. Any suggestion?

solved: i solved using Shamos-Hoey Algorithm and Winding Number method

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.