Experimental Analysis of a Kinetic Convex Hull Algorithm

Given n points continuously moving in 2d space, we want to maintain their convex hull eachtime. in this paper, first we use the kinetic data structure (kds) framework and define a new kdsnamed spiral. after that, we turn to both theoretical and experimental evaluations of our kds; intheoretical evaluation, consider the four quality measures of kinetic data structures in the worstcase. but in the experimental evaluation results of a simulation program are used to estimate theaverage case. we suggest an alternative efficiency parameter instead of previously defined anddefine a new responsiveness measure for the average case. the experimental factors are muehbetter than the theoretical worst case (this is especially true for the efficiency parameter; log'ninstead of n.); hence conclude that we can't reject a kds with rather large theoretical worst caseparameters. however, this study shows that when working with random positions, the worst casesused to evaluate a kds aren't alway, sufficient because these are rarely occurred and the expectedaverage is so mueh better. in the worst case, from point of view of responsiveness, efficiency,locality and compactness our kds belongs to o(n), o(n), o(c) and o(n) respectively (c is aconstant number) and in the average case, these parameters for our kds are o(log n),o(log^2n), o(c)and o(n) respectively. note that previously, the two last parameters was o (log n) and o (n log n).