Please Turn OFF your ad blocker

- OR -

LOGIN to continue using GeekInterview website.

This site uses cookies to deliver our services and to show you relevant ads and job listings. By using our site, you acknowledge that you have read and understand our Cookie Policy, Privacy Policy, and our Terms of Service. Your use of GeekInterviewâ€™s Content, Products and Services, including the Exforsys Inc Network, is subject to these policies and terms.

## 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