points accesibility test help ¡¡¡¡

For my PhD thesis I´m making a connectivity / accesibility test of a certain urban area streets.

i have a problem with the accesibility test, cause i need to know wich points of the grids have direct connections with the others, as the image example

Any idea, to how finally get a list with all the points and their direct accesibility correspondence?????

Thanks ¡¡¡¡¡¡¡¡¡¡¡

Ps: here are the 3dm & Gh files

PhD_Connectivity_Test.3dm

PhD_Connectivity_Test.gh

Replies to This Discussion

Permalink Reply by newy011 on January 3, 2013 at 4:15pm

Is it parametric or did he add those numbers manually; what i want to know is, if numerous different point arrays are processed, say by different people running the GH definition on their own computers each with their own unique point array, will the GH definition need to be manually adjusted every time to deal with a new iteration or does it work like a script driven by rules, i.e one size (or 'solution') fits all, like any good piece of programming?

Permalink Reply by djordje on January 3, 2013 at 5:05pm

I doubt it's a good piece of programming, as only Grasshopper regular components were used, and these already mentioned solutions are probably far better.
Still you can try on your own to see the results on different example. Like in here:

http://www.dailymotion.com/video/xwg2al_points-accesibility_tech

Point marking depends on the order by which point were primarily assigned.

Permalink Reply by David Stasiuk on January 3, 2013 at 3:13pm

Surprised this hasn't been referred yet: http://www.grasshopper3d.com/profiles/blogs/topologizer-network-cle...

Permalink Reply by Chris Hanley on January 3, 2013 at 4:25pm

wow! that's great! Thanks everyone for posting a few different approaches. I learned a bit more about a few native GH components, and discovered a few new approaches using plug-ins!

As far as I can see, this problem can be solved with;

1- native GH components, (Cull Duplicates)

2- SpiderWeb, (Graph From Lines)

3- Starling, (pmConnectedVertices)

4- Topologizer

Thanks all!

Permalink Reply by jorge sainz de aja on January 4, 2013 at 4:46am

Thank you all for working on this, really appreciate it

and sorry for not being very active in the conversation, but the last call of this course for the thesis defense is about to arrive, and I have lots of workload

once again, thank you all