Reputation: 943
Is there any existing Bentley-Ottmann Algorithm Implementation/library in C# or Java?
Upvotes: 9
Views: 6673
Reputation: 1
The implmentation at softsurfer.com is the Shamos-Hoey algorithm to decide if there is at least one intersection. And, if one is found, it stops. The code at the reference is for testing if a polygon is simple.
Upvotes: 0
Reputation: 236114
Here is a Java implementation of the Bentley-Ottman algorithm
Upvotes: 1
Reputation: 51
Here is at least a C++ implementation (including description): http://softsurfer.com/Archive/algorithm_0108/algorithm_0108.htm
Upvotes: 4