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
_version_ 1783474360175034368
author Song, Chanyoung
Ryu, Joonghyun
Kim, Deok-Soo
author_facet Song, Chanyoung
Ryu, Joonghyun
Kim, Deok-Soo
author_sort Song, Chanyoung
collection PubMed
description 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].
format Online
Article
Text
id pubmed-6883335
institution National Center for Biotechnology Information
language English
publishDate 2019
publisher Elsevier
record_format MEDLINE/PubMed
spelling pubmed-68833352019-12-03 Benchmark dataset for the convex hull of 2D disks Song, Chanyoung Ryu, Joonghyun Kim, Deok-Soo Data Brief Mathematics 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]. Elsevier 2019-11-12 /pmc/articles/PMC6883335/ /pubmed/31799345 http://dx.doi.org/10.1016/j.dib.2019.104784 Text en © 2019 The Author(s) http://creativecommons.org/licenses/by/4.0/ This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
spellingShingle Mathematics
Song, Chanyoung
Ryu, Joonghyun
Kim, Deok-Soo
Benchmark dataset for the convex hull of 2D disks
title Benchmark dataset for the convex hull of 2D disks
title_full Benchmark dataset for the convex hull of 2D disks
title_fullStr Benchmark dataset for the convex hull of 2D disks
title_full_unstemmed Benchmark dataset for the convex hull of 2D disks
title_short Benchmark dataset for the convex hull of 2D disks
title_sort benchmark dataset for the convex hull of 2d disks
topic Mathematics
url 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
work_keys_str_mv AT songchanyoung benchmarkdatasetfortheconvexhullof2ddisks
AT ryujoonghyun benchmarkdatasetfortheconvexhullof2ddisks
AT kimdeoksoo benchmarkdatasetfortheconvexhullof2ddisks

Ejemplares similares