An algorithm finds visible boundaries in polygonal regions with holes, suggesting improved computational efficiency.
We are given a polygonal region P with holes and one point q is specified in the region. The problem is how fast we can find the portion of the boundary of P that is visible from q. For this problem an efficient algorithm is presented which runs in time O(n log h) in the worst case and in time O(n plus h log h) if every hole is a convex polygon, where n is the total number of vertices of P and h is the number of holes.
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: