Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
geometryguy
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
4 ms
·
1.
▲
by
geometryguy
4y ago
You can compute Voronoi diagrams for each pixel of an image with distance fields in O(N) where N is the number of pixels. This is faster than the shown jump flooding algorithm, which is only O(N log N). Here is an example for a CPU-based i