Answers are grounded in this paper and cite their sources.
This research introduces a computational algorithm that uses simulated annealing to optimize three-dimensional component layouts. General component layout problems are characterized by three objectives: achieving high packing density, fitting components into a given container and satisfying spatial constraints on components. This paper focuses on the extension of a simulated annealing packing algorithm to a general layout algorithm through the implementation of a language of spatial constraints that are characteristic of layout problems. These constraints allow the designer to specify desired component proximities or to restrict translation or rotation of components based on a global origin or set of coordinate axes, or relative to other component locations or orientations. The layout of components from a cordless power drill illustrates the algorithm.
No takes yet. Share an insight, caveat, or question.
Szykman et al. (1997) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: