中山大学学报（自然科学版）Issue(6)：1-5,10,6.
以障碍物凸角点为中继源的欧氏距离变换算法
Euclidean Distance Transform Algorithm Using Convex Corners of Obstacles as Relay Sources
摘要
Abstract
The existing geodesic distance transform algorithms consider the influence of obstacles,but the calculated distances have errors.A brute-force algorithm is suggested for accurate geodesic distance transform in a space with obstacles in this paper.It takes the convex corners on obstacles as relay sources to calculate the length of the shortest passable path from foreground pixels to background pixels behind the obstacles.The relay sources of this algorithm lie on the shortest passable paths from foreground pixels to background pixels,and thus distance errors are avoided,better than other relay sources suggested in the existing geodesic distance transform algorithms.Experimental results show that there is no distance error in the new algorithm,and it is applicable for distance transform in space with obstacles in any shapes.关键词
障碍空间/测地距离/距离变换/可见性Key words
obstacle space/geodesic distance/distance transform/visibility分类
天文与地球科学引用本文复制引用
张青年..以障碍物凸角点为中继源的欧氏距离变换算法[J].中山大学学报（自然科学版）,2013,(6):1-5,10,6.基金项目
国家自然科学基金资助项目 （）
