Bentley-Ottmann Algorithm Implementation

Question

Is there any existing Bentley-Ottmann Algorithm Implementation/library in C# or Java?

Subtraction

take a look at here ...#4490831 – Zebra

Did you ever get this fully working? The Java implementation link is dead now. – Footpoundal

What output are you expecting from the implementation? – Woodford

Not C# or Java, but heres a single-file implementation you could port https://mcmap.net/q/683068/-is-there-a-robust-c-implementation-of-the-bentley-ottmann-algorithm-closed – Woodford

Has anyone sighted a public C# implementation yet? Thank you! – Farfamed

Answer 1

Here is a Java implementation of the Bentley-Ottman algorithm

Lynsey

Java link is still available here: web.archive.org/web/20040329071207/http://www.solyanik.com/… – Woodford

Answer 2

Here is at least a C++ implementation (including description): http://softsurfer.com/Archive/algorithm_0108/algorithm_0108.htm

Campanology

While technically this is a bentley-ottmann implementation, its only returning true/false. Not finding all intersection points. – Woodford

Answer 3

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.

Salespeople

This does not provide an answer to the question. Once you have sufficient reputation you will be able to comment on any post; instead, provide answers that don't require clarification from the asker. - From Review – Naos

I was the author of that code, and that is my website. The website has been converted to a book, and this code is no longer available online, As for the code you are discussing, it was for the Shamos-Hoey algorithm which historically preceded the Bentley-Ottman. Shamos-Hoey was for testing if a polygon is simple, so it only returns true or false. It stops as soon as it finds one intersection. – Salespeople