Benchmark dataset for the convex hull of 2D disks
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Song, Chanyoung | - |
dc.contributor.author | Ryu, Joonghyun | - |
dc.contributor.author | Kim, Deok-Soo | - |
dc.date.accessioned | 2021-08-02T10:28:04Z | - |
dc.date.available | 2021-08-02T10:28:04Z | - |
dc.date.created | 2021-05-12 | - |
dc.date.issued | 2019-12 | - |
dc.identifier.issn | 2352-3409 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/11612 | - |
dc.description.abstract | In this paper, we present a benchmark dataset which can be used to evaluate the algorithms to construct the convex hull of 2D disks. The dataset contains disk arrangements including general and extremely biased cases, which are generated by a C++ program. The dataset is related to an article: "QuickhullDisk: A Faster Convex Hull Algorithm for Disks" in which the QuickhullDisk algorithm is presented and compared to the incremental algorithm which was reported by Devillers and Golin in 1995 [1]. (c) 2019 The Author(s). Published by Elsevier Inc. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Elsevier BV | - |
dc.title | Benchmark dataset for the convex hull of 2D disks | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Deok-Soo | - |
dc.identifier.doi | 10.1016/j.dib.2019.104784 | - |
dc.identifier.scopusid | 2-s2.0-85075190463 | - |
dc.identifier.wosid | 000501988200236 | - |
dc.identifier.bibliographicCitation | Data in Brief, v.27 | - |
dc.relation.isPartOf | Data in Brief | - |
dc.citation.title | Data in Brief | - |
dc.citation.volume | 27 | - |
dc.type.rims | ART | - |
dc.type.docType | Article; Data Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | Y | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Science & Technology - Other Topics | - |
dc.relation.journalWebOfScienceCategory | Multidisciplinary Sciences | - |
dc.subject.keywordPlus | Computational geometry | - |
dc.subject.keywordPlus | Computer software | - |
dc.subject.keywordPlus | Benchmark datasets | - |
dc.subject.keywordPlus | Circular container | - |
dc.subject.keywordPlus | Convex hull | - |
dc.subject.keywordPlus | Disk arrangements | - |
dc.subject.keywordPlus | Divide-and-conquer | - |
dc.subject.keywordPlus | Incremental algorithm | - |
dc.subject.keywordPlus | Quickhulldisk | - |
dc.subject.keywordPlus | Random disk | - |
dc.subject.keywordPlus | Voronoi diagrams | - |
dc.subject.keywordPlus | Weighted point | - |
dc.subject.keywordPlus | C++ (programming language) | - |
dc.subject.keywordAuthor | Weighted points | - |
dc.subject.keywordAuthor | Random disks | - |
dc.subject.keywordAuthor | Circular container | - |
dc.subject.keywordAuthor | QuickhullDisk | - |
dc.subject.keywordAuthor | Incremental algorithm | - |
dc.subject.keywordAuthor | Divide and conquer | - |
dc.subject.keywordAuthor | Voronoi diagram | - |
dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S2352340919311394?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.