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

DOI10.1016/j.ipl.2007.08.029zbMath1184.68567OpenAlexW2070789991MaRDI QIDQ2380042

Chanchal Kumar, Binay K. Bhattacharya, Eugene Greene, Asish Kumar Mukhopadhyay

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.08.029

zbMATH Keywords

algorithmscomputational geometrygeometric optimizationgeometric intersection

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (12)

Largest and smallest convex hulls for imprecise points ⋮ Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments ⋮ Algorithms for interval structures with applications ⋮ Covering points with convex sets of minimum size ⋮ New results on stabbing segments with a polygon ⋮ Stabbing segments with rectilinear objects ⋮ Algorithms for Interval Structures with Applications ⋮ Stabbers of line segments in the plane ⋮ The directed Hausdorff distance between imprecise point sets ⋮ Covering Points with Convex Sets of Minimum Size ⋮ ON INTERSECTING A SET OF ISOTHETIC LINE SEGMENTS WITH A CONVEX POLYGON OF MINIMUM AREA ⋮ Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model

Cites Work

• Stabbing line segments
• Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
• MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS
• Stabbing parallel segments with a convex polygon

This page was built for publication: On intersecting a set of parallel line segments with a convex polygon of minimum area