Rapid preconditioning of data for accelerating convex hull algorithmsCadenas Medina, J. and Megson, G. M. (2014) Rapid preconditioning of data for accelerating convex hull algorithms. Electronics Letters, 50 (4). pp. 270-272. ISSN 0013-5194
It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing. To link to this item DOI: 10.1049/el.2013.3507 Abstract/SummaryGiven 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.
Download Statistics DownloadsDownloads per month over past year Altmetric Deposit Details References University Staff: Request a correction | Centaur Editors: Update this record |
Lists
Lists
