Benchmark dataset for the convex hull of 2D disksopen access
- Authors
- Song, Chanyoung; Ryu, Joonghyun; Kim, Deok-Soo
- Issue Date
- Dec-2019
- Publisher
- Elsevier BV
- Keywords
- Weighted points; Random disks; Circular container; QuickhullDisk; Incremental algorithm; Divide and conquer; Voronoi diagram
- Citation
- Data in Brief, v.27
- Indexed
- SCOPUS
- Journal Title
- Data in Brief
- Volume
- 27
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/11612
- DOI
- 10.1016/j.dib.2019.104784
- ISSN
- 2352-3409
- 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.
- Files in This Item
-
- Appears in
Collections - 서울 공과대학 > 서울 기계공학부 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.