Edge advancing rules for intersecting spherical convex polygons

Cited 3 time in webofscience Cited 0 time in scopus
  • Hit : 389
  • Download : 0
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.
Publisher
WORLD SCIENTIFIC PUBL CO PTE LTD
Issue Date
2002-06
Language
English
Article Type
Article
Citation

INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY APPLICATIONS, v.12, no.3, pp.207 - 216

ISSN
0218-1959
URI
http://hdl.handle.net/10203/84746
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 3 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0