DC Field | Value | Language |
---|---|---|
dc.contributor.author | Park, SC | ko |
dc.contributor.author | Shin, Hayong | ko |
dc.date.accessioned | 2013-03-03T17:32:36Z | - |
dc.date.available | 2013-03-03T17:32:36Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2002-04 | - |
dc.identifier.citation | COMPUTERS & GRAPHICS-UK, v.26, no.2, pp.341 - 350 | - |
dc.identifier.issn | 0097-8493 | - |
dc.identifier.uri | http://hdl.handle.net/10203/79701 | - |
dc.description.abstract | In order to find all intersections among polygonal chains. this paper presents a procedure consisting of two phases: (1) splitting polygonal chains into a minimal number of monotone chains and (2) finding intersections among the monotone chains. For the first phase, we suggest an optimal algorithm splitting polygonal chains into a minimal number of monotone chains, with an O(n + r log r) time complexity. where n is the number of line-segments in the polygonal chains and r is the number of C-subchains. For the second phase. we extend Bentley-Ottmann's sweep-line algorithm and the time complexity is O((n + k)log m), where k is the number of intersections. and to is the minimal number of monotone chains. (C) 2002 Elsevier Science Ltd. All rights reserved. | - |
dc.language | English | - |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.subject | ALGORITHM | - |
dc.title | Polygonal chain intersection | - |
dc.type | Article | - |
dc.identifier.wosid | 000176419000013 | - |
dc.identifier.scopusid | 2-s2.0-0036530722 | - |
dc.type.rims | ART | - |
dc.citation.volume | 26 | - |
dc.citation.issue | 2 | - |
dc.citation.beginningpage | 341 | - |
dc.citation.endingpage | 350 | - |
dc.citation.publicationname | COMPUTERS & GRAPHICS-UK | - |
dc.identifier.doi | 10.1016/S0097-8493(02)00060-2 | - |
dc.contributor.localauthor | Shin, Hayong | - |
dc.contributor.nonIdAuthor | Park, SC | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | polygon | - |
dc.subject.keywordAuthor | intersection | - |
dc.subject.keywordAuthor | sweep line | - |
dc.subject.keywordAuthor | monotone chain | - |
dc.subject.keywordAuthor | polygonal chain | - |
dc.subject.keywordPlus | ALGORITHM | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.