12 citations · 37 across the 16 of their papers we have counts for
1 paper · 1 filter
Subhrajit Bhattacharya
We present the `Basic S*' algorithm for computing shortest path through a metric simplicial complex. In particular, given a metric graph, G, which is constructed as a discrete re…