Get invaluable Interview and Career Tips delivered directly to your inbox. Get your news alert set up today, Once you confirm your Email subscription, you will be able to download Job Inteview Questions Ebook . Please contact me if you there is any issue with the download.
Intersection of two convex polygons
number of vertices on Pi and n =
Pm
i=1 ni. The vertices of each polygon is listed in counter-
clockwise order, starting at the leftmost vertex of Pi (that is, the one with the smallest x-
coordinate). Two polygons Pi and Pj are said to intersect if they contain any point in common
(that is, either theirboundaries intersect or one polygon is contained within the other). Present
an O(n logm) algorithm that determines whether any two polygons of the set intersect
This Question is not yet answered!
Related Answered Questions
Related Open Questions