Most efficient way to determine if points in a list is inside a closed curve?

image
Using Geometry.DoesIntersect takes a lot of time to process. Is there a faster way to do this?

might be able to simplfy this well upstream in the graph, but I’d need to see the whole workflow (so include the source files and the dyn on the post).

here:
1.dyn (11.4 KB)


I had change it to Geometry.Intersect to directly get the points instead. I am using this on a large topo with a lot of points. see attached image.

Those are two things I do not have, and don’t really know where to acquire. Can you post them here (or another web source if they are too big to share in the forum)?

Point.Project can do the trick

1 Like

Thanks @Akli.baliche, never knew there was a node for this.