Andrew Hunter

Ah, yes, I thought there might still be cases where the algorithm fails. I've gone for a new approach and implemented the algorithm from Graphics Gems: this should be much...

Think I fixed the issues I found with the new algorithm, so I believe the latest version on the 0.7 branch should be very much more reliable than earlier versions....

Ah: this was actually only two iterations away from succeeding. I've replaced the solver with one that doesn't produce an error even where it doesn't converge and increased the number...

`future_sync()` and `future_desync()` had a function with the signature `for BoxFuture`)

I believe the fix to remove the need to use a boxed future is to add a trait like this: ```Rust pub trait IntoBoxFuture { fn make_box(self, val: &'a mut...

ecfaaad2ca61b219e9e5b637102d3d022a76378d fixes this by going back to using `BoxFuture`. I'm going to leave this open for the moment as I'd quite like to figure out a way to get the...

Ah, thanks for letting me know: I want to keep everything working with stable so this probably won't make it in until it's ready, but this definitely looks like something...

Yes: the algorithm converts all paths to clockwise paths before it performs any of the arithmetic operations, which simplifies the algorithm and also better deals with overlapping curves. The final...

There's a function for this: `walk_curve_evenly()`. The `EvenWalkIterator` it returns has a `vary_by()` function that can be used to change the size of the following steps, so that can be...

Ah, sorry for the delay in responding. There's actually a circle subtraction test in the test suite (`create_doughnut()` and friends) so I *think* the algorithm should work. The output should...