On intersecting a set of isothetic line segments with a convex polygon of minimum area

Authors:
Asish Mukhopadhyay;Eugene Greene;S. V. Rao
Affiliations:
School of Computer Science, University of Windsor, Canada;School of Computer Science, University of Windsor, Canada;Department of Comp. Sc. and Engg., IIT Guwahati, India
Venue:
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
Year:
2007

Citing 2
Cited 2

Stabbing parallel segments with a convex polygon

Computer Vision, Graphics, and Image Processing
Computational Geometry Column #3

ACM SIGGRAPH Computer Graphics

The Directed Hausdorff Distance between Imprecise Point Sets

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Stabbers of line segments in the plane

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe an O(n2)-time algorithm for computing a minimum-area convex polygon that intersects a set of n isothetic line segments.