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

Authors:
Asish Mukhopadhyay;Chanchal Kumar;Eugene Greene;Binay Bhattacharya
Affiliations:
School of Computer Science, University of Windsor, Canada;Indian Administrative Service, India;School of Computer Science, University of Windsor, Canada;School of Computing Science, Simon Fraser University, Canada
Venue:
Information Processing Letters
Year:
2008

Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
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
The directed Hausdorff distance between imprecise point sets

Theoretical Computer Science
Algorithms for interval structures with applications

FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Algorithms for interval structures with applications

Theoretical Computer Science

Hi-index	0.89