1 research outputs found
A linear-time algorithm for determining the intersection type of two star polygons
In this paper, we present a linear time algorithm for determining the intersection type of two star polygons and prove its correctness. The algorithm exploits the sorted angular order of the vertices of a star polygon and, thus, avoiding the general step of sorting the polygonal vertices