Abstract | ||
---|---|---|
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. |
Year | DOI | Venue |
---|---|---|
2002 | 10.1142/S0218195902000827 | INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS |
Keywords | DocType | Volume |
computational geometry, intersection, spherical algorithm | Journal | 12 |
Issue | ISSN | Citations |
3 | 0218-1959 | 2 |
PageRank | References | Authors |
0.46 | 4 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jongsung Ha | 1 | 10 | 2.44 |
Sung Yong Shin | 2 | 1904 | 168.33 |