Does anyone have GH way of finding and identifying the neighboring cells? I'm sure a VB version is the more straight forward way, but I'm interested in a pure GH def. way...
I was trying to find it trough a intersection of curve and the neighbor cell, but I've got kind of lost...
Permalink Reply by to] on November 22, 2010 at 10:10am
Hi Ali
if you calculate the center-points of the surface-tiles (average the vertexpoints) you can sort them according their distance to the testpoint (centerpoint of test-tile). The first four are the one you are searching,....if you want all 8 tiles you can search for the equal corner points
I'm sorry... I cant get this one to work at all! could you please upload the file? or just explain 2 things: the 0.01 what is that? Also, I cant really define what is being culled at the end... the wire seems coming from the cull index!?!
//A
Permalink Reply by to] on November 22, 2010 at 6:25pm
the 0.01 is just for get rid of rounding errors
and yes i cull from the cull index component
to]
Permalink Reply by to] on November 23, 2010 at 2:16am
i forgot to mention the distance component is set to cross-reference
...another question!
How can we group the neighboring cells as a list? We are sorting them out from one cell at a time... but how can we make a set out of each cell and identify its neighbors as a list?
I was trying to replace the slider, but that didn't work out...