Fast C# code to determine 2D point containment

[laurent_delrieu]

Hello
I think it will be good you learn the programming basics. There are surely some good tutorials.
From what I see you just copy without understanding. So I am not sure it is worth giving you a working program.
Try to reuse the scripts that are here. There are many so test them and find the one you need.

Curve.Contains Method too slow

As I understand it points should be selected based on inclusion in one (1) curve, and as soon as one point is part of (or inside) one curve, or area, it no longer has to be tested for in other curves(areas)? Is that correct? Anyway, I tested my idea in code, but the CurveCurve intersection method doesn’t return an array of intersecting points like some of the other methods do, so my strategy doesn’t work with this intersection method in code (see code far below, but the “res” will only contain …