Grasshopper

algorithmic modeling for Rhino

Good morning,


While this is certainly not a Grasshopper question I reckon that people into parametric design also have a knack for picking up funky algorithms.

Do anyone know if there is a know algorithm for sorting connectivity between nodes. More specific to find the most efficient node layout without connection overlaps (or the fewest). For an example:


I'm thinking of using it to sort/evaluate architectural programs, but don't even know what to look for.


/Cheers


Views: 1156

Replies to This Discussion

there is a plugin for rhino called point set reconstruction. in it is a tool called "network". try that out
yeah, unfortunately it deals with finding the closest neighbours, where I want to relocate the point to eliminate intersections. After googling around for a couple of hours I can't even find anyone that tried.. maybe it's just more or less impossible
delaunay triangulation? that will get you part of the way there perhaps...
i now understand what you are trying to do. i did a project where i scripted springs to distribute program in 3d based on programmatic relationships/factors. see the little test video below. it was done in maya but i assume if kangaroo lets you create springs between elements then you could get the same effect in grasshopper. in my case intersecting lines was not a issue because the lines(springs) represented a the relationship from one element to another (like adjacency factor to each other as well as site factors).



-robert
Attachments:
Hi Mattias

According to your drawing I can imagine a very complex problem, and I think a Front advancing Technique, will probably not solve it.

I see 2 options:
-relaxing the whole network (but u'll need to take care of the boundary) with an repulsion-atraction iteration. (force-based diagrams are very used to visualize graphs)
-if the network is really messy,( and the first option gets quickly stucked, or bugs) I guess you could evaluate better results (probably not the best) throught GA .

but probably I would consider to especify more clearly what kind of network topology you have,
I mean, maybe if you have a large drwaing.. you can describe better the problem to solve.
I'd definitely start with option 1. There's no guarantee that it will solve link crossings that could have been solved, but it tends to give good results.

I attached three videos I made years ago (probably in 2005) that show a very naive force-density network relaxation.

All nodes repel each other, connected nodes also attract each other.

--
David Rutten
david@mcneel.com
Poprad, Slovakia
Attachments:
Kangaroo could be used for this sort of approach.
Beta launch later today.
kangaroophysics.com
Amazing news Daniel

Cool stuff David

Interesting theme all!
"Beta launch later today."
yeah.!
Great expectations
Yummy holydays!
Yay, exicited as I am about Kangaroo (which I am) I'm starting to realize just how involved this problem is. I'll look into all your suggestions over easter.

Happy holidays!
Any ideas of how can we get this dynamic network with kangaroo? It seems quite complicated to create dynamic distance constraints . David, can you please share your network relaxation definitions?

RSS

About

Translate

Search

Photos

  • Add Photos
  • View All

Videos

  • Add Videos
  • View All

© 2024   Created by Scott Davidson.   Powered by

Badges  |  Report an Issue  |  Terms of Service