Robust Computation of a Minimum Area Convex Polygon Stabber of a Set of   Isothetic Line Segments
  In this paper, we discuss the algorithm engineering aspects of an O(n^2)-time algorithm [6] for computing a minimum-area convex polygon that intersects a set of n isothetic line segments. 
Xin Wu and Xijie Zeng and Bryan St. Amour and Asish Mukhopadhyay
cs.CG