| Popis: |
Given a dataset of two-dimensional points in the plane with integer\ud coordinates, the method proposed reduces a set of n points down to\ud a set of s points s ≤ n, such that the convex hull on the set of s\ud points is the same as the convex hull of the original set of n points.\ud The method is O(n). It helps any convex hull algorithm run faster.\ud The empirical analysis of a practical case shows a percentage reduction\ud in points of over 98%, that is reflected as a faster computation with a\ud speedup factor of at least 4. |
Plný text