Fast algorithms for two maximal distance problems with applications to image analysis
作者：
Highlights：
•
摘要
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.
论文关键词：Path length,Diameter,Image analysis algorithms,Shape analysis
论文评审过程：Received 14 February 1979, Revised 5 June 1979, Available online 19 May 2003.
论文官网地址：https://doi.org/10.1016/0031-3203(80)90052-7
