Abstract
Algorithms for the Boolean operations and relations on shapes and labelled shapes are presented.
Get full access to this article
View all access options for this article.
References
1.
Aho
A V
Hopcroft
J E
Ullman
J D
, 1974 The Analysis and Design of Computer Algorithms (Addison-Wesley , Reading, Mass )
2.
Brown
M R
Tarjan
R E
, 1979 “A fast merging algorithm” Journal of the Association for Computing Machinery 26 (2 ) 211 –226
3.
Crane
C A
, 1972 Linear Lists and Priority Queues as Balanced Binary Trees PhD thesis, technical report, STAN-CS-72-259, Computer Science Department, Stanford University , Stanford, Calif.
4.
Horowitz
E
Sahni
S
, 1976 Fundamentals of Data Structure (Computer Science Press , Woodland Hills, Calif. )
5.
Knuth
D E
, 1973a The Art of Computer Programming, Volume 1: Fundamental Algorithms (Addison-Wesley , Reading, Mass )
6.
Knuth
D E
, 1973b The Art of Computer Programming, Volume 3: Sorting and Searching (Addison-Wesley , Reading, Mass )
7.
Krishnamurti
R
, 1981 “The construction of shapes” Environment and Planning B 8 (forthcoming)
8.
Stiny
G
, 1980 “Introduction to shapes and shape grammars” Environment and Planning B 1 343 –351
9.
Wirth
N
, 1976 Algorithms + Data Structure = Programs (Prentice-Hall , Englewood Cliffs, NJ )