Skip to main content
fweth's user avatar
fweth's user avatar
fweth's user avatar
fweth
  • Member for 6 years, 8 months
  • Last seen more than a month ago
  • Vienna
awarded
accepted
revised
`transp` In Agda
deleted 9 characters in body
Loading…
revised
`transp` In Agda
added 168 characters in body
Loading…
revised
`transp` In Agda
added 131 characters in body
Loading…
revised
`transp` In Agda
added 131 characters in body
Loading…
asked
Loading…
awarded
comment
Fast Algorithm To Compute Gradient Of Gaussian Blur
Ah, yes, that should do. Thank you! (If you want, feel free to share this as answer.)
revised
Loading…
comment
Fast Algorithm To Compute Gradient Of Gaussian Blur
I should have specified that I want to look hat very large radii, not like $r=3$ as in this linked question but more like $r=100$. Which doesn't mean that I want to look at $10,000$ samples, but I look for a nice way to approximate the result from fewer samples.
comment
Fast Algorithm To Compute Gradient Of Gaussian Blur
I mean that I want no steps, even at high resolution. The reason for this is that I use the result as some kind of bump map, which reflects a texture, so small discontinuities would be far more visible that if I look only at the blurred image. Will look at your link, many thanks!
Loading…
awarded
comment
Efficient Way To Compute Points Where Convolution Equals Zero
Wow, thanks so much for the comprehensive answer! I'll sure need a few days to work through all of this, but really appreciate it!
comment
Efficient Way To Compute Points Where Convolution Equals Zero
Rotations would be interesting but translation are fine for now. Ideally it would work with SVG paths, but pixels are fine as well.
revised
Loading…
comment
Efficient Way To Compute Points Where Convolution Equals Zero
Convolution, so what I want is $\{p\in\mathbf{R}^2:\forall k\in K:p+k\in L\}$, sorry, I now realize that this a nicer formulation.