Kinetisation of view of 3D point set

Given a set of n points in the plane, the problem of computing the circular ordering of the points about a viewpoint v and efficiently maintaining this ordering information as v moves is well defined in computer graphics and animation. Each of the unique circular ordering in respect to v is called as view. In this paper, our task is to generalize this idea for 3D point set and to propose a kinetic data structure named Kinetic Neighborhood Graph to maintain the view dynamically with efficiency O(mλs(n²)), locality O(1) and responsiveness O(m).