Replies: 1 comment 1 reply
-
|
Noted, but unlikely. Sorry to disappoint. |
Beta Was this translation helpful? Give feedback.
1 reply
-
|
Understood, thanks for the reply. |
Beta Was this translation helpful? Give feedback.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
Hi, I'm not sure if Clipper internals would be suitable for this, but it would be nice to have a function in the form of
Which would report all of the intersections between any of the two segments in time less than O(n^2) where n=segments.Count (obviously only possible if intersection count is a lot less than n^2)
Beta Was this translation helpful? Give feedback.
All reactions