Containment of a single polygon using mathematical programming

DOI10.1016/0377-2217(94)00279-7zbMath0912.90238OpenAlexW2085026477MaRDI QIDQ1268270

Tom M. Cavalier, Roger B. Grinde

Publication date: 18 October 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00279-7

zbMATH Keywords

computational geometrynestingstock cuttingparametric linear programpolygon containment problempattern layout

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Combinatorial optimization (90C27) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

A new algorithm for the two-polygon containment problem, Optimal clustering of a pair of irregular objects

Cites Work

• Unnamed Item
• Unnamed Item
• Applied simulated annealing
• Using a tabu search approach for solving the two-dimensional irregular cutting problem
• Polygon placement under translation and rotation