nt B2[i] so B1[i]<=0 means no new connections allowed for point i ,so point i is deleted from B1, B2 updated accordingly.
Initialization:
B1: max number of connections x number of points
B2: all the points
B3: nothing (well null or something, need to create the branch)
Algo:
Get first point in B2, get his allowed number of connections N in B1, find N closest points in B2, create lines in B3, update B2 accordingly. Erase points with max connections (including the first point)
Next
Stop when no points available
At end of loop, B3 stores the created lines.
…
rom two surface offsets. I did a merge list to create a pattern from an wavy surface. I obtained several surfaces made of two toggle boolean.
Capture%20d%E2%80%99e%CC%81cran%202016-05-18%20a%CC%80%2016.26.16.png
How can i simplify those surfaces (made of two surfaces)?
Capture%20d%E2%80%99e%CC%81cran%202016-05-18%20a%CC%80%2016.26.38.png
Also, how can i link the two offset surfaces in a closed volume?
Thank you guys!
Best,
Rémy…
d files have surface divided into rectangular grid, I want that grid hexagonal SO THAT I CAN ATTACH MY HEXAGONAL GEOMETRY IN IT.Hexagon Pattern.3dm,,,,Hexagonal Pattern.ghx…
I have a database with about 80 tables on it, so i wanna connect to the database, make 5/6 different queries, extract the info and use it as an input to grasshopper.