A new algorithm for the two-polygon containment problem

DOI10.1016/S0305-0548(96)00050-0zbMATH Open0889.90159MaRDI QIDQ1373882FDOQ1373882

Authors: Roger B. Grinde, Tom M. Cavalier 

Publication date: 22 June 1998

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

Recommendations

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

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)

Cites Work

• Solution approaches to irregular nesting problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Multiple translational containment. I: An approximate algorithm
• Polygon containment under translation
• Containment of a single polygon using mathematical programming
• Title not available (Why is that?)
• Polygon placement under translation and rotation
• Multiple translational containment. II: Exact algorithms

Cited In (3)

• Title not available (Why is that?)
• 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)