Kinetic heap-ordered trees: Tight analysis and improved algorithms

  title={Kinetic heap-ordered trees: Tight analysis and improved algorithms},
  author={Guilherme Dias da Fonseca and Celina M. Herrera de Figueiredo},
  journal={Inf. Process. Lett.},

Figures from this paper

Kinetic hanger
Answer-pairs and processing of continuous nearest-neighbor queries
This paper analyzes the lower bound and the upper bound on the maximum number of answer-pairs of off-line algorithms that compute a priori all the answers to the continuous query of finding the k nearest objects with respect to a given moving point-object Oq.
Kinetic Data Structures for Collision Detection
This chapter presents several new algorithms that detect collisions between deformable objects more efficiently than previous approaches, and proves that the new kinetic AABB-Tree is optimal in the number of updates that is required to restore a bounding volume hierarchy after deformations.
Profiles of random trees: Plane‐oriented recursive trees
An unexpected connection between the profile of plane-oriented recursive trees ( with logarithmic height) and that of random binary trees (with height proportional to the square root of tree size) is unveiled.
Profiles of random trees: plane-oriented recursive trees (Extended Abstract) †
We summarize several limit results for the profile of random plane-oriented recursive trees. These include the limit distribution of the normalized profile, asymptotic bimodality of the variance,
Clustering moving objects
This paper studies the problem of clustering moving objects, which could catch interesting pattern changes during the motion process and provide better insight into the essence of the mobile data points, and proposes efficient techniques to keep the moving micro-clusters geographically small.
Clustering Moving Objects Based On A Moving Clustering Feature Tree
An efficient approach for managing moving objects and predicting the essential time when moving clusters may need to be updated is developed and can efficiently condense MMCs or the MCF tree to conserve space.
Efficiently maintaining moving micro clusters for clustering moving objects
An efficient approach to dynamically maintain a small set of moving micro clusters (MMCs) to represent groups of similar moving objects so global clusters can be generated by any clustering algorithm, whenever is needed, from these representative MMCs.
Query processing in mobile peer-to-peer networks
The dissertation develops the formula by which a mobile peer dynamically adjusts the number of reports included in a transmission, develops a report prioritization method called MARKET, analyzes the way a report is propagated in geospace and time, and proposes a query processing method that uses cooperative caching.
Continuous nearest-neighbor queries with location uncertainty
The lower bound and the upper bound on the maximum number of answer-pairs, for the certain case and the uncertain case, are analyzed and compared using a database of 1 million objects derived from real-world GPS traces.


Data structures for mobile data
This talk will survey the general ideas behind Kinetic data structures and illustrate their application to simple geometric problems that arise in virtual and physical environments.
Sweeping lines and line segments with a heap
It is shown how a heap on the intersections can be maintained during the sweep of the Bentley-Ottmann sweep, which maintains the exact ordering of the intersections of the segments with a vertical liie.
Proc. 13th Canadian Conference on Computational Geometry
  • Proc. 13th Canadian Conference on Computational Geometry
  • 2001