Repository at Hanyang UniversityCOLLEGE OF ENGINEERING[S](공과대학)MECHANICAL ENGINEERING(기계공학부)Articles
230
103
Benchmark dataset for the convex hull of 2D disks
- Title
- Benchmark dataset for the convex hull of 2D disks
- Author
- 김덕수
- Keywords
- Weighted points; Random disks; Circular container; QuickhullDisk; Incremental algorithm; Divide and conquer; Voronoi diagram
- Issue Date
- 2019-12
- Publisher
- Elsevier BV
- Citation
- Data in Brief, v. 27, article no. 104784
- 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.
- URI
- https://www.sciencedirect.com/science/article/pii/S2352340919311394?via%3Dihubhttps://repository.hanyang.ac.kr/handle/20.500.11754/155671
- ISSN
- 2352-3409
- Appears in Collections:
- COLLEGE OF ENGINEERING[S](공과대학) > MECHANICAL ENGINEERING(기계공학부) > Articles
- Files in This Item:
- Benchmark dataset for the convex hull of 2D disks.pdfDownload
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
