SDFs and the Fast sweeping algorithm in Jax

(rohangautam.github.io)

39 points | by beansbeansbeans 7 days ago ago

7 comments

  • singron 3 days ago ago
    • beansbeansbeans 18 hours ago ago

      Thats a cool algorithm!! I couldnt find resources on how it might be used to compute distance functions (though it seems like it can). It seems to be for approximating voronoi diagrams.

      • singron 7 hours ago ago

        The two problems are highly related, which is why it can do both. At the end of the algorithm, you have a per-pixel assignment of the (approximately) closest seed pixel. If you want a voronoi diagram, then you color each pixel according to the identify of its seed pixel. If you want a distance function, then you color it with the distance to that pixel.

    • cyber_kinetist 2 days ago ago

      As a bonus: the vanilla JFA can only calculate unsigned distances, but you can extend this to signed distance computation using a simple trick: by inverting your JFA result and setting it as the seed for running a second DFA. (See https://blog.demofox.org/2016/03/02/actually-making-signed-d... for a better explanation)

  • andybak 3 days ago ago

    First skim and I'm confused about the meaning of "interface" in this context. Anyone?