It has been shown that, with space syntax, spatial configuration can be described as a set of lines covering all the areas of a layout and all the ways of moving around the one-dimensional and two-dimensional boundaries that it comprises. In this paper we propose alternative formal definitions of linear representations of spatial configuration and the ways in which they can be generated. The significance of these representations is discussed briefly.
Get full access to this article
View all access options for this article.
References
1.
ArkinE MMitchellJ S BSuriS, 1992, “Optimal link path queries in a simple polygon”, in Proceedings of the 3rd ACM — SIAM Symposium on Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia, PA) pp 269–279
2.
BenediktM L, 1979, “To take hold of space: Isovists and isovist field”Environment and Planning B: Planning and Design647–65
3.
ChazelleBDobkinD, 1979, “Decomposing a polygon into its convex parts”, in Proceedings of the 11th Annual ACM Symposium on Theory of Computing (Association for Computing Machinery, New York) pp 38–48
4.
El GindyHAvisD, 1981, “A linear algorithm for computing the visibility polygon from a point”Journal of Algorithms2186–197
5.
FiegeU, 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, New York) pp 314–318
6.
HansonJ, 1994, “Deconstructing architects' houses”Environment and Planning B: Planning and Design21675–704
7.
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
8.
HillierB, 1989, “The architecture of the urban object”Ekistics334–3355–21
HillierBBurdettRPeponisJPennA, 1987, “Creating life, or does architecture determine anything?”Architecture et Comportment3233–250
14.
HillierBHansonJ, 1984The Social Logic of Space (Cambridge University Press, Cambridge)
15.
HillierBPennAHansonJGrajewskiTXuJ, 1993, “Natural movement: Or configuration and attraction in urban pedestrian movement”Environment and Planning B: Planning and Design2029–66
16.
JoeBSimpsonR B, 1987, “Corrections to Lee's Visibility Polygon Algorithm”BIT27458–473
17.
KeilJ M, 1985, “Decomposing a polygon into simpler components”SIAM Journal on Computing14799–817
18.
LeeD T, 1983, “Visibility of a simple polygon”Computer Vision, Graphics and Image Processing22207–221
19.
MarkusT, 1993Buildings and Power (Routledge, London)
20.
O'RourkeJ, 1987Art Gallery Theorems and Algorithms (Oxford University Press, Oxford)
21.
PeatrossF DPeponisJ, 1995, “Space, education and socialization”Journal of Architectural and Planning Research12366–385
22.
PennA, 1997, “The space of innovation: Interaction and communication in the work environment”, in First International Space Syntax Symposium Proceedings (UCL Press, London) pp 12.1–12.24
23.
PeponisJHadjinikolaouELivieratosCFatourosD A, 1989, “The spatial core of urban culture”Ekistics334–33543–55
24.
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
25.
PeponisJZimringCChoiY C, 1990, “Finding the building in wayfinding”Environment and Behavior22555–590
26.
SlavikP, 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, New York) pp 435–439
27.
StonorT, 1997, “Making space: The use of space syntax in design”, in First International Space Syntax Symposium Proceedings (UCL Press, London) page 3.1
28.
SuriS, 1990, “On some link distance problems in a simple polygon”IEEE Transactions on Robotics and Automation6(1) 108–113
29.
SuriS, 1997, “Polygons”, in Handbook of Computational Geometry Eds GoodmanJ EO'RourkeJ (CRC Press, New York) pp 429–444
