Preprocessing 2D data for fast convex hull computations
Cadenas, O and Megson, GM (2019). Preprocessing 2D data for fast convex hull computations. PLoS ONE. 14 (2), p. e0212189.
|Authors||Cadenas, O and Megson, GM|
© 2019 Cadenas, Megson. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. 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 takes to reduce from n down to s points plus the time of computing the convex hull on the s points is less than the time to compute the convex hull on the original set of n points. The method accepts 2D points expressed as real numbers and thus extends our previous method that required points as integers. The method achieves a percentage of reduction of points of over 90% in a collections of four datasets. This amount of reduction provides speedup factors of at least two for various common convex hull algorithms. Theoretically, the reduction method executes in time within O(n) and thus is suitable for preprocessing 2D data before computing the convex hull by any known algorithm.
|Journal citation||14 (2), p. e0212189|
|Digital Object Identifier (DOI)||doi:10.1371/journal.pone.0212189|
|01 Feb 2019|
|Publication process dates|
|Deposited||18 Mar 2019|
|Accepted||29 Jan 2019|
CC BY 4.0
3views this month
6downloads this month