BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES

DOI10.1142/S021819590800257XzbMath1155.65018MaRDI QIDQ3520427

Stephane Durocher, David G. Kirkpatrick

Publication date: 26 August 2008

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

facility location problem; mobile facility; mobile client; mobile Euclidean 2-centre

Mathematics Subject Classification ID

68U07: Computer science aspects of computer-aided design

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

65D18: Numerical aspects of computer graphics, image analysis, and computational geometry

Related Items

Kinetic Maintenance of Mobile k-Centres on Trees, Covering moving points with anchored disks, The projection median of a set of points, Kinetic maintenance of mobile \(k\)-centres on trees, Median trajectories

Cites Work

• Unnamed Item
• A faster algorithm for the two-center decision problem
• A near-linear algorithm for the planar 2-center problem
• Discrete mobile centers
• Smooth kinetic maintenance of clusters
• Lower bounds for covering problems
• More planar two-center algorithms
• Dynamic Three-Dimensional Linear Programming
• Data Structures for Mobile Data
• A new heuristic approach for the P-median problem
• An Expander-Based Approach to Geometric Optimization
• Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions
• THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION
• Maintaining the extent of a moving point set