Given two polygons P and Q, with n P and n Q extreme points.
Assume P and Q are both given with their list of extreme points in, e.g., the CW order, starting with an arbitrary extreme point.
What is the best complexity of their intersection check, i.e., checking whether they intersect or not.

Question

Given two polygons P and Q, with n P   and n Q   extreme points. 
 Assume P and Q are both given with their list of extreme points in, e.g., the CW order, starting with an arbitrary extreme point. 
 What is the best complexity of their intersection check, i.e., checking whether they intersect or not.

Accepted Answer

O(n P  + n Q )

Answer

O( max {n P  log n P ,  n Q  log n Q  })

Answer

O( max {n P  , n Q } )

Answer

O(n P  log n P  + n Q  log n Q  )

Crowdly

Given two polygons P and Q, with n P and n Q extreme points. Assume P and ...

Want instant access to all verified answers on moodle.concordia.ca?