| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4952942 | Journal of Computational Design and Engineering | 2017 | 12 Pages |
â¢Problem is to arrange given sub-rectangles within a given predefined contour shape.â¢Required arrangement must satisfies given adjacency and size constraints.â¢An algorithm for generation of plus-shaped arrangements is presented.â¢Architectural application of the work has been demonstrated.
This work consider the problem of rectilinear arrangement which is about arranging given rectangular objects of different sizes in the frame of a given rectilinear polygon while considering dimension and position of each rectangle and adjacency relations among the rectangles.The current work is part of a larger work aimed at automated generation of rectilinear arrangements while satisfying given dimensional and topological constraints. In this paper, we present a set of algorithms for obtaining a plus-shaped arrangement. In addition, we present some heuristic techniques for reducing the size of extra spaces present inside the obtained arrangement. At the end, we demonstrate architectural application of the presented work.
Graphical abstractDownload high-res image (138KB)Download full-size image
