demofoxDec 29, 2022
If you've heard of monte carlo geometry processing and wondered what it's all about, give this a read!
In short, it's a way of interpolating data using random walks. An implementation looks quite a bit like ray marching an SDF, including needing to know the distance to the closest feature, from within a loop!
https://blog.demofox.org/2020/07/11/interpolating-data-over-arbitrary-shapes-with-laplaces-equation-and-walk-on-spheres/
Interpolating Data Over Arbitrary Shapes With Laplace’s Equation and Walk on Spheres

A very cool paper was accepted to SIGGRAPH 2020 called “Monte Carlo Geometry Processing: A Grid-Free Approach to PDE-Based Methods on Volumetric Domains” The paper is here: You can find…

The blog at the bottom of the sea
Show threadCachefloweDec 29, 2022
@demofox I really appreciate your articles. I recently implementeed JFA and had read a couple of your posts several times long the way :)
Show threaddemofox
@cacheflowe that's awesome :)
It's neat that JFA can make a voronoi which is an acceleration structure for this algorithm (!!). I have it on my todo list to implement the parallel banding algorithm, which is supposed to be faster and more accurate than JFA.
I wish I knew of an algorithm to do delaunay teiangulation as easy as JFA was (to know the N points that encompass a specific point)!
Dec 29, 2022 at 4:02pmWeb
Show threadCachefloweDec 29, 2022
@demofox Very cool! JFA seems to have a *lot* of uses. Hopefully I’ll understand more of them someday 😅