New upper bounds for neighbor searching
From MaRDI portal
Publication:3727397
DOI10.1016/S0019-9958(86)80030-4zbMATH Open0595.68055MaRDI QIDQ3727397FDOQ3727397
Authors: Bernard Chazelle, Richard Cole, F. P. Preparata, Chee K. Yap 
Publication date: 1986
Published in: Information and Control (Search for Journal in Brave)
Recommendations
computational geometryprobabilistic algorithmk-nearest neighborfiltering searchcircular range search
Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)
Cited In (19)
- Title not available (Why is that?)
- Efficient searching with linear constraints
- Line arrangements and range search
- Selection in monotone matrices and computing k th nearest neighbors
- Transitions in geometric minimum spanning trees
- Computing the smallest \(k\)-enclosing circle and related problems
- Title not available (Why is that?)
- Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions
- Halfspace range search: An algorithmic application of k-sets
- More Nearly Optimal Algorithms for Unbounded Searching, II:The Transfinite Case
- Range search on tuples of points
- Fixed-radius near neighbors search algorithms for points and segments
- TWO-DIMENSIONAL RANGE SEARCH BASED ON THE VORONOI DIAGRAM
- A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids
- Neighbours on a grid
- Filtering Search: A New Approach to Query-Answering
- Fractional cascading. II: Applications
- Can nearest neighbor searching be simple and always fast?
- Generalizing geometric graphs
This page was built for publication: New upper bounds for neighbor searching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3727397)
