search

ideasman42 / isect_segments-bentley_ottmann

BentleyOttmann sweep-line implementation (for finding all intersections in a set of line segments)
MIT License
91 stars 40 forks source link

Rust port #10

Open urschrei opened 6 years ago

urschrei commented 6 years ago

We (the rust-geo developers) need a B–O implementation for checking Polygon self-intersection (in order to do validity checks). The Dan Sunday version at geomalgorithms would probably be enough (since we don't need to identify the intersections in the the first instance) intially, but your version is a lot more comprehensive and well-tested. Would you be interested in helping to port it to Rust? There's no particular urgency, and it'd be great to have a high-quality implementation in the library.

ideasman42 commented 6 years ago

Hi, It would be nice to see a Rust port, though I don't have time for this at the moment.

Something that makes this more work is having to use a custom tree structure, since I don't think Rusts binary tree can be used as-is, since the comparison function needs to referencing a changing sweepline value.

urschrei commented 6 years ago

I think everyone is is busy at the moment, so no worries. Thanks for the pointer about the tree structure – I'll do some digging when I get the chance.