The following pages link to Data Structures for Mobile Data (Q4240126):
Displaying 38 items.
- Kinetic clustering of points on the line (Q301594) (← links)
- Trajectory clustering of points in \(\mathbb{R}\) (Q324719) (← links)
- A sensor-based framework for kinetic data compression (Q482331) (← links)
- Out-of-order event processing in kinetic data structures (Q534768) (← links)
- Kinetic spanners in \(\mathbb R^{d}\) (Q540440) (← links)
- Collision detection for deforming necklaces (Q598233) (← links)
- A kinetic triangulation scheme for moving points in the plane (Q632719) (← links)
- Connected dominating sets on dynamic geometric graphs (Q691774) (← links)
- A clustering-based approach to kinetic closest pair (Q722518) (← links)
- Kinetic and dynamic data structures for convex hulls and upper envelopes (Q857064) (← links)
- Kinetic sorting and kinetic convex hulls (Q871059) (← links)
- Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions (Q908209) (← links)
- Stable Delaunay graphs (Q908210) (← links)
- Kinetic facility location (Q970606) (← links)
- Approximation algorithm for the kinetic robust \(k\)-center problem (Q982946) (← links)
- Practical methods for shape fitting and kinetic data structures using coresets (Q1006384) (← links)
- Kinetic collision detection for convex fat objects (Q1016518) (← links)
- Kinetic maintenance of mobile \(k\)-centres on trees (Q1028114) (← links)
- Kinetic hanger (Q1029070) (← links)
- Ready, set, go! The Voronoi diagram of moving points that start from a line (Q1029088) (← links)
- Kinetic collision detection between two simple polygons. (Q1428461) (← links)
- Smooth kinetic maintenance of clusters (Q1775777) (← links)
- Kinetic heap-ordered trees: Tight analysis and improved algorithms (Q1853697) (← links)
- Kinetic collision detection for balls (Q2032174) (← links)
- A 2D advancing-front Delaunay mesh refinement algorithm (Q2230400) (← links)
- Bisecting three classes of lines (Q2230403) (← links)
- QuickhullDisk: a faster convex hull algorithm for disks (Q2286150) (← links)
- A simple, faster method for kinetic proximity problems (Q2344057) (← links)
- Deformable spanners and applications (Q2507157) (← links)
- Topological stability of kinetic \(k\)-centers (Q2662690) (← links)
- BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES (Q3520427) (← links)
- Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise (Q3599150) (← links)
- PROBABILISTIC ANALYSIS FOR DISCRETE ATTRIBUTES OF MOVING POINTS (Q4818540) (← links)
- (Q5136297) (← links)
- Kinetic Maintenance of Mobile k-Centres on Trees (Q5387769) (← links)
- THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION (Q5485790) (← links)
- Robust shape fitting via peeling and grating coresets (Q5920504) (← links)
- Kinetic Geodesic Voronoi Diagrams in a Simple Polygon (Q6057802) (← links)
