A clustering-based approach to kinetic closest pair

DOI10.1007/S00453-017-0338-9zbMATH Open1391.68115OpenAlexW2640136065MaRDI QIDQ722518FDOQ722518

Authors: Zahed Rahmati, Timothy M. Chan 

Publication date: 26 July 2018

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/6050/

Recommendations

• A Clustering-Based Approach to Kinetic Closest Pair
• Kinetic and dynamic data structures for closest pair and all nearest neighbors
• Kinetic data structures for all nearest neighbors and closest pair in the plane
• A simple, faster method for kinetic proximity problems
• Approximate $k$-Nearest Neighbor Graph on Moving Points

zbMATH Keywords

clusteringclosest pairkinetic data structureall nearest neighborsmoving points

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Almost optimal set covers in finite VC-dimension
• Approximation schemes for covering and packing problems in image processing and VLSI
• Discrete mobile centers
• Smooth kinetic maintenance of clusters
• Data Structures for Mobile Data
• Optimal packing and covering in the plane are NP-complete
• Covering a set of points in multidimensional space
• Kinetic and dynamic data structures for closest pair and all nearest neighbors
• A simple, faster method for kinetic proximity problems
• Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points
• A Clustering-Based Approach to Kinetic Closest Pair

Cited In (7)

• Kinetic facility location
• A Clustering-Based Approach to Kinetic Closest Pair
• Kinetic reverse \(k\)-nearest neighbor problem
• Kinetic clustering of points on the line
• The Kinetic Facility Location Problem
• Smooth kinetic maintenance of clusters
• Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points

This page was built for publication: A clustering-based approach to kinetic closest pair

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