Definition: Closest Planar Cap for Non-Planar Hole + Min BB Lowest Face.gh (2.7 MB)
(green = non-planar, red = planar)
My definition will work with a list of curves and a single plane as input or with matching lists of curves and planes as input.
In order to speed it up, I dispatch planar and non-planar curve input and process them separately, because the planar ones obviously don’t need to be planarized.
Also, the C# bounding box script outputs planes, not boxes, when fed planar input, and feeding planes, into a
volume component in my sorting group made it slow to a crawl - 26 seconds for 3 boxes and 14 planes!
Because of the dispatch, my output is two pairs of lists that I can’t figure out how to reliably recombine into the same order as the two input lists. Is there a way to do that? Could I insert nulls into both dispatched lists to keep them in order? Something else? How do I do it?