Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points

DOI10.1016/J.COMGEO.2016.04.001zbMATH Open1381.65019OpenAlexW2339879713MaRDI QIDQ680145FDOQ680145

Authors: Timothy M. Chan, Zahed Rahmati 

Publication date: 22 January 2018

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2016.04.001

Recommendations

• Kinetic and dynamic data structures for closest pair and all nearest neighbors
• A clustering-based approach to kinetic closest pair
• Approximate $k$-Nearest Neighbor Graph on Moving Points
• A Clustering-Based Approach to Kinetic Closest Pair
• New Techniques for Exact and Approximate Dynamic Closest-Point Problems

zbMATH Keywords

nearest neighbor searchclosest pair distancekinetic algorithmslinearly moving pointsnearest neighbor distances

Mathematics Subject Classification ID

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

Cites Work

• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• Approximating extent measures of points.
• Title not available (Why is that?)
• Optimal partition trees
• Range searching with efficient hierarchical cuttings
• APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
• Title not available (Why is that?)
• Fast algorithms for collision and proximity problems involving moving geometric objects
• Kinetic and dynamic data structures for closest pair and all nearest neighbors
• A simple, faster method for kinetic proximity problems
• Approximate k -flat Nearest Neighbor Search
• Title not available (Why is that?)
• Higher harmonic resonances in free convection between vertical parallel plates
• Approximate Nearest Line Search in High Dimensions
• Kinetic connectivity for unit disks

Cited In (4)

• People mover's distance: class level geometry using fast pairwise data adaptive transportation costs
• A clustering-based approach to kinetic closest pair
• Maintaining approximate extent measures of moving points
• Approximate $k$-Nearest Neighbor Graph on Moving Points

This page was built for publication: Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points

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