Visibility graphs and obstacle-avoiding shortest paths
Visibility graphs and obstacle-avoiding shortest paths
复制标题
DOI：
10.1007/bf01928918
复制
发表时间：
1988-05
期刊：
影响因子：
--
通讯作者：
H. Alt;E. Welzl
中科院分区：
文献类型：
--
作者：
H. Alt;E. Welzl
计算几何中两个密切相关的问题是确定包含障碍物的二维或三维环境中的可见性图和最短路径。应用领域是计算机图形学和机器人学。我们对这些问题的高效算法的最新研究进行了综述。
Two closely related problems in Computational Geometry are determining visibility graphs and shortest paths in a two- or three-dimensional environment containing obstacles. Applications are within Computer Graphics and Robotics. We give a survey on recent research done on efficient algorithms for these problems.