I tried that, it doesn't change the result. I will probably have to break down polylines to their primitives (arcs lines) and use inters (with fuzz) of both endpoints, and for arcs both endpoints + centerpoint.
But this might be slow for large drawings and i would prefer not to explode the polylines.
Edit: i don't need to break them down but for lines i could compute if the points are colinear, this can be computed for arcs also, but will have to do this in c++ i guess, however i could do some xy sorting first.
Are there no functions that return me if a point is on a (sub)segment ?