1. L.J. Aupperle, H.E. Conn, J.M. Keil and J. O'Rourke, Covering Orthogonal Polygons with Squares, 26th Annual Allerton Conference on Communication, Control and Computation, 1988.
2. R. Bar-Yehuda and E. Ben-Hanoch, A Linear-Time Algorithm for Covering Simple Polygons with Similar rectangles, International Journal of Computational Geometry & Applications, vol. 6, no 1, 1996.
3. B.M. Chazelle, Computational Geometry and Convexity, Ph.D. Thesis, Dept. Comp. Sci., Yale University, New Haven, CT, 1979. Carnegie-Mellon Univ. Report CS-80-150.
4. 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).
5. C. Levcopoulos and J. Gudmundsson, Close Approximation of Minimum Rectangular Coverings, FST&TCS-16, Hyderabad, India, 1996 (LNCS, Springer-Verlag).