Rapid preconditioning of data for accelerating convex hull algorithms
Cadenas, O and Megson, G (2014). Rapid preconditioning of data for accelerating convex hull algorithms. Electronics Letters. 50 (4), pp. 270-272.
|Authors||Cadenas, O and Megson, G|
Given a dataset of two-dimensional points in the plane with integer coordinates, the method proposed reduces a set of n points down to a set of s points s ≤ n, such that the convex hull on the set of s points is the same as the convex hull of the original set of n points. The method is O(n). It helps any convex hull algorithm run faster. The empirical analysis of a practical case shows a percentage reduction in points of over 98%, that is reflected as a faster computation with a speedup factor of at least 4.
|Keywords||Convex hull; Acceleration of computation; 0906 Electrical And Electronic Engineering; 0801 Artificial Intelligence And Image Processing; 1005 Communications Technologies; Electrical & Electronic Engineering|
|Journal citation||50 (4), pp. 270-272|
|Publisher||nstitution of Engineering and Technology|
|Digital Object Identifier (DOI)||doi:10.1049/el.2013.3507|
|13 Feb 2014|
|Publication process dates|
|Deposited||09 May 2017|
|Accepted||09 Jan 2014|
|Accepted author manuscript|
CC BY 4.0
0views this month
2downloads this month