Create Union algorithm trait
#81
Comments
|
Would this be a good issue for a new contributor to work on? I could really use polygon union for one of my projects, though I'd have to study up on potential algorithms. |
|
@acfoltzer Absolutely! Some ideas have already been kicked around in #80. In short, it requires a lot of other things to be in place – the implementation of the binary search tree (Bentley-Ottmann needs a tree that can update its sweepline value, see ideasman42/isect_segments-bentley_ottmann#10) and priority queue that @shterrett refers to remain open questions, though as I mention there's now an excellent DCEL implementation available in Spade. Progress on any aspect of this would be great. It's also worth looking at the clipping crate, depending on what kind of polygons you're working with. It's less general, but may be suitable for your use case. |
81: Remove authors manifest field r=nyurik,urschrei a=lnicola - [x] I agree to follow the project's [code of conduct](https://github.com/georust/geo/blob/master/CODE_OF_CONDUCT.md). - [ ] I added an entry to `CHANGES.md` if knowledge of this change could be valuable to users. --- r? `@nyurik` Co-authored-by: Laurențiu Nicola <lnicola@dend.ro>
|
Closed by #835! |
Similar to #80
The text was updated successfully, but these errors were encountered: