Finding the upper envelope of n line segments in O(n log n) time
Information Processing Letters
Translational polygon containment and minimal enclosure using linear programming based restriction
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Packing Convex Polygons into Rectangular Boxes
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
A simple method for fitting of bounding rectangle to closed regions
Pattern Recognition
| Hi-index | 0.00 |
We study the problem of cutting a simple polygon with n vertices into two pieces such that - if we reposition one piece disjoint of the other, without rotation - they have the minimum possible bounding square. If we cut with a single horizontal or vertical segment, then we can compute an optimal solution for a convex polygon with n vertices in O(n) time. For simple polygons we give an O(n4 驴(n) log n) time algorithm.