Diamond graph (Space Syntax)
From Design Computation
Revision as of 16:45, 10 October 2016 by Pedro Gil (talk | contribs) (Created page with "Category:Space Syntax Diamond graph refers to a justified map in which there are k spaces at mean depth level, k/2 at one level above and below, k/4 at two levels above a...")
Diamond graph refers to a justified map in which there are k spaces at mean depth level, k/2 at one level above and below, k/4 at two levels above and below, and so on until there is one space at the shallowest (the root) and deepest points. (See: D-Value (Space Syntax))