Space Syntax

Comment

Comment by Federico Secci on May 25, 2016 at 9:07am

I apologise in advance for my poor English. Is it possible with space syntax to make 2D/3D visibility analysis? (I rode about the isovist bubble)

Comment by Pirouz Nourian on May 13, 2016 at 4:34am

Hello Mehrnoosh, 

The problem with your file is that the configuration you are trying to realize as a plan layout is not planar. That means there can be no drawing of your configuration graph on a piece of paper without its edges (links) crossing each other. That is not a software issue, but a theoretical limitation. If you want to get a result from the methods, you need to remove a few links so that the graph becomes a planar graph. 

Comment by mehrnoosh_arc on May 7, 2016 at 8:45am

hello;
firstly , thanks alot for this helpful plugin.
i'm having a problem with Triangulate component that show Error:1.Solution exception:value cannot be null. but i can't solve it.
please helpe me.

SYNTAZTIC_NewVersion_PublicRelease_0.2.7.gh

SYNTACTIC_NewVersion_sample_2.7.3dm

Comment by Arindra Januari on May 2, 2016 at 7:12am

Hi Pirouz,

thank you so much for your quick answer! I really appreciate it. :)

Comment by Pirouz Nourian on May 2, 2016 at 3:40am

Hi Arindra, 

The measure Entropy is newer than the rest in our implementation. I hereby explain it (from my PhD dissertation):

Entropy values, as described in (Hillier & Hanson, The Social Logic of Space, 1984) and specified in (Turner A. , “Depthmap: A Program to Perform Visibility Graph Analysis, 2007), intuitively describe the difficulty of getting to other spaces from a certain space. In other words, the higher the entropy value, the more difficult it is to reach other spaces from that space and vice-versa. We compute the spatial entropy of the   node as  using the  point depth set:

(11)

 “The term  is the maximum depth from vertex  and  is the frequency of point depth *d* from the vertex” (ibid). Technically, we compute it using the function below, which itself uses some outputs and by-products from previous calculations:

Algorithm 4: Entropy Computation

Given the graph  (adjacency lists), Depths  as List of List of integer, DepthMap as Dictionary of integer   Initialize Entropies as List(double) For node as integer in range [0, |V|) integer How_Many_of_D=0 double S_node=0 For depth as integer in range [1, Depths[node].Max()] How_Many_of_D=DepthMap.Branch[(node,depth)].Count double frequency= How_Many_of_D/|V| S_node = S_node - frequency * Math.Log(frequency, 2) Next Entropies [node] = S_node Next

Comment by Arindra Januari on May 1, 2016 at 4:56am

Hey Pirouz,

I would like to ask about the entrophy parameter that is connected with the integration. In the paper 'designing with space syntax' there's explanation about the formula that you used to get the measurement for each parameter but how about the entrophy? I'd really love to know where do the numbers come from. Thanks in advance! 

Comment by Tim on April 25, 2016 at 4:13am

Also text is very important, if possible to output it as a text that would be most useful.

Comment by Tim on April 25, 2016 at 4:11am

Please do if you have time, if not with code, I could rearrange intersecting bubbles in AI if have baked geometry. Meshes are ok too, I can convert them to hatches with Human or FabTools plugins.

Comment by Pirouz Nourian on April 25, 2016 at 2:59am

Yes Tim, that is the component I meant. Indeed it cannot do the job as is because the Justified Graph Component doesn't have an output. That component has one of the biggest chunks of code... Let me see if I can rewrite it to get an output from it. 

Comment by Tim on April 25, 2016 at 2:27am

If yes, I just checked it, maybe I haven't gotten it yet, but how does it bake justified graph (it doesn't even have any outputs, which is the problem)

• ‹ Previous
• 1
• …
• 15
• 16
• 17
• 18
• 19
• …
• 39
• Next ›
• Page