A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Rectangular Partitions of a Rectilinear Polygon
[article]
2021
arXiv
pre-print
We investigate the problem of partitioning a rectilinear polygon P with n vertices and no holes segments drawn inside P under two optimality criteria. In the minimum ink partition, the total length of the line segments drawn inside P is minimized. We present an O(n^3)-time algorithm using O(n^2) space that returns a minimum ink partition of P. In the thick partition, the minimum side length over all resulting rectangles is maximized. We present an O(n^3 log^2n)-time algorithm using O(n^3) space
arXiv:2111.01970v1
fatcat:hqwb4tbicfhvrhr5qp5746srci