Data structures for mobile data

Computer systems commonly cache the values of variables to gain efficiency. In applications where the goal is to track attributes of a continuously moving or deforming physical system over time, caching relations between variables works better than caching individual values. The reason is that, as the system evolves, such relationships are more stable than the values of individual variables. Kinetic data structures (KDSs) are a novel formal framework for designing and analyzing sets of assertions to cache about the environment, so that these assertion sets are at once relatively stable and tailored to facilitate or trivialize the computation of the attribute of interest. Formally, a KDS is a mathematical proof animated through time, proving the validity of a certain computation for the attribute of interest. KDSs have rigorous associated measures of performance and their design shares many qualities with that of classical data structures. The KDS framework has led to many new and promising algorithms in applications where the efficient modeling of motion is essential. Among these are collision detection for moving rigid and deformable bodies, connectivity maintenace in ad-hoc networks, local environment tracking for mobile agents, and visibility/occlusion maintenance. This talk will survey the general ideas behind KDSs and illustrate their application to simple geometric problems that arise in virtual and physical environments.

[1]  Leonidas J. Guibas,et al.  Sweeping lines and line segments with a heap , 1997, SCG '97.

[2]  Jan van Leeuwen,et al.  Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..

[3]  Thomas Roos,et al.  Voronoi Diagrams over Dynamic Scenes , 1993, Discret. Appl. Math..

[4]  Leonidas J. Guibas,et al.  Cylindrical static and kinetic binary space partitions , 1997, SCG '97.

[5]  Michiel H. M. Smid,et al.  Randomized data structures for the dynamic closest-pair problem , 1998, SODA '93.

[6]  John Hershberger,et al.  Finding the Upper Envelope of n Line Segments in O(n log n) Time , 1989, Inf. Process. Lett..

[7]  Leonidas J. Guibas,et al.  Kinetic collision detection between two simple polygons , 2004, SODA '99.

[8]  P. Agarwal,et al.  Kinetic binary space partitions for triangles , 1998 .

[9]  J..  SOME DYNAMIC COMPUTATIONAL GEOMETRY PROBLEMS , 2009 .

[10]  Thomas Ottmann,et al.  Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.

[11]  Dinesh Manocha,et al.  Incremental collision detection for polygonal models , 1995, SCG '95.

[12]  Olivier Devillers,et al.  Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points , 1994, CCCG.

[13]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[14]  Richard C. T. Lee,et al.  Voronoi diagrams of moving points in the plane , 1990, Int. J. Comput. Geom. Appl..

[15]  L. Guibas,et al.  Separation-sensitive kinetic collision detection for convex objects , 1998 .

[16]  Michiel H. M. Smid,et al.  New techniques for exact and approximate dynamic closest-point problems , 1994, SCG '94.

[17]  Micha Sharir,et al.  The overlay of lower envelopes and its applications , 1996, Discret. Comput. Geom..

[18]  Subhash Suri,et al.  Applications of a semi-dynamic convex hull algorithm , 1992, BIT Comput. Sci. Sect..

[19]  T. Ottmann,et al.  Dynamical sets of points , 1984 .

[20]  Leonidas J. Guibas,et al.  Parallel computational geometry , 1988, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[21]  Sivan Toledo,et al.  Applications of parametric searching in geometric optimization , 1992, SODA '92.

[22]  Vladlen Koltun.  Almost tight upper bounds for lower envelopes in higher dimensions , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[23]  S. Rao Kosaraju,et al.  Algorithms for dynamic closest pair and n-body potential fields , 1995, SODA '95.

[24]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[25]  Leonidas J. Guibas,et al.  Data Structures for Mobile Data , 1997, J. Algorithms.

[26]  Leonidas J. Guibas,et al.  Proximity problems on moving points , 1997, SCG '97.

[27]  Leonidas J. Guibas,et al.  Maintaining the Extent of a Moving Point Set , 1997, WADS.

[28]  Sergei Bespamyatnikh,et al.  An Optimal Algorithm for Closest-Pair Maintenance , 1998, Discret. Comput. Geom..

[29]  Richard C. T. Lee,et al.  Voronoi Diagrams of Moving Points in the Plane , 1990, FSTTCS.

[30]  KEVIN Q. BROWN.  Comments on “algorithms for reporting and counting geometric intersections” , 1981, IEEE Transactions on Computers.

[31]  Leonidas J. Guibas,et al.  A practical evaluation of kinetic data structures , 1997, SCG '97.

[32]  Herbert Edelsbrunner,et al.  Constructing Belts in Two-Dimensional Arrangements with Applications , 1986, SIAM J. Comput..