A technique for solving the polygon inclusion problems

Kai Jin, Taikun Zhu, Ruixi Luo

We propose a technique called Rotate-and-Kill for solving the polygon inclusion and circumscribing problems. By applying this technique, we obtain $O(n)$ time algorithms for comput…