Local optimization method in placement problems of polygons
From MaRDI portal
Recommendations
- The placement of circles and nonconvex polygons with rotations in a rectangle of minimal length
- Containment of a single polygon using mathematical programming
- Minimax optimal placement problem for special-form objects on a multiply connected domain
- scientific article; zbMATH DE number 1537464
- An algorithm for polygon placement using a bottom-left strategy
Cited in
(12)- Rotational polygon overlap minimization and compaction
- Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem
- An algorithm for polygon placement using a bottom-left strategy
- Minimax optimal placement problem for special-form objects on a multiply connected domain
- Effect of corner information in simultaneous placement of k rectangles and tableaux
- The placement of circles and nonconvex polygons with rotations in a rectangle of minimal length
- Effect of corner information in simultaneous placement of \(K\) rectangles and tableaux
- scientific article; zbMATH DE number 1086894 (Why is no real title available?)
- scientific article; zbMATH DE number 1537464 (Why is no real title available?)
- scientific article; zbMATH DE number 1795209 (Why is no real title available?)
- A Local Optimization-based Solution to the Rectangle Layout Problem
- Computation of pair placement of geometric objects
This page was built for publication: Local optimization method in placement problems of polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768876)
