vger

I think the issue with slug is that it requires a fair amount of pre-computation. So it's great for its use case: rendering glyphs, especially on surfaces in games. I do something a bit like slug, but I'm sure slower, since slug is very optimized. (https://github.com/audulus/vger)

Seems like you're thinking of precomputed SDFs that are stored in a texture. They don't have to be :) (for example, my little library: https://github.com/audulus/vger)

I did vector graphics using SDFs in this library (https://github.com/audulus/vger). Works pretty well for my uses which are rendering dynamic UIs, not rendering SVGs. But I can still do some pretty gnarly path fills!

Why is that? Glyphs can be cached in a texture. That's what nanovg does and it works quite well. That's what my little library does too (https://github.com/audulus/vger)

I've done a library for vector graphics on the GPU which works pretty well for my uses: https://github.com/audulus/vger and a rust version: https://github.com/audulus/vger-rs (which powers my rust GUI library: https://github.com/audulus/rui) Here's the approach for rendering path fills. From the readme: > The bezier path fill case is somewhat original. To avoid having to solve quadratic equations (which has numerical issues), the fragment function uses a sort-of reverse Loop-Blinn. To determine if a point is inside or outside, vger tests against the lines formed between the endpoints of each bezier curve, flipping inside/outside for each intersection with a +x ray from the point. Then vger tests the point against the area between the bezier segment and the line, flipping inside/outside again if inside. This avoids the pre-computation of L