Using Chazelle's simplicity test to verify simple polygons intersection

Question

Is there a way to verify whether a non-empty intersection exists between two simple polygons (not necessarily convex) using the Chazelle's simplicity test ?

Answer 1

Independent of Chazelle, a discussion of the case of intersecting convex polygons can be found at:

• cs.mcgill.ca
• springer.com