Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference20 articles.
1. Alon, N., Kleitman, D.J.: Partitioning a rectangle into small perimeter rectangles. Discrete Math. 103(2), 111–119 (1992)
2. Aupperle, L.J., Conn, H.E., Keil, J.M., O’Rourke, J.: Covering orthogonal polygons with squares. In: Proceedings of 26th Allerton Conference Communication, Control, and Computing, pp. 97–106 (1988)
3. Bar-Yehuda, R., Ben-Hanoch, E.: A linear time algorithm for covering simple polygons with similar rectangles. Int. J. Comput. Geom. Appl. 6(1), 79–102 (1996)
4. Bosboom, J., Demaine, E.D., Demaine, M.L., Lynch, J., P.M., Rudoy, M., Yodpinyanee, A.: Dissection with the fewest pieces is hard, even to approximate. In Discrete and Computational Geometry and Graphs - 18th Japan Conference, JCDCGG 2015, Kyoto, Japan, September 14–16, 2015, Revised Selected Papers, pp. 37–48 (2015)
5. Brooks, R.L., Smith, C.A.B., Stone, A.H., Tutte, W.T.: The dissection of rectangles into squares. Duke Math. J. 7, 312–340 (1940)