DSpace at KOASAS
College of Engineering(공과대학)School of Computing(전산학부)CS-Journal Papers(저널논문)

Computing a single cell in the overlay of two simple polygons

Cited 3 time in webofscience Cited 0 time in scopus
  • Hit : 787
  • Download : 350
Export
DC FieldValueLanguage
dc.contributor.authordeBerg, Mko
dc.contributor.authorDevillers, Oko
dc.contributor.authorDobrindt, Kko
dc.contributor.authorCheong, Otfriedko
dc.date.accessioned2007-05-25T01:06:14Z-
dc.date.available2007-05-25T01:06:14Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued1997-08-
dc.identifier.citationINFORMATION PROCESSING LETTERS, v.63, no.4, pp.215 - 219-
dc.identifier.issn0020-0190-
dc.identifier.urihttp://hdl.handle.net/10203/325-
dc.description.abstractThis 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.-
dc.description.sponsorshipThis research was supported by the Netherlands' Organization for Scientific Research (NWO) and was partially supported by the ESPRIT III Basic Research Action 6546 (PROMotion). Part of this work has been done while this author was visiting Utrecht University.en
dc.languageEnglish-
dc.language.isoenen
dc.publisherELSEVIER SCIENCE BV-
dc.subjectCOMPUTATIONAL GEOMETRY-
dc.titleComputing a single cell in the overlay of two simple polygons-
dc.typeArticle-
dc.identifier.wosidA1997XZ93300008-
dc.identifier.scopusid2-s2.0-0043100137-
dc.type.rimsART-
dc.citation.volume63-
dc.citation.issue4-
dc.citation.beginningpage215-
dc.citation.endingpage219-
dc.citation.publicationnameINFORMATION PROCESSING LETTERS-
dc.identifier.doi10.1016/S0020-0190(97)00125-7-
dc.embargo.liftdate9999-12-31-
dc.embargo.terms9999-12-31-
dc.contributor.localauthorCheong, Otfried-
dc.contributor.nonIdAuthordeBerg, M-
dc.contributor.nonIdAuthorDevillers, O-
dc.contributor.nonIdAuthorDobrindt, K-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorcomputational geometry-
dc.subject.keywordAuthorrandomized algorithms-
dc.subject.keywordAuthorarrangement-
dc.subject.keywordPlusCOMPUTATIONAL GEOMETRY-
Appears in Collection
CS-Journal Papers(저널논문)
Files in 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

Display Simple Item Record

qr_code

  • mendeley

    citeulike

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


rss_1.0 rss_2.0 atom_1.0