In this paper, first, we present a kinetic data structure for the problem of kinetic convex hull maintenance. After that, discuss some complicated cases followed by the main algorithm and two additional algorithms. Finally, focus on the evaluation of the four properties of the kinetic algorithm in the worst case. We show that quality factors of our algorithm are at most linear. Comparing with s...
