Sweeping lines and line segments with a heap
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Data structures for mobile data
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Information Processing Letters
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Profiles of random trees: Plane-oriented recursive trees
Random Structures & Algorithms
Answer-pairs and processing of continuous nearest-neighbor queries
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
| Hi-index | 0.89 |
The most natural kinetic data structure for maintaining the maximum of a collection of continuously changing numbers is the kinetic heap. Basch, Guibas, and Ramkumar proved that the maximum number of events processed by a kinetic heap with n numbers changing as linear functions of time is O(n log2 n) and Ω (n log n). We prove that this number is actually Θ(n log n). In the kinetic heap, a linear number of events are stored in a priority queue, consequently, it takes O(log n) time to determine the next event at each iteration. We also present a modified version of the kinetic heap that processes O(n log n/log log n) events, with the same O(log n) time complexity to determine the next event.