Describing plan configuration according to the covisibility of surfaces

Environment and Planning B: Planning and Design

Volumn 25, Issue 5, 1998, Pages 693-708

  Peponis, J ^a   Wineman, J ^a   Rashid, M ^a   Bafna, S ^a   Kim, S H ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

METHODOLOGY; PLAN DESIGN; PLANNING METHOD;

EID: 0031724619     PISSN: 02658135     EISSN: None     Source Type: Journal    
DOI: 10.1068/b250693     Document Type: Article

References (14)

1. Benedikt M L, 1979, "To take hold of space: isovists and isovist field" Environment and Planning B 6 47-65
2. Chvátal A, 1975, "A combinatorial theorem in computational geometry" Journal of Combinatorial Theory, Series B 18 39-41
3. Fiege U, 1996, "A threshold of In n for approximating set cover", in Proceedings of the 28th Annual ACM Symposium on the Theory of Computing Association for Computing Machinery, 1133 Avenue of the Americas, New York, NY 10036, pp 314-318
4. Fisk S, 1978, "A short proof of Chvàtal's watchman theorem" Journal of Combinatorial Theory, Series B 24 374
5. Hanson J, 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" Ekistics 334/335 22-42
6. Hanson J, 1994, "Deconstructing architects' houses" Environment and Planning B: Planning and Design 21 675-704
7. Hillier B, 1996 Space is the Machine (Cambridge University Press, Cambridge)
8. Hillier B, Hanson J, 1984 The Social Logic of Space (Cambridge University Press, Cambridge)
9. Keil J M, 1985, "Decomposing a polygon into simpler components" SIAM Journal of Computing 14 799-817
10. O'Rourke J, 1987 Art Gallery Theorems and Algorithms (Oxford University Press, Oxford)
11. O'Rourke J, 1997, "Visibility", in Handbook of Discrete and Computational Geometry Eds J E Goodman, J O'Rourke (CRC Press, Boca Raton, FL) pp 467-479
12. Peponis J, Wineman J, Rashid M, Kim S H, Bafna S, 1997, "On the description of shape and spatial configuration inside buildings: convex partitions and their local properties" Environment and Planning B: Planning and Design 24 761-781
13. Peponis J, Wineman J, Bafna S, Rashid M, Kim S H, 1998, "On the generation of linear representations of spatial configuration" Environment and Planning B: Planning and Design forthcoming
14. Slavik P, 1996, "A tight analysis of the greedy algorithm for set cover", in Proceedings of the 28th Annual ACM Symposium on the Theory of Computing Association for Computing Machinery, 1133 Avenue of the Americas, New York, NY 10036, pp 435-439