Abstract
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. © 1970, ACM. All rights reserved.
Author supplied keywords
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for freeCite
CITATION STYLE
APA
Eastman, C. M. (1970). Representations for Space Planning. Communications of the ACM, 13(4), 242–250. https://doi.org/10.1145/362258.362281