A new algorithm for the two-polygon containment problem

DOI10.1016/S0305-0548(96)00050-0MaRDI QIDQ1373882zbMATH OpenFDO

Authors Roger B. Grinde, Tom M. Cavalier

Publication date 22 June 1998

Published in Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

parametric programmingtwo-polygon containment problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Polygon containment under translation
• scientific article; zbMATH DE number 3911704
• scientific article; zbMATH DE number 30304
• Algorithms for deciding the containment of polygons

Cites work

• scientific article; zbMATH DE number 3911704 (Why is no real title available?)
• scientific article; zbMATH DE number 30304 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• Containment of a single polygon using mathematical programming
• Multiple translational containment. I: An approximate algorithm
• Multiple translational containment. II: Exact algorithms
• Polygon containment under translation
• Polygon placement under translation and rotation
• Solution approaches to irregular nesting problems

Cited in

(3)

• scientific article; zbMATH DE number 4035223 (Why is no real title available?)
• Optimal clustering of a pair of irregular objects
• Algorithms for deciding the containment of polygons

This page was built for publication: A new algorithm for the two-polygon containment problem

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