In this paper we propose and illustrate analytic techniques for the analysis of plans. Two issues are addressed: first, the characterization of individual surfaces according to the local and global patterns of visual connectivity between surfaces; second, the pattern of the smallest set of positions from which all surfaces become completely visible.
Get full access to this article
View all access options for this article.
References
1.
BenediktM L, 1979, “To take hold of space: Isovists and isovist field”Environment and Planning B647–65
2.
ChvátalA, 1975, “A combinatorial theorem in computational geometry”Journal of Combinatorial Theory, Series B1839–41
3.
FiegeU, 1996, “A threshold of ln n for approximating set cover”, in Proceedings of the 28th Annual ACM Symposium on the Theory of ComputingAssociation for Computing Machinery, 1133 Avenue of the Americas, New York, NY 10036, pp 314–318
4.
FiskS, 1978, “A short proof of Chvátal's watchman theorem”Journal of Combinatorial Theory, Series B24374
5.
HansonJ, 1989, “London as it might have been: An analysis of the post fire plans for the rebuilding of the City of London after the Great Fire of 1666”Ekistics334/33522–42
6.
HansonJ, 1994, “Deconstructing architects' houses”Environment and Planning B: Planning and Design21675–704
7.
HillierB, 1996Space is the Machine (Cambridge University Press, Cambridge)
8.
HillierBHansonJ, 1984The Social Logic of Space (Cambridge University Press, Cambridge)
9.
KeilJ M, 1985, “Decomposing a polygon into simpler components”SIAM Journal of Computing14799–817
10.
O'RourkeJ, 1987Art Gallery Theorems and Algorithms (Oxford University Press, Oxford)
11.
O'RourkeJ, 1997, “Visibility”, in Handbook of Discrete and Computational Geometry Eds GoodmanJ EO'RourkeJ (CRC Press, Boca Raton, FL) pp 467–479
12.
PeponisJWinemanJRashidMKimS HBafnaS, 1997, “On the description of shape and spatial configuration inside buildings: Convex partitions and their local properties”Environment and Planning B: Planning and Design24761–781
13.
PeponisJWinemanJBafnaSRashidMKimS H, 1998, “On the generation of linear representations of spatial configuration”Environment and Planning B: Planning and Design forthcoming
14.
SlavikP, 1996, “A tight analysis of the greedy algorithm for set cover”, in Proceedings of the 28th Annual ACM Symposium on the Theory of ComputingAssociation for Computing Machinery, 1133 Avenue of the Americas, New York, NY 10036, pp 435–439
