Cargando…
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...
Autores principales: | Song, Chanyoung, Ryu, Joonghyun, Kim, Deok-Soo |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Elsevier
2019
|
Materias: | |
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 |
Ejemplares similares
-
Benchmark dataset for the Voronoi diagram of 3D spherical balls
por: Song, Chanyoung, et al.
Publicado: (2022) -
Preprocessing 2D data for fast convex hull computations
por: Cadenas, Oswaldo, et al.
Publicado: (2019) -
Preconditioning 2D Integer Data for Fast Convex Hull Computations
por: Cadenas, José Oswaldo, et al.
Publicado: (2016) -
CudaChain: an alternative algorithm for finding 2D convex hulls on the GPU
por: Mei, Gang
Publicado: (2016) -
Convex hull estimation of mammalian body segment parameters
por: Coatham, Samuel J., et al.
Publicado: (2021)