1 paper · 1 filter
Viktoria Ehm, Daniel Cremers, Florian Bernard
Finding shortest paths in a graph is relevant for numerous problems in computer vision and graphics, including image segmentation, shape matching, or the computation of geodesic di…