Efficient algorithm for computing the k-reachability region from a point

Key Points

• This research aims to compute the k-reachability region from a point outside a rectilinear polygon.
• Defined the problem of k-reachability in rectilinear polygons.
• Developed an efficient algorithm to find the reachable region with k bends.
• Analyzed the algorithm's time complexity as O(kn), where n is the number of polygon vertices.
• The proposed algorithm effectively calculates reachable regions in promise of efficiency.
• Achieved a time complexity that scales linearly with the number of vertices and number of bends.