Sure. Here’s a breakout of the relevant portion of the graph.
Take a room outline, find its corners, and connect all points with lines.
Then intersect these lines with a surface created by the points (using surface by patch doesn’t always return correct results - bypoints seems to be more reliable).
And, finally, get the intersection of the two lists of lines to find only the lines that fall completely within the room!
The graph;
and the DYN; SetIntersection for Curves.dyn (14.8 KB)
I found a way to manage the intersection of the strings and find the indices in Python which made a yuge difference in speed. There are easily 80,000 to 100,000 lines needing to be compared at times!