I’m running into the issue where my rooms aren’t rectangles and the bounding box node idealizes my rooms into such. That means a specific point on my curve may contain several rooms (which I don’t want).
How do I test a point within a solid? I can get solid geometry out of my room, which preserves the shapes of my room but then how can I test a point within the solid.
You can make a bunch of points on the curve and then use “Geometry.DoesIntersect” to test if those points lie inside the solid. I believe it should be a faster method than straight away intersection, because it doesn’t try to calculate any intersection results. Alternatively you could try getting the solid centroid ( there’s a node with a similar name) and get the closest point to it that lies on the curve with the incredibly useful “Geometry.ClosestPointTo” node. Finally in both cases you can then get the parameter of that point on the curve, zip the list of room elements and parameters, sort and get only the elements.
I think I saw a similar example just recently, but I can’t seem to find it, so here’s my quick take on this:
I’m having a bit of an issue with William’s renumbering graph - in particular I can’t seem to get the List.FilterByBoolMask node to operate as a function for a List.Map. Image and definition attached in case anyone can advise.
