scientific article; zbMATH DE number 140472

MaRDI QIDQ4028889zbMATH OpenFDO

Authors Jack Snoeyink, Michael T. Goodrich

Publication date 28 March 1993

zbMATH Keywords

bipartite stabbing problemchain-unwrappingimage processingpoint-sweeping

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computing methodologies for image processing (68U10)

Recommendations

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

Cited in

(10)

• Optimal algorithms for some intersection radius problems
• Stabbing Convex Polygons with a Segment or a Polygon
• scientific article; zbMATH DE number 553906 (Why is no real title available?)
• scientific article; zbMATH DE number 718865 (Why is no real title available?)
• New results on stabbing segments with a polygon
• New results on stabbing segments with a polygon
• Convex transversals
• Stabbing parallel segments with a convex polygon
• Stabbers of line segments in the plane
• Orthogonal segment stabbing

This page was built for publication:

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