Academic
Publications
Data structures for mobile data

Data structures for mobile data,10.1145/314161.314435,Julien Basch,Leonidas J. Guibas,John Hershberger

Data structures for mobile data   (Citations: 226)
BibTex | RIS | RefWorks Download
Conference: ACM-SIAM Symposium on Discrete Algorithms - SODA , pp. 747-756, 1997
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...Dynamic graph algorithms [6,7] and kinetic algorithms [8,9,10] incorporate non-stationary candidate ranking by making use of structures such as topology trees [6] and dynamic trees [11]...

    Viswanath Gunturiet al. Minimum Spanning Tree on Spatio-Temporal Networks

    • ...We focus on the handling of kinetic data through the model of kinetic data structures (KDSs) proposed by Basch, Guibas, and Hershberger [5]...
    • ...Standard problems which have been tackled include finding the convex hull [5], Voronoi diagram [2], and minimum spanning tree on geometric graphs [6]...

    Sorelle A. Friedleret al. Approximation algorithm for the kinetic robust K-center problem

    • ...Basch, Guibas, and Hershberger [6] give data structures for maintaining convex hulls and closest pairs for mobile geographic data...

    David Eppsteinet al. Privacy-Preserving Data-Oblivious Geometric Algorithms for Geographic ...

    • ...Each node has its own mobility plan, which is composed of direction vectors, velocity, acceleration, and so on. Basch et al. [2], [3] proposed an elegant method to handle topology updates for mobile nodes...

    Shlomi Dolevet al. Bounded-hop strong connectivity for flocking swarms

    • ...The concept of smoothed motion complexity is closely related to the concept of kinetic data structures (KDS), which was introduced by Basch et al. [3]...
    • ...Interesting kinetic data structures have been developed, for instance for connectivity of discs [10] and rectangles [12], convex hulls [3], proximity problems [4], and collision detection for simple polygons [14]...
    • ...Basch et al. [3] developed a KDS to maintain a bounding box of a moving point set in Rd. The number of updates...
    • ...Therefore, researchers investigate data structures that can be eciently maintained under continuous motion, e.g., to answer proximity queries [4], maintain a clustering [11], a convex hull [3], or some connectivity information of the moving point set [12]...
    • ...In particular, in the framework of kinetic data structures [3] many interesting results on data structures for moving objects have been obtained...

    Valentina Damerowyet al. Smoothed analysis of left-to-right maxima with applications

Sort by: