1. B.M. Chazelle, Computational Geometry and Convexity, Ph.D. Thesis, Department of Computer Science, Yale University, New Haven, CT, 1979.
2. J.C. Culberson and R.A. Reckhow, Covering Polygon is Hard, Journal of Algorithms, 17:2–44, 1994.
3. J. Snoeyink, C.A. Wang and F. Chin, Finding the Medial Axis of a Simple Polygon in Linear-Time, ISAAC '95, Cairns, Australia, 1995 (LNCS 1006 Springer-Verlag).
4. D. Franzblau, Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles, SIAM J. Disc. Math., 2:307–321, 1989.
5. A. Hegediis, Algorithms for covering polygons by rectangles, Computer Aided Design, vol. 14, no. 5, 1982.