Demonstrates an efficient algorithm to compute k-reachability regions in rectilinear polygons, indicating improvements in pathfinding efficiency.
The following problem is considered: Given a rectilinear simple polygon P and a point q in its exterior; find the region that is reachable from q along orthogonal paths with at most k bends. We present an efficient algorithm which runs in O(kn) time, where n is the number of vertices.
No takes yet. Share an insight, caveat, or question.
浅野 et al. (1985) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: