Implementing "Dijkstra's algorithm" or "mesh distance marching". Computes the on-surface dist from one point to all others (i.e. like a heat spreading across the mesh).
From a seed point, we could add the furthest point to the list and reiterate, compute dist, find furthest point, add this point to list, repeat... This will produce an (approximately) equidistant or geodesic set of points. Handy for remeshing, but it does look like David's got the measles. #julialang
Add comment