Smooth kinetic maintenance of clusters
From MaRDI portal
Publication:1775777
DOI10.1016/j.comgeo.2004.02.004zbMath1072.65022OpenAlexW4210283493MaRDI QIDQ1775777
Publication date: 4 May 2005
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.02.004
Related Items (7)
Kinetic clustering of points on the line ⋮ BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES ⋮ Kinetic Maintenance of Mobile k-Centres on Trees ⋮ Kinetic facility location ⋮ A clustering-based approach to kinetic closest pair ⋮ The projection median of a set of points ⋮ THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION
Cites Work
- Optimal packing and covering in the plane are NP-complete
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- Approximation schemes for covering and packing problems in image processing and VLSI
- Data Structures for Mobile Data
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
- Discrete mobile centers
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Smooth kinetic maintenance of clusters
