New upper bounds for neighbor searching
From MaRDI portal
Publication:3727397
DOI10.1016/S0019-9958(86)80030-4zbMath0595.68055MaRDI QIDQ3727397
Bernard Chazelle, Richard John Cole, Chee-Keng Yap, Franco P. Preparata
Publication date: 1986
Published in: Information and Control (Search for Journal in Brave)
probabilistic algorithmcomputational geometryk-nearest neighborfiltering searchcircular range search
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Information storage and retrieval of data (68P20)
Related Items
Halfspace range search: An algorithmic application of k-sets ⋮ Computing the smallest \(k\)-enclosing circle and related problems ⋮ Neighbours on a grid ⋮ Selection in monotone matrices and computing k th nearest neighbors ⋮ A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids ⋮ Fractional cascading. II: Applications ⋮ Line arrangements and range search ⋮ TWO-DIMENSIONAL RANGE SEARCH BASED ON THE VORONOI DIAGRAM ⋮ Transitions in geometric minimum spanning trees ⋮ Range search on tuples of points ⋮ Unnamed Item ⋮ Generalizing Geometric Graphs ⋮ Efficient searching with linear constraints ⋮ Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions
