An algorithm determines reachable areas in polygons with bends, suggesting improved circuit design efficiency.
Among the most fundamental problems in the layout design of an integrated circuit is the following problem: Given a region bounded by n orthogonal line segments and a point q in its interior, find the region that is reachable from q along rectilinear paths with at most k bends which avoid obstructions, where k is some given constant. We present an efficient algorithm which determines such a region in O(kn) time for a rectilinear simple polygon without any hole in it.
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: