Benchmark dataset for the convex hull of 2D disks

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: “Quick...

Descripción completa

Detalles Bibliográficos
Autores principales: Song, Chanyoung, Ryu, Joonghyun, Kim, Deok-Soo
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Elsevier 2019
Materias:
Mathematics
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6883335/
https://www.ncbi.nlm.nih.gov/pubmed/31799345
http://dx.doi.org/10.1016/j.dib.2019.104784
Descripción
Sumario: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].

Ejemplares similares