How to Reverse a "One to Many" relational tables

Hi there,

I've been lurking on these forums for a while and have found reading several of the discussions useful for solving some of my geometry problems. I've got a problem that I'm scratching my head over and would appreciate any thoughts.

I have a set of tessellated panels and edges with unique references. In general, panels share edges with other panels such that an edge borders two panels. In terms of a sample data structure to illustrate the point, it might look like this.

{0}

{1}

{2}

{3}

{4}

{5}

Where path represents a panel reference, and item a member reference: (e.g. {0;A} is panel 0, member A. Note the above is basically a 6 triangle umbrella arrangement (hexagon split into 6 triangles by center):

I'm looking to return a tree with:

-all unique list references in the set above,

-containing sub-set references to paths from whence they came.

In my example, this would be:

{A}

{B}

{C}

{D}

{E}

{F}

{G}

{H}

{I}

{J}

{K}

{L}

Member%20Panel%20References.gh

Replies to This Discussion

Permalink Reply by martyn hogg on July 14, 2015 at 4:57pm

You sound like a database man!

I'm not sure if what you want to do can be done simply with GH tree components; it would probably need some sort of code.

I think the Sandbox tools do something similar to what you are trying to do... basically you are trying to get the topology of a line / surface network. Sandbox has a tool called Brep Topology Edge. This can output all face indices belonging to an edge and all edge indices belonging to a face.

Is that what you are after?

Attachments: