Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
vg_head
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
5 ms
·
1.
▲
by
vg_head
6mo ago
Good looking! I didn't get to watch the video or look at docs in depth, but do the results trace back to the location of the answers in a document? Let's say it finds an answer in a PDF, and I'd like to know where in that PDF
2.
▲
by
vg_head
2y ago
Of course it's not optimal, it was simply a pragmatic trade-off. This wasn't the only case with lots of paths, and the divide-and-conquer approach improved the runtime performance substantially on all of them. What you are proposi
3.
▲
by
vg_head
2y ago
I didn't get to simplify the code further unfortunately. I could have, but I was running very tight on time with other things. In fact the running-in-production-version is even worse than what I've posted, I just went with what wo
4.
▲
by
vg_head
2y ago
> This seem like more of a surprise to the author than it was for me. The bigger surprise for me was that the path builder is slower than doing divide and conquer, given that it's optimized for doing union on everything. > Someti
5.
▲
Unintuitive optimization for performing paths union
(minus-ze.ro)
27 points
by
vg_head
2y ago
|
8 comments
6.
▲
by
vg_head
2y ago
I'm curious if there's overlap between this and P System: https://en.m.wikipedia.org/wiki/P_system
7.
▲
by
vg_head
2y ago
Very interesting. Honestly I don't know much about hinting, but I suspect the whole shaping stack that Slug supports: > kerning, ligature replacement, combining diacritical mark placement, and character composition. Slug also suppo
8.
▲
by
vg_head
2y ago
> Explain to me exactly why, other than 'I guess someone already implemented some kind of basic version of it' that you would have to have custom CPU code rendering glyphs instead of a shader rendering SDF's like literally
9.
▲
by
vg_head
2y ago
It's more about the nature of the problem, not that you can't do it in shaders. After all, I think you can do pretty much anything in shaders if you try hard enough. Even if you already have a GPU renderer for glyphs and any other
10.
▲
by
vg_head
2y ago
One other thing that is a bit weird about SVG is how some parts don't feel tightly integrated. For example, paths and SMIL events have their own syntax. And a lot of APIs related to them seem to be either abandoned, deprecated, or just
11.
▲
by
vg_head
2y ago
I've been following VGC for some time now, and I definitely think it's the coolest project of its kind right now! I sincerely hope it will be widely used.
12.
▲
by
vg_head
2y ago
I am too young to have lived through that era, but it seems to me like tweening hints were all integrated in the editing UI? That is of course much more useful. But the scope of my post was not at all to do something better than Flash, or t
13.
▲
by
vg_head
2y ago
I haven't looked too in depth into it, but it looks closer to what I described? It doesn’t look like the method the other commenter was describing. Also, keep in mind that I did not mean to implement something better than what Flash di
14.
▲
by
vg_head
2y ago
Always open to suggestions! I don't claim this to be any kind of novel method, or even a "good method". It's just an explanation of one way to do it, which is (IMO) relatively easy to understand, and implement. When rese
15.
▲
Morphing Arbitrary Paths in SVG
(minus-ze.ro)
87 points
by
vg_head
2y ago
|
16 comments
16.
▲
Using STM for Modular Concurrency: An Industrial Experience Report (2020) [video]
(youtube.com)
1 points
by
vg_head
2y ago
|
0 comments
17.
▲
by
vg_head
2y ago
Yes, at least that would be a great start for me.
18.
▲
by
vg_head
2y ago
This is exactly the kind of tool I would want as well. I was surprised nothing like this exists already.
19.
▲
Morphing Arbitrary Paths in SVG
(minus-ze.ro)
4 points
by
vg_head
2y ago
|
0 comments
20.
▲
The Links Programming Language
(links-lang.org)
2 points
by
vg_head
2y ago
|
0 comments
21.
▲
by
vg_head
2y ago
I've just finished working on a dead simple OCR tool: https://txtfromimg.com I know there are plenty of alternatives, but I personally benefit a lot more from a dead simple web page, that does everything locally. It also he
22.
▲
Beatrice: A tagless, dependently typed, self-aware programming language
(hirrolot.github.io)
22 points
by
vg_head
2y ago
|
2 comments
23.
▲
by
vg_head
2y ago
Thank you! Looking forward to your research.
24.
▲
by
vg_head
2y ago
Nice project! I see the tool can already handle polylines, so in theory you should be able to add support for Bézier curves and arcs by converting them to polylines. But of course, the devil is usually in the details. I hope it works out.
25.
▲
Flattening Bézier Curves and Arcs
(minus-ze.ro)
89 points
by
vg_head
2y ago
|
18 comments
26.
▲
by
vg_head
2y ago
There's also Software-Transactional Memory in which deadlocks are pretty much impossible. Though it only really works in languages that can properly track side effects, like Haskell's monads.
27.
▲
Tiny Compiler – Writing a Compiler in a Weekend
(github.com)
4 points
by
vg_head
3y ago
|
1 comments
28.
▲
by
vg_head
3y ago
My experience with parsing undocumented binary formats is with Skia's skp files. Unfortunately they don’t publish any docs regarding the format. Instead I relied on their source code (which is very convoluted), and in that process I di
29.
▲
Mesh Colours for Gradient Meshes (2021) [pdf]
(cs.rug.nl)
2 points
by
vg_head
4y ago
|
0 comments
30.
▲
Drawing an elliptical arc using polylines, quadratic or cubic Béziers (2003) [pdf]
(tech.brookes.ac.uk)
1 points
by
vg_head
4y ago
|
0 comments
More ›