Difference between revisions of "Angular choice (Space Syntax)"
From Design Computation
(Created page with "Category:Space Syntax Choice is calculated by counting the number of times each street segment falls on the shortest path between all pairs of segments within a selected...") |
|||
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
[[Category:Space Syntax]] | [[Category:Space Syntax]] | ||
| − | Choice is calculated by counting the number of times each street segment falls on the shortest path between all pairs of segments within a selected distance (termed | + | Choice is calculated by counting the number of times each street segment falls on the shortest path between all pairs of segments within a selected distance (termed ‘[[radius (Space Syntax)]]’). The ‘shortest path’ refers to the path of least angular deviation (namely, the straightest route) through the system. (See: [[segment analysis (Space Syntax)]]) |
=Cross-References= | =Cross-References= | ||
| Line 9: | Line 9: | ||
[http://otp.spacesyntax.net/glossary/ Space Syntax Glossary] | [http://otp.spacesyntax.net/glossary/ Space Syntax Glossary] | ||
| − | [http://spacesyntax.tudelft.nl/media/Long%20papers%20I/hillieriida.pdf Hillier, B. | + | [http://spacesyntax.tudelft.nl/media/Long%20papers%20I/hillieriida.pdf Hillier , B. & Iida, S. (2005), Network and psychological effects in urban movement, In: A.G. Cohn and D.M. Mark (Eds.): COSIT 2005, LNCS 3693, pp. 475] |
Latest revision as of 11:45, 6 October 2016
Choice is calculated by counting the number of times each street segment falls on the shortest path between all pairs of segments within a selected distance (termed ‘radius (Space Syntax)’). The ‘shortest path’ refers to the path of least angular deviation (namely, the straightest route) through the system. (See: segment analysis (Space Syntax))
