Representations for Space Planning

49Citations
Citations of this article
34Readers
Mendeley users who have this article in their library.

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.

References Powered by Scopus

Sketchpad a man-machine graphical communication system

623Citations
N/AReaders
Get full text

SHARER, a time sharing system for the CDC 6600

6Citations
N/AReaders
Get full text

Dynamic Supervisors - Their design and construction

3Citations
N/AReaders
Get full text

Cited by Powered by Scopus

The Quadtree and Related Hierarchical Data Structures

1556Citations
N/AReaders
Get full text

Networks of constraints: Fundamental properties and applications to picture processing

902Citations
N/AReaders
Get full text

Automatic Planning of Manipulator Transfer Movements

477Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

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

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 13

54%

Professor / Associate Prof. 6

25%

Researcher 5

21%

Readers' Discipline

Tooltip

Computer Science 6

35%

Design 5

29%

Engineering 5

29%

Physics and Astronomy 1

6%

Save time finding and organizing research with Mendeley

Sign up for free