Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The paper describes a new method of continuously monitoring the k nearest neighbors of a given object in the mobile environment. Instead of monitoring all k nearest neighbors,  choose to monitor the k-th (nearest) neighbor since the necessary condition of changes in the KNN is the change of the k-th neighbor. In addition, rather than in the original space,  consider the moving objects in a transformed time-distance (TD) space, where each object is represented by a curve. A beach-line algorithm is developed to monitor the change of the k-th neighbor, which enables us to maintain the KNN incrementally. An extensive empirical study shows that the beach-line algorithm outperforms the most efficient existing algorithm by a wide margin, especially when k or n (the total number of objects) is large.
['Yifan Li', 'Jiong Yang', 'Jiawei Han']
I am writing a research paper on a idea Continuous K-nearest neighbor search for moving objects
[{"from": "human", "value": "I am writing a research paper on a idea Continuous K-nearest neighbor search for moving objects"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The paper describes a new method of continuously monitoring the k nearest neighbors of a given object in the mobile environment. Instead of monitoring all k nearest neighbors,  choose to monitor the k-th (nearest) neighbor since the necessary condition of changes in the KNN is the change of the k-th neighbor. In addition, rather than in the original space,  consider the moving objects in a transformed time-distance (TD) space, where each object is represented by a curve. A beach-line algorithm is developed to monitor the change of the k-th neighbor, which enables us to maintain the KNN incrementally. An extensive empirical study shows that the beach-line algorithm outperforms the most efficient existing algorithm by a wide margin, especially when k or n (the total number of objects) is large."}]