二维圆盘凸包的基准数据集。
Benchmark dataset for the convex hull of 2D disks.
作者信息
Song Chanyoung, Ryu Joonghyun, Kim Deok-Soo
机构信息
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.
出版信息
Data Brief. 2019 Nov 12;27:104784. doi: 10.1016/j.dib.2019.104784. eCollection 2019 Dec.
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++程序生成的。该数据集与一篇文章相关：《QuickhullDisk：一种更快的圆盘凸包算法》，文中提出了QuickhullDisk算法，并与1995年Devillers和Golin报道的增量算法进行了比较[1]。
Zotero 插件