论文信息 - Fast algorithms for two maximal distance problems with applications to image analysis

Fast algorithms for two maximal distance problems with applications to image analysis

Abstract This paper presents two new linear complexity algorithms for finding maximal length “paths” in point sets and trees (with an extension to graphs) and indicates applications of these techniques to problems in image analysis.

Martin A. Fischler

[1] Ronald L. Graham,et al. An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..

[2] Michael Ian Shamos,et al. Geometric complexity , 1975, STOC.

[3] A. Nijenhuis. Combinatorial algorithms , 1975 .

[4] Claude Berge,et al. The theory of graphs and its applications , 1962 .

[5] Azriel Rosenfeld,et al. Sequential Operations in Digital Picture Processing , 1966, JACM.

[6] Philip M. Spira,et al. A New Algorithm for Finding all Shortest Paths in a Graph of Positive Arcs in Average Time 0(n2 log2n) , 1973, SIAM J. Comput..