ON INTERSECTING A SET OF ISOTHETIC LINE SEGMENTS WITH A CONVEX POLYGON OF MINIMUM AREA
2009 ◽
Vol 19
(06)
◽
pp. 557-577
◽
We describe an O(n2)-time algorithm for computing a minimum-area convex polygon that intersects a set of n isothetic line segments.
2006 ◽
Vol 17
(05)
◽
pp. 1031-1060
◽
Keyword(s):
2008 ◽
Vol 105
(2)
◽
pp. 58-64
◽
2003 ◽
Vol 13
(05)
◽
pp. 439-445
◽
2017 ◽
Vol 27
(03)
◽
pp. 159-176
Keyword(s):
1989 ◽
Vol 31
(1)
◽
pp. 17-20
◽
2000 ◽
Vol 10
(01)
◽
pp. 73-78
◽
Keyword(s):