Finding the neighboring cell?

Replies to This Discussion

Permalink Reply by Ali Tabatabai on November 29, 2010 at 4:01pm

thanks for the reply...

Actually I'm interested in finding the solution for numbering every cell and identifying its neighbors in one shot. What we are doing at the moment is analyzing the entire list one by one... What if we could number all cells and identify it's neighbors (the way you do) at once.

... at the moment we have a regular grid generated from one main surface!
Imagine if each cell is generated randomly (maybe all cells are not occupied...) and the surface component is multiple individual surfaces.

... now, how can we number and ID-tag each cell and identify its neighbors in one session?

cell 0 - (C1 C2 C8)
cell 1 - (C0 C7)
cell 2 - (C0 C4)
...
cell 10 - (C5 C6 C8 C9)

etc.

Best
//A

Permalink Reply by taz on November 29, 2010 at 6:39pm

Argh... I've got the general quad case, but let me clean it up a bit and see if it will work for your case.

Permalink Reply by taz on November 29, 2010 at 8:07pm

I think this works for what you're describing. I'd like to make it work for N-gons...

Attachments:

• idAll.ghx, 261 KB

Permalink Reply by Ali Tabatabai on November 30, 2010 at 3:25am

...nice one, it works just fine here;o)

//A

Permalink Reply by taz on November 29, 2010 at 8:43pm

Ever so close... Need to tweak the final labeling.

Permalink Reply by Ali Tabatabai on November 30, 2010 at 3:26am

...always one step ahead;o) I like your style taz...

//A

Permalink Reply by taz on December 1, 2010 at 8:55pm

Non-planar N-gon magic! The definition is getting cleaner.

Permalink Reply by taz on December 1, 2010 at 10:28pm

Multi-BRep N-gon Magic! Definition is messy again.

Permalink Reply by Ali Tabatabai on December 7, 2010 at 8:24am

Hi taz,

Could you please post this one as well! Somehow I don't get the same result as you get...

Thanks
//A

Permalink Reply by Jiri Vraj on April 16, 2012 at 9:36am

Hi taz,

I most appreciate your work and it is helping me a lot. But now I'm stuck for a while on a following problem, that I believe you could help me with, had you sent the last version of what you were working on here above.

My present problem is:
I have your definition that you posted in this thread on 24/11 2010. And I need it to find adjacents not just for a single -- selected -- face, but for all the faces of a polysurface (brep). In other words -- I try to make it work not for a single "value" but for an "array". Eventually, I'm looking for a tree of values, where on each branch there would be a list of faces adjacent to one, whom path it bears.

Any response would be of an immense help, as this is slightly beyond the limits of my GH-abilities... Thank you, guys!

Smakoun

Permalink Reply by taz on April 16, 2012 at 3:07pm

I have to go back and find the completed definition and see if it still works...

The work was continued in another discussion where I needed some help.  This discussion may be useful:

http://www.grasshopper3d.com/forum/topics/q-specific-pairings-from

Permalink Reply by Jiri Vraj on April 17, 2012 at 2:45am

Level of that discussion you linked is too high. I have absolutely no knowledge of scripting in any programming language.

If you find that definition, it would be just perfect... Otherwise I will bother people by founding a new thread, perhaps :).

• ‹ Previous
• 1
• 2
• 3
• 4
• 5
• Next ›
• Page