Computational geometry: an introduction
Computational geometry: an introduction
Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
Computers and Operations Research
| Hi-index | 0.00 |
An optimal placement problem for special-form objects on a multiply connected domain is considered. The objects must be disjoint and belong to a convex region that contains forbidden areas. The performance criterion is described by a function of maximum of differentiable functions. The method of feasible directions and the method of directed transition were adapted to solve this problem.