Data Structures for Mobile Data

DOI10.1006/jagm.1998.0988zbMath0928.68034MaRDI QIDQ4240126

Julien Basch, J. E. Hershberger, Leonidas J. Guibas

Publication date: 5 December 1999

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1998.0988

zbMATH Keywords

kinetic data structure

Mathematics Subject Classification ID

68P05: Data structures

Related Items

PROBABILISTIC ANALYSIS FOR DISCRETE ATTRIBUTES OF MOVING POINTS, Kinetic Maintenance of Mobile k-Centres on Trees, THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION, Robust shape fitting via peeling and grating coresets, Kinetic clustering of points on the line, Trajectory clustering of points in \(\mathbb{R}\), A sensor-based framework for kinetic data compression, Out-of-order event processing in kinetic data structures, Kinetic spanners in \(\mathbb R^{d}\), Collision detection for deforming necklaces, A kinetic triangulation scheme for moving points in the plane, Connected dominating sets on dynamic geometric graphs, A clustering-based approach to kinetic closest pair, Kinetic and dynamic data structures for convex hulls and upper envelopes, Kinetic sorting and kinetic convex hulls, Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions, Stable Delaunay graphs, Kinetic facility location, Approximation algorithm for the kinetic robust \(k\)-center problem, Practical methods for shape fitting and kinetic data structures using coresets, Kinetic collision detection for convex fat objects, Kinetic maintenance of mobile \(k\)-centres on trees, Kinetic hanger, Ready, set, go! The Voronoi diagram of moving points that start from a line, Kinetic collision detection between two simple polygons., Smooth kinetic maintenance of clusters, Kinetic heap-ordered trees: Tight analysis and improved algorithms, A simple, faster method for kinetic proximity problems, Deformable spanners and applications, BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES, Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise