Stabbing parallel segments with a convex polygon

DOI10.1016/0734-189X(90)90135-IzbMath0771.68104OpenAlexW2069683521MaRDI QIDQ5289812

Jack Scott Snoeyink, Michael T. Goodrich

Publication date: 24 August 1993

Published in: Computer Vision, Graphics, and Image Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0734-189x(90)90135-i

zbMATH Keywords

polygonstabbingparallel line segments

Mathematics Subject Classification ID

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

Related Items

On intersecting a set of parallel line segments with a convex polygon of minimum area ⋮ Largest and smallest convex hulls for imprecise points ⋮ Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments ⋮ Convex transversals ⋮ New results on stabbing segments with a polygon ⋮ Largest and smallest area triangles on imprecise points ⋮ The directed Hausdorff distance between imprecise point sets ⋮ Convex partial transversals of planar regions ⋮ ON INTERSECTING A SET OF ISOTHETIC LINE SEGMENTS WITH A CONVEX POLYGON OF MINIMUM AREA