Shortest paths in simple polygons with polygon-meet constraints |
| |
Authors: | Ramtin Khosravi Mohammad Ghodsi |
| |
Affiliation: | a IPM School of Computer Science, P.O. Box 19395-5746, Tehran, Iran b Department of Computer Engineering, Sharif University of Technology, P.O. Box 11365-9517, Tehran, Iran |
| |
Abstract: | We study a constrained version of the shortest path problem in simple polygons, in which the path must visit a given target polygon. We provide a worst-case optimal algorithm for this problem and also present a method to construct a subdivision of the simple polygon to efficiently answer queries to retrieve the shortest polygon-meeting paths from a single-source to the query point. The algorithms are linear, both in time and space, in terms of the complexity of the two polygons. |
| |
Keywords: | Computational geometry Shortest path Shortest path map Polygon-meet |
本文献已被 ScienceDirect 等数据库收录! |
|