QuickhullDisk: A faster convex hull algorithm for disks
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Nguyen Kieu Linh | - |
dc.contributor.author | Song, Chanyoung | - |
dc.contributor.author | Ryu, Joonghyun | - |
dc.contributor.author | Phan Thanh An | - |
dc.contributor.author | Nam-Dung Hoang | - |
dc.contributor.author | Kim, Deok-Soo | - |
dc.date.accessioned | 2021-08-02T10:28:23Z | - |
dc.date.available | 2021-08-02T10:28:23Z | - |
dc.date.created | 2021-05-12 | - |
dc.date.issued | 2019-12 | - |
dc.identifier.issn | 0096-3003 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/11642 | - |
dc.description.abstract | Convex hull is one of the most fundamental constructs in geometry and its construction has been extensively studied. There are many prior works on the convex hull of points. However, its counterpart for weighted points has not been sufficiently addressed despite important applications. Here, we present a simple and fast algorithm, QuickhullDisk, for the convex hull of a set of disks in R-2 by generalizing the quickhull algorithm for points. QuickhullDisk takes O(nlog n) time on average and O(mn) time in the worst case where m represents the number of extreme disks which contribute to the boundary of the convex hull of n disks. These time complexities are identical to those of the quickhull algorithm for points in R-2. Experimental result shows that the proposed QuickhullDisk algorithm runs significantly faster than the O(nlogn) time incremental algorithm, proposed by Devillers and Golin in 1995, particularly for big data. QuickhullDisk is approximately 2.6 times faster than the incremental algorithm for random disks and is 1.2 times faster even for the disk sets where all disks are extreme. This speed-up is because the basic geometric operation of the QuickhullDisk algorithm is a predicate for the location of a point w.r.t. a line and is much faster than that of the incremental algorithm. The source code of QuickhullDisk is freely available from Mendeley Data and a GUI-version from Voronoi Diagram Research Center, Hanyang University (http://voronoi.hanyang.ac.kr/). (C) 2019 The Author(s). Published by Elsevier Inc. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER SCIENCE INC | - |
dc.title | QuickhullDisk: A faster convex hull algorithm for disks | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Deok-Soo | - |
dc.identifier.doi | 10.1016/j.amc.2019.124626 | - |
dc.identifier.scopusid | 2-s2.0-85070218545 | - |
dc.identifier.wosid | 000486390400041 | - |
dc.identifier.bibliographicCitation | APPLIED MATHEMATICS AND COMPUTATION, v.363 | - |
dc.relation.isPartOf | APPLIED MATHEMATICS AND COMPUTATION | - |
dc.citation.title | APPLIED MATHEMATICS AND COMPUTATION | - |
dc.citation.volume | 363 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | Y | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Mathematics | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
dc.subject.keywordPlus | EUCLIDEAN-VORONOI-DIAGRAM | - |
dc.subject.keywordPlus | FINITE-SET | - |
dc.subject.keywordPlus | CIRCLE SET | - |
dc.subject.keywordPlus | POINT SET | - |
dc.subject.keywordPlus | THEOREM | - |
dc.subject.keywordAuthor | Weighted points | - |
dc.subject.keywordAuthor | Incremental algorithm | - |
dc.subject.keywordAuthor | Quicksort | - |
dc.subject.keywordAuthor | Quickhull | - |
dc.subject.keywordAuthor | Voronoi diagram | - |
dc.subject.keywordAuthor | Divide and conquer | - |
dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S0096300319306186?via%3Dihub | - |
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.