Acknowledgements

T heo rem 6 Given a convex polygon P with m edges and a polygonal environment Q with a total o fn edges, we can compute a largest free placement of P inside Q in randomized expected time 0 (mnXQ(mn) log5 mn).