Related to #15 - I had a few questions about some of the errors that are thrown and resilience to input data so I can do my best to clean the data up before passing it into the library.
- The README states that there should be no duplicate points or points lying exactly on any constrained edges. But are there any tolerances that should be adhered to? Eg are points that are 1e-15 distance apart acceptable (I assume no)?
- Is a winding order guaranteed for the results or do I need to check the winding order before constructing a polygon?
- I'm occasionally seeing the error "
Infinite loop: no further intersect after non-convex", but it's not exactly clear what this means. Is there a known graph configuration that will cause this error that I can try to avoid?
- Is the project resilient to adding the same constrained edge twice? What if it's added in the reverse order? eg adding [5, 2] and [2, 5]?
Thank you!
Related to #15 - I had a few questions about some of the errors that are thrown and resilience to input data so I can do my best to clean the data up before passing it into the library.
Infinite loop: no further intersect after non-convex", but it's not exactly clear what this means. Is there a known graph configuration that will cause this error that I can try to avoid?Thank you!