I have a bunch of curves that I need to either sort or join to create planar edge surfaces with. Any idea whether they can efficiently be joined based on proximity or whether this should be done based on tree data structure?
E: To be more clear, I need to close the open joints between the hexagons at the intersection of the filleted corners.
@Jakinta I would like to have the smaller filleted curves together to get the in-between of the hexagons. So with that I mean the small 3 corner joints.
@submillimetre, I tried joining the curves and used Wombat’s join curve with tolerance component, but that didn’t help.
@Jakinta Thanks, that’s it.
I noticed that creating edge surfaces on these is quite a heavy operation, so the next step is going to be orienting one surface to all of the applicable point groups.