상세 보기
초록
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.
키워드
Weighted points; Random disks; Circular container; QuickhullDisk; Incremental algorithm; Divide and conquer; Voronoi diagram; Computational geometry; Computer software; Benchmark datasets; Circular container; Convex hull; Disk arrangements; Divide-and-conquer; Incremental algorithm; Quickhulldisk; Random disk; Voronoi diagrams; Weighted point; C++ (programming language)
- 제목
- Benchmark dataset for the convex hull of 2D disks
- 저자
- Song, Chanyoung; Ryu, Joonghyun; Kim, Deok-Soo
- 발행일
- 2019-12
- 유형
- Article; Data Paper
- 저널명
- Data in Brief
- 권
- 27