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.
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)
I think this is something like a boundary between two fluids. For example, if you had oil and water in a glass you could describe the 2d surface where they meet as the interface.
You might also be interested in JFA https://en.m.wikipedia.org/wiki/Jump_flooding_algorithm
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.
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)
First skim and I'm confused about the meaning of "interface" in this context. Anyone?
https://en.wikipedia.org/wiki/Interface_(matter)
I think this is something like a boundary between two fluids. For example, if you had oil and water in a glass you could describe the 2d surface where they meet as the interface.