Data Structures for Mobile Data
From MaRDI portal
Publication:4240126
DOI10.1006/jagm.1998.0988zbMath0928.68034OpenAlexW243610207MaRDI 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
Related Items (38)
Kinetic clustering of points on the line ⋮ Trajectory clustering of points in \(\mathbb{R}\) ⋮ Kinetic and dynamic data structures for convex hulls and upper envelopes ⋮ PROBABILISTIC ANALYSIS FOR DISCRETE ATTRIBUTES OF MOVING POINTS ⋮ Kinetic sorting and kinetic convex hulls ⋮ Collision detection for deforming necklaces ⋮ Topological stability of kinetic \(k\)-centers ⋮ Kinetic Geodesic Voronoi Diagrams in a Simple Polygon ⋮ A kinetic triangulation scheme for moving points in the plane ⋮ Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions ⋮ Stable Delaunay graphs ⋮ BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES ⋮ Kinetic collision detection between two simple polygons. ⋮ Kinetic Maintenance of Mobile k-Centres on Trees ⋮ A sensor-based framework for kinetic data compression ⋮ A 2D advancing-front Delaunay mesh refinement algorithm ⋮ Bisecting three classes of lines ⋮ Connected dominating sets on dynamic geometric graphs ⋮ Out-of-order event processing in kinetic data structures ⋮ Kinetic spanners in \(\mathbb R^{d}\) ⋮ Kinetic facility location ⋮ Smooth kinetic maintenance of clusters ⋮ Approximation algorithm for the kinetic robust \(k\)-center problem ⋮ Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise ⋮ A clustering-based approach to kinetic closest pair ⋮ Deformable spanners and applications ⋮ Kinetic collision detection for balls ⋮ QuickhullDisk: a faster convex hull algorithm for disks ⋮ Practical methods for shape fitting and kinetic data structures using coresets ⋮ Kinetic collision detection for convex fat objects ⋮ Robust shape fitting via peeling and grating coresets ⋮ Kinetic maintenance of mobile \(k\)-centres on trees ⋮ Kinetic hanger ⋮ Ready, set, go! The Voronoi diagram of moving points that start from a line ⋮ THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION ⋮ Unnamed Item ⋮ Kinetic heap-ordered trees: Tight analysis and improved algorithms ⋮ A simple, faster method for kinetic proximity problems
This page was built for publication: Data Structures for Mobile Data
