Smooth kinetic maintenance of clusters

DOI10.1016/J.COMGEO.2004.02.004MaRDI QIDQ1775777zbMATH OpenOpenAlexFDO

Authors John Hershberger

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

zbMATH Keywords

clusteringkinetic data structure

Mathematics Subject Classification ID

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

Recommendations

• Smooth kinetic maintenance of clusters
• A clustering-based approach to kinetic closest pair
• Discrete mobile centers
• A Clustering-Based Approach to Kinetic Closest Pair
• Discrete mobile centers

Cites work

• scientific article; zbMATH DE number 1947377 (Why is no real title available?)
• scientific article; zbMATH DE number 1926669 (Why is no real title available?)
• Approximation schemes for covering and packing problems in image processing and VLSI
• Data Structures for Mobile Data
• Discrete mobile centers
• Maintaining approximate extent measures of moving points
• NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
• Optimal packing and covering in the plane are NP-complete
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms

Cited in

(10)

• Kinetic facility location
• THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION
• Discrete mobile centers
• A clustering-based approach to kinetic closest pair
• Smooth kinetic maintenance of clusters
• Kinetic clustering of points on the line
• Kinetic Maintenance of Mobile k-Centres on Trees
• Discrete mobile centers
• The projection median of a set of points
• BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES

This page was built for publication: Smooth kinetic maintenance of clusters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1775777)