I’m trying to create an efficient cluster that will sort the inside (concave) and outside (convex) corners of planar surface edges.
I found a definition which will work for planar surface edges and planar polylines that are parallel to the XY plane, at the end of this thread:
InternalCross.gh (8.0 KB)
I can easily make this definition work for planar surface edges on the XZ and YZ plane just by swapping out one unit vector component, but that would mean I’d have to use three different clusters, and I’d have to sort the input surfaces, and it’d still only work on surfaces and polylines that are parallel to the orthogonal planes.
Any suggestions for how to make a more universal definition that works with any planar surface or polyline, in any orientation?