| id |
ijac201513102 |
| authors |
Takizawa, Atsushi Yushi Miyata, Naoki Katoh |
| year |
2015 |
| title |
Enumeration of Floor Plans Based on a Zero-Suppressed Binary Decision Diagram |
| source |
International Journal of Architectural Computing vol. 13 - no. 1, 25–44 |
| summary |
This paper presents novel algorithms for enumerating architectural floor plans. The enumeration approach attempts to generate all feasible solutions that satisfy given constraints. Therefore, such a method might usefully reveal the potential diversity of Open Building floor plans. However, combinatorial enumeration solutions easily explode even for small problem sizes. We represent a space by a set of cells and organize some cells into polyomino-like configurations. We then enumerate all cell combinations that can be tiled in the given space using an efficient search algorithm for combinatorial problems. We also propose queries for extracting specific floor plans that satisfy additional constraints from all enumerated floor plans without re-enumeration. Our approach solves a 56-cell configuration space within a realistic timeframe. |
| series |
journal |
| full text |
 file.pdf (1,074,220 bytes) |
| references |
Content-type: text/plain
|
Avis, D. and Fukuda, K. (1996)
 Reverse Search for Enumeration
, Discrete A pplied Math, 1996, 6, 21-46
|
|
|
|
|
Baybars I., and Eastman C. M (1980)
Enumerating architectural arrangements by generating their underlying graphs
, Environment and Planning B, 1980, 7(3), 289-310
|
|
|
|
|
Bryant, R. E (1986)
Graph-Based Algorithms for Boolean Function Manipulation
, IEEE Transactions on Computers, 1986, C-35(8), 677-691
|
|
|
|
|
Doi S., Takada M., Yasueda H. and Kamo M. (2013)
The Role of Fixed Infill When Installing and Changing Variable Infill - Through the experiments in “Infill Laboratory Glass Cube” located in NEXT21
, Journal of Architecture and Planning, 2013, 683(78), 11-18
|
|
|
|
|
Earl C. F. (1977)
A note on the generation of rectangular dissections
, Environment and Planning B, 1977, 4(2), 241-246
|
|
|
|
|
Earl C. F. (1980)
Rectangular shapes
, Environment and Planning B, 1980, 7(3), 311-342
|
|
|
|
|
Flemming U (1980)
Wall representations of rectangular dissections: additional results
, Environment and Planning B, 1980, 7(3), 247-251
|
|
|
|
|
Flemming U. (1978)
Wall representations of rectangular dissections and their use in automated space allocation
, Environment and Planning B, 1978, 5(2), 215-232
|
|
|
|
|
Gero J. S. (1977)
Note on “Synthesis and optimization of small rectangular floor plans” of Mitchell, Steadman, and Liggett
, Environment and Planning B, 1977, 4(1), 81-88
|
|
|
|
|
Gero, J. S. (1985)
Design Optimization
, (Notes and Reports in Mathematics in Science and Engineering), Academic Press, New York, 1985
|
|
|
|
|
Golomb, S. W. (1996)
Polyominoes: Puzzles, Patterns, Problems, and Packings, Revised and Expanded Second edition
, Princeton University Press, 1996
|
|
|
|
|
Habraken, N. J. (1972)
Supports: An Alternative to Mass Housing
, Praeger, New York
|
|
|
|
|
Heitor, T. V., Duarte, J. P., Pinto, R. M. (2004)
Combing Grammars and Space Syntax: Formulating, Generating and Evaluating Designs
, International Journal of Architectural Computing, 2004, 2(4), 492-515
|
|
|
|
|
Inoue, T., Iwashita, H., Kawahara, J., and Minato, S. (2014)
Graphillion: software library for very large sets of labeled graphs
, International Journal on Software Tools for Technology Transfer, 2014, 1-10
|
|
|
|
|
Krishnamurti R., and Roe P. H. O. (1978)
Algorithmic aspects of plan generation and enumeration
, Environment and Planning B, 1978, 5(2), 157-177
|
|
|
|
|
March L., and Earl C. F. (1977)
On counting architectural plans
, Environment and Planning B, 1977, 4(1), 57-80
|
|
|
|
|
Minato, S. (1993)
Zero-suppressed BDDs for Set Manipulation in C ombinatorial Problems
, Proceedings of the 30th International Design Automation Conference, Dallas, 1993, 272-277
|
|
|
|
|
Mitchell W. J., Steadman J. P., and Liggett R. S. (1976)
Synthesis and optimization of small rectangular floor plans
, Environment and Planning B, 1976, 3(1), 37-70
|
|
|
|
|
Nakano, S. (2002)
Enumerating Floorplans with n Rooms, IEIC E transactions on fundamentals of electronics
, Communications and computer sciences, 2002, E85-A(7), 1746-1750
|
|
|
|
|
Saitoh, T., Kawahara, J., Yoshinaka, R., Suzuki, H. and Minato, S. (2011)
Path Enumeration Algorithms Using ZDD and Their Performance Evaluations
, IPSJ SIG Notes, 2011, 2011-AL-134(17), 1-6
|
|
|
|
| last changed |
2019/05/24 09:55 |
|
