scientific article; zbMATH DE number 842885

MaRDI QIDQ4862345zbMATH OpenFDO

Authors Sven Schuierer, Vladimir Estivill-Castro

Publication date 2 July 1996

zbMATH Keywords

monotone stabbers

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 553906
• scientific article; zbMATH DE number 718865
• scientific article; zbMATH DE number 7662166
• Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons
• Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems
• Efficient algorithms for approximating polygonal chains
• The parameterized complexity of stabbing rectangles
• Constant approximation algorithms for rectangle stabbing and related problems
• Computing partitions of rectilinear polygons with minimum stabbing number
• scientific article; zbMATH DE number 1875426

Cited in

(5)

• Algorithms for high dimensional stabbing problems
• scientific article; zbMATH DE number 553906 (Why is no real title available?)
• Stabbing Convex Polygons with a Segment or a Polygon
• scientific article; zbMATH DE number 140472 (Why is no real title available?)
• Monotone Pieces of Chains

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 Q4862345)