Discrete mobile centers

DOI10.1007/s00454-003-2925-6zbMath1038.68131MaRDI QIDQ1404530

D. Massart

Publication date: 21 August 2003

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-003-2925-6

zbMATH Keywords

kinetic data structure

Mathematics Subject Classification ID

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

Related Items

Kinetic Maintenance of Mobile k-Centres on Trees, Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes, THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION, Constant-time distributed dominating set approximation, Kinetic clustering of points on the line, Trajectory clustering of points in \(\mathbb{R}\), Minimum enclosing circle of a set of fixed points and a mobile point, Covering moving points with anchored disks, Distributed approximation of capacitated dominating sets, Robot navigation in a decentralized landmark-free sensor network, A clustering-based approach to kinetic closest pair, An update algorithm for restricted random walk clustering for dynamic data sets, Kinetic and dynamic data structures for convex hulls and upper envelopes, Kinetic facility location, Kinetic maintenance of mobile \(k\)-centres on trees, Plane hop spanners for unit disk graphs: simpler and better, Deformable spanners and applications, Topological stability of kinetic \(k\)-centers, BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES