论文标题
测量路径和距离算法的调查
A Survey of Algorithms for Geodesic Paths and Distances
论文作者
论文摘要
弯曲域上最短路径或测量学的数值计算以及相关的测量距离，在数字几何处理，科学计算，计算机图形和计算机视觉的广泛应用中出现。相对于欧几里得距离计算，这些任务因曲率对最短路径行为的影响而变得复杂，以及域的表示本身可能是近似的事实。尽管这个问题很困难，但最近的文献还是开发了各种各样的复杂方法，即使在相对较大的模型上，也可以快速查询地质信息。这项调查回顾了测量路径和距离计算的主要方法，突出了常见的主题和未来改进的机会。
Numerical computation of shortest paths or geodesics on curved domains, as well as the associated geodesic distance, arises in a broad range of applications across digital geometry processing, scientific computing, computer graphics, and computer vision. Relative to Euclidean distance computation, these tasks are complicated by the influence of curvature on the behavior of shortest paths, as well as the fact that the representation of the domain may itself be approximate. In spite of the difficulty of this problem, recent literature has developed a wide variety of sophisticated methods that enable rapid queries of geodesic information, even on relatively large models. This survey reviews the major categories of approaches to the computation of geodesic paths and distances, highlighting common themes and opportunities for future improvement.
