A heuristic problem solving design system for equipment or furniture layouts
Communications of the ACM
Preliminary report on a system for general space planning
Communications of the ACM
The Automated Architect
Interactive space layout: A graph theoretical approach
DAC '78 Proceedings of the 15th Design Automation Conference
Automated facilities Layout Programs
ACM '66 Proceedings of the 1966 21st national conference
PIAF: Efficient IC Floor Planning
IEEE Expert: Intelligent Systems and Their Applications
On finding most optimal rectangular package plans
DAC '82 Proceedings of the 19th Design Automation Conference
A graph-theoretic approach to constrained floor plan estimation from radar measurements
IEEE Transactions on Signal Processing
Computer-generated residential building layouts
ACM SIGGRAPH Asia 2010 papers
Floor plan design using block algebra and constraint satisfaction
Advanced Engineering Informatics
Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
Operations Research Letters
Constraint-aware interior layout exploration for pre-cast concrete-based buildings
The Visual Computer: International Journal of Computer Graphics
| Hi-index | 48.24 |
The combinatorial complexity of most floor plan design problems makes it practically impossible to obtain a systematic knowledge of possible solutions using pencil and paper. The objective of this paper is to contribute to the development of computer methods providing such knowledge for the designer. The paper describes an algorithm which generates all possible rectangular plans on modular grids with congruent cells, subject to constraints on total area, room areas, wall lengths, room adjacencies, and room orientations. To make room sizes regular and limit the solution set only such grids are used which minimize the number of cells in the smallest room. The description is sufficiently detailed to serve as a basis for programming. Test results for a Pascal implementation of the algorithm are reported. Realistic problems of up to ten rooms have been solved in modest lengths of computer time. The results indicate that the approach of exhaustive generation may prove to be more fruitful than generally assumed.