Computation of pair placement of geometric objects

zbMATH Open0993.65028MaRDI QIDQ5954749FDOQ5954749

Authors: V. N. Martynchik, N. N. Metel'skij, Jean Marie Proth 

Publication date: 13 September 2002

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 4051003
• Local optimization method in placement problems of polygons
• An algorithm for polygon placement using a bottom-left strategy
• scientific article; zbMATH DE number 1822170
• Optimal placement of rectangles on a plane with fixed objects

zbMATH Keywords

complexitycombinatorial algorithmpolygonmaximum intersection areaoptimal pair placement

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Combinatorial aspects of packing and covering (05B40) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Cited In (1)

• Computing pairings using \(x\)-coordinates only

This page was built for publication: Computation of pair placement of geometric objects

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