Topology-Oriented Incremental Algorithm for the Robust Construction of the Voronoi Diagrams of Disks
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Mokwon | - |
dc.contributor.author | Sugihara, Kokichi | - |
dc.contributor.author | Kim, Deok-Soo | - |
dc.date.accessioned | 2021-07-30T04:58:46Z | - |
dc.date.available | 2021-07-30T04:58:46Z | - |
dc.date.created | 2021-05-12 | - |
dc.date.issued | 2016-09 | - |
dc.identifier.issn | 0098-3500 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/2521 | - |
dc.description.abstract | Voronoi diagrams are useful for spatial reasoning, and the robust and efficient construction of the ordinary Voronoi diagram of points is well known. However, its counterpart for circular disks in R-2 and spherical balls in R-3 remains a challenge. In this article, we propose a topology-oriented incremental algorithm which robustly and efficiently computes a Voronoi diagram by incrementing a new disk generator to an existing one. The key idea is to enforce the convexity of the Voronoi cell corresponding to the incrementing disk so that a simple variation of the algorithm for points proposed by Sugihara in 1992 can be applied. A benchmark using both random and degenerate disks shows that the proposed algorithm is superior to CGAL in both computational efficiency and algorithmic robustness. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | ASSOC COMPUTING MACHINERY | - |
dc.title | Topology-Oriented Incremental Algorithm for the Robust Construction of the Voronoi Diagrams of Disks | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Deok-Soo | - |
dc.identifier.doi | 10.1145/2939366 | - |
dc.identifier.scopusid | 2-s2.0-85046366679 | - |
dc.identifier.wosid | 000384282800006 | - |
dc.identifier.bibliographicCitation | ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, v.43, no.2, pp.1 - 23 | - |
dc.relation.isPartOf | ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE | - |
dc.citation.title | ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE | - |
dc.citation.volume | 43 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 1 | - |
dc.citation.endPage | 23 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Mathematics | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Software Engineering | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
dc.subject.keywordPlus | BETA-COMPLEXES | - |
dc.subject.keywordPlus | QUASI-TRIANGULATIONS | - |
dc.subject.keywordPlus | SWEEPLINE ALGORITHM | - |
dc.subject.keywordPlus | CIRCLE SET | - |
dc.subject.keywordPlus | POINT SET | - |
dc.subject.keywordAuthor | Algorithms | - |
dc.subject.keywordAuthor | Theory | - |
dc.subject.keywordAuthor | Additively-weighted Voronoi diagram | - |
dc.subject.keywordAuthor | disks | - |
dc.subject.keywordAuthor | quasi-triangulation | - |
dc.subject.keywordAuthor | betacomplex | - |
dc.subject.keywordAuthor | simplex | - |
dc.subject.keywordAuthor | simplicial complex | - |
dc.subject.keywordAuthor | topology | - |
dc.identifier.url | https://dl.acm.org/doi/10.1145/2939366 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.