Circular Shortest Path on Regular Grids ∗

@inproceedings{SunCircularSP,
  title={Circular Shortest Path on Regular Grids ∗},
  author={Changming Sun and Stefano Pallottino}
}
Shortest path algorithms have been used for a number of applications such as crack detection, road or linear feature extraction on images. In this paper, we presents several new algorithms for the extraction of a circular shortest path on regular grids such that the starting and ending positions are connected. The new algorithms we developed include multiple search algorithm, image patching algorithm, multiple backtracking algorithm, the combination of image patching and multiple back-tracking… CONTINUE READING
6 Citations
11 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Circular shortest path on regular grids

  • C. Sun, S. Pallottino
  • Technical Report 01/76,
  • 2001
1 Excerpt

and P

  • M. A. Lovell, G. Williamson
  • K. H. (eds). Borehole Imaging: applications and…
  • 1999
1 Excerpt

A dynamic programming algorithm for binocular stereo vision

  • S. A. Lloyd
  • GEC Journal of Research, 3(1):18–24
  • 1985
1 Excerpt

Similar Papers

Loading similar papers…