New upper bounds for neighbor searching
From MaRDI portal
Publication:3727397
Recommendations
Cited in
(19)- Generalizing geometric graphs
- scientific article; zbMATH DE number 3919834 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 7559117 (Why is no real title available?)
- Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions
- Halfspace range search: An algorithmic application of k-sets
- Range search on tuples of points
- More Nearly Optimal Algorithms for Unbounded Searching, II:The Transfinite Case
- 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?
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)