School of Mechanical Engineering, Hanyang University, 222 Wangsimni-ro, Seongdong-gu, Seoul, South Korea
Joonghyun Ryu
Voronoi Diagram Research Center, Hanyang University, 222, Wangsimni-ro, Seongdong-gu, Seoul, South Korea; HYU-HPSTAR-CIS Global High Pressure Research Center, Hanyang University, 222 Wangsimni-ro, Seongdong-gu, Seoul, South Korea
Deok-Soo Kim
School of Mechanical Engineering, Hanyang University, 222 Wangsimni-ro, Seongdong-gu, Seoul, South Korea; Voronoi Diagram Research Center, Hanyang University, 222, Wangsimni-ro, Seongdong-gu, Seoul, South Korea; HYU-HPSTAR-CIS Global High Pressure Research Center, Hanyang University, 222 Wangsimni-ro, Seongdong-gu, Seoul, South Korea; Corresponding author. School of Mechanical Engineering, Hanyang University, 222 Wangsimni-ro, Seongdong-gu, Seoul, South Korea.
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]. Keywords: Weighted points, Random disks, Circular container, QuickhullDisk, Incremental algorithm, Divide and conquer, Voronoi diagram
