Cargando…
Preprocessing 2D data for fast convex hull computations
This paper presents a method to reduce a set of n 2D points to a smaller set of s 2D points with the property that the convex hull on the smaller set is the same as the convex hull of the original bigger set. The paper shows, experimentally, that such reduction accelerates computations; the time it...
Autores principales: | Cadenas, Oswaldo, Megson, Graham M. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6386436/ https://www.ncbi.nlm.nih.gov/pubmed/30794575 http://dx.doi.org/10.1371/journal.pone.0212189 |
Ejemplares similares
-
Preconditioning 2D Integer Data for Fast Convex Hull Computations
por: Cadenas, José Oswaldo, et al.
Publicado: (2016) -
Benchmark dataset for the convex hull of 2D disks
por: Song, Chanyoung, et al.
Publicado: (2019) -
CudaChain: an alternative algorithm for finding 2D convex hulls on the GPU
por: Mei, Gang
Publicado: (2016) -
Convex-hull voting method on a large data set
por: Ellingson, Sally R, et al.
Publicado: (2015) -
Fast Dynamic Vehicle Detection in Road Scenarios Based on Pose Estimation with Convex-Hull Model
por: Liu, Kaiqi, et al.
Publicado: (2019)