ON INTERSECTING A SET OF ISOTHETIC LINE SEGMENTS WITH A CONVEX POLYGON OF MINIMUM AREA
We describe an O(n(2))-time algorithm for computing a minimum-area convex polygon that intersects a set of n isothetic line segments.
geometric optimization minimum area polygon orthogonal segments