Linear-Time Algorithms for Finding Constant Visible Candidate Edges in a Polygon with Holes
Jong‐Sung Ha, Kwan‐Hee Yoo · Advanced science and technology letters · 2014
This paper presents concrete linear-time algorithms for finding the constant number of visible candidate edges in a polygon with holes. Our algorithms take the similar approach of Shin and Woo [1] in a polygon without holes.