Edge advancing rules for intersecting spherical convex polygons
In this paper, we propose new rules of advancing edges for computing the intersection of a pair of convex polygons in the plane. These rules have no ambiguities when extended into the spherical surface, differently from those of O'Rourke et al..(4) Finally, we design a linear-time algorithm for computing the intersection of a pair of spherical convex polygons, and prove its correctness.
intersection computational geometry spherical algorithm