Representations for space planning
Charles M. Eastman · Communications of the ACM · 1970
Problems involving the arrangement of objects in two- or three-space where the objective function primarily consists of derivatives of the distance between objects or their arrangement are called space planning problems. The representational requirements for this problem area are defined and compared with current computer graphic languages. Four alternative data structures that allow automated space planning are described and compared.
Cited by 69 works. doi:10.1145/362258.362281 Open-access PDF
Authors
References
- Sketchpad
- A Mobile Automaton: An Application of Artificial Intelligence Techniques
- A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities
- Compound data structure for computer aided design; a survey
- CORELAP - Computerized Relationship Layout Planning.
- The sofa problem
- Cognitive processes and ill-defined problems: a case study from design
- An Analysis, both Theoretical and by Simulation, of a Time-Shared Computer System
- GRASP---a graphic service program
- Note on the Computer as an Aid to the Architect