I’m looking for an operation (hopefully an itk filter) that computes the minimal distance to a boundary/surface with obstacles (like how the speed function is used in fast marching).
Basically I have two polygons. I want to compute the shortest path from all the points on the surface of the polygon to the points on another separate polygon. However, I want to enforce a “no travel zone” (binary speed image). I know this would be computed in volumes so I already have binary masks of my polygons (I use them for other things) and I have binary masks for the “no travel zones.”
What I’m describing is very much like a distance map filter. But I need a distance map filter that can use a speed function/“no travel zone” and I’m not aware of one in ITK that would do it. Essentially I would supply it with 3 input images, in my case binary. The two images to compute distances between (input0 would be where it starts and input1 would be where it should end), then a speed image to specify how fast to go in those areas (by setting to 0 it would have to go around).
Alternatively fast marching could certainly do this. But the calculation would take quite awhile and be highly inefficient. It would work like so: Fast march for every point on poly1 with binary speed image essentially finding the shortest path to all other points. Then just compare the distances of all the points on poly2 and chose the smallest. But like I said this would take very long.
Any help would be much appreciated.