Stabbing parallel segments with a convex polygon

DOI10.1016/0734-189X(90)90135-IzbMATH Open0771.68104OpenAlexW2069683521MaRDI QIDQ5289812FDOQ5289812

Authors: Jack 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

Recommendations

• scientific article; zbMATH DE number 140472
• Stabbers of line segments in the plane
• New results on stabbing segments with a polygon
• scientific article; zbMATH DE number 718865

zbMATH Keywords

polygonstabbingparallel line segments

Mathematics Subject Classification ID

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

Cited In (17)

• Title not available (Why is that?)
• Largest and smallest convex hulls for imprecise points
• The directed Hausdorff distance between imprecise point sets
• Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments
• Stabbing circles for sets of segments in the plane
• On intersecting a set of parallel line segments with a convex polygon of minimum area
• Title not available (Why is that?)
• Convex transversals
• New results on stabbing segments with a polygon
• New results on stabbing segments with a polygon
• Ordered stabbing of pairwise disjoint convex sets in linear time
• Orthogonal segment stabbing
• ON INTERSECTING A SET OF ISOTHETIC LINE SEGMENTS WITH A CONVEX POLYGON OF MINIMUM AREA
• Stabbing Convex Polygons with a Segment or a Polygon
• Largest and smallest area triangles on imprecise points
• Convex partial transversals of planar regions
• Convex transversals

This page was built for publication: Stabbing parallel segments with a convex polygon

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5289812)