Johan Larsson

Hm, you're right, some kind of check would probably be reasonable.

Great to see, @poeadam, and thank you for your support! It's definitely time I got around to take another look at this. If I get some time over in the...

Yes, this is basically related to #67, and I'm definitely open to alternatives to the least-squares function that exists. It is, howver, often impossible to plot all intersections, so it's...

The part in the code where this is computed is here: https://github.com/jolars/eulerr/blob/625d7ff8c82f562da6518b7b9e07f31d88248b39/src/optim_final.cpp#L125-L131 So adding new loss functions should be quite easy.

No, unfortunately not. I don't think patterns are a good idea in general due to Moiré effects, but I'd accept a pull request.

Thanks for noticing this! I have edited my answer there so that it should work properly now. Since the package no longer uses lattice, the `c.trellis()` method won't work any...

No good way at the moment I'm afraid. But it shouldn't be hard to implement, as the following silly hack proves: ```r m

@Cumol, unfortunately not at the moment. But I agree that this would be a useful option.

eulerr is by the way already using a modification of the ggrepel algorithm for overlapping labels, but it works so-so.

There is certainly work to be done regarding the label repulsion features of the package. The current code for this is imported from the [ggrepel package](https://github.com/slowkow/ggrepel), but I think it...