Difference between revisions of "Decay, of a justified graph (Space Syntax)"

From Design Computation
Jump to: navigation, search
 
Line 1: Line 1:
 
[[Category:Space Syntax]]
 
[[Category:Space Syntax]]
  
−
A b-type space is space with more than one link but which forms part of a connected sub-system in which the number of links is one less than the number of spaces, that is, a system which has the topological form of a tree. Such space cannot in itself be dead end space, but must be on the way to (and back from) at least one dead end space.
+
Decay of a justified graph is expressed by the function of depth decay, meaning the sum of the reciprocal of depth from the root node to each destination, where the depth can be weighted by a power function.
  
 
=Cross-References=
 
=Cross-References=

Latest revision as of 16:25, 10 October 2016


Decay of a justified graph is expressed by the function of depth decay, meaning the sum of the reciprocal of depth from the root node to each destination, where the depth can be weighted by a power function.

Cross-References

Recommended Reading

Space Syntax Glossary

Dalton, R. C. & Dalton, N. S. (2007) Applying Depth Decay Functions to Apace Syntax Network Graphs. Proceedings of 6th International Space Syntax Symposium, Istanbul. Pp.089-01-14

Retrieved from "http://wiki.designcomputation.org/home/index.php?title=Decay,_of_a_justified_graph_(Space_Syntax)&oldid=490"