Data Structures for Mobile Data
From MaRDI portal
Publication:4240126
DOI10.1006/JAGM.1998.0988zbMATH Open0928.68034OpenAlexW243610207MaRDI QIDQ4240126FDOQ4240126
Authors: Julien Basch, Leonidas Guibas, John Hershberger 
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
Recommendations
Cited In (44)
- Out-of-order event processing in kinetic data structures
- QuickhullDisk: a faster convex hull algorithm for disks
- Practical methods for shape fitting and kinetic data structures using coresets
- Connected dominating sets on dynamic geometric graphs
- Ready, set, go! The Voronoi diagram of moving points that start from a line
- Kinetic facility location
- Kinetic spanners in \(\mathbb R^{d}\)
- Kinetic and dynamic data structures for convex hulls and upper envelopes
- A frequency-competitive query strategy for maintaining low collision potential among moving entities
- Bisecting three classes of lines
- Robust shape fitting via peeling and grating coresets
- Maintaining Reeb graphs of triangulated 2-manifolds
- Approximation algorithm for the kinetic robust \(k\)-center problem
- Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions
- THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION
- Kinetic Geodesic Voronoi Diagrams in a Simple Polygon
- PROBABILISTIC ANALYSIS FOR DISCRETE ATTRIBUTES OF MOVING POINTS
- Algorithms – ESA 2004
- A 2D advancing-front Delaunay mesh refinement algorithm
- A clustering-based approach to kinetic closest pair
- A simple, faster method for kinetic proximity problems
- Kinetic sorting and kinetic convex hulls
- Kinetic clustering of points on the line
- Kinetic collision detection for balls
- Kinetic Maintenance of Mobile k-Centres on Trees
- Kinetic dictionaries: how to shoot a moving target
- Kinetic collision detection for convex fat objects
- Trajectory clustering of points in \(\mathbb{R}\)
- Kinetic maintenance of mobile \(k\)-centres on trees
- Kinetic hanger
- Collision detection for deforming necklaces
- A kinetic triangulation scheme for moving points in the plane
- A computational framework for incremental motion
- A sensor-based framework for kinetic data compression
- Soft kinetic data structures
- Stable Delaunay graphs
- Smooth kinetic maintenance of clusters
- Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise
- Kinetic heap-ordered trees: Tight analysis and improved algorithms
- Kinetic collision detection between two simple polygons.
- BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES
- Deformable spanners and applications
- Topological stability of kinetic \(k\)-centers
- Minimizing query frequency to bound congestion potential for moving entities at a fixed target time
This page was built for publication: Data Structures for Mobile Data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4240126)
