Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points
type: Item
instance of: scholarly article
title: Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points
zbMATH Open document ID: 1381.65019
author: Timothy M. Chan
author: Zahed Rahmati
published in: Computational Geometry
publication date: 2018-01-22T00:00:00Z
Mathematics Subject Classification ID: 65D18
zbMATH DE Number: 6828434
zbMATH Keywords: closest pair distance
zbMATH Keywords: nearest neighbor distances
zbMATH Keywords: nearest neighbor search
zbMATH Keywords: kinetic algorithms
zbMATH Keywords: linearly moving points
MaRDI profile type: Publication
full work available at URL: j.comgeo.2016.04.001
OpenAlex ID: W2339879713
cites work: Fast algorithms for collision and proximity problems involving moving geometric objects
cites work: Higher harmonic resonances in free convection between vertical parallel plates
cites work: Q5501289
cites work: Approximating extent measures of points
cites work: Q4140384
cites work: An optimal algorithm for approximate nearest neighbor searching fixed dimensions
cites work: Approximate Nearest Line Search in High Dimensions
cites work: Approximate k -flat Nearest Neighbor Search
cites work: Kinetic and dynamic data structures for closest pair and all nearest neighbors
cites work: A simple, faster method for kinetic proximity problems
cites work: APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
cites work: On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
cites work: Q4225298
cites work: Optimal partition trees
cites work: Range searching with efficient hierarchical cuttings
cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms
cites work: Kinetic connectivity for unit disks
DOI: 10.1016/J.COMGEO.2016.04.001
description: scientific article; zbMATH DE number 6828434