Computing a single cell in the overlay of two simple polygons

This note combines the lazy randomized incremental construction scheme with the technique of ''connectivity acceleration'' to obtain an O(n(log(*) n)(2)) time randomized algorithm to compute a single face in the overlay of two simple polygons in the plane. (C) 1997 Elsevier Science B.V.
Publisher
ELSEVIER SCIENCE BV
Issue Date
1997-08
Language
ENG
Keywords

COMPUTATIONAL GEOMETRY

Citation

INFORMATION PROCESSING LETTERS, v.63, no.4, pp.215 - 219

ISSN
0020-0190
DOI
10.1016/S0020-0190(97)00125-7
URI
http://hdl.handle.net/10203/325
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
1997-15.pdf(189.98 kB)Download
  • Hit : 390
  • Download : 229
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 3 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0