scientific article; zbMATH DE number 7204982
From MaRDI portal
Publication:5111687
DOI10.4230/LIPICS.ESA.2017.4zbMATH Open1442.68246MaRDI QIDQ5111687FDOQ5111687
Authors: Natan Rubin, Pankaj K. Agarwal, Micha Sharir
Publication date: 27 May 2020
Title of this publication is not available (Why is that?)
Recommendations
- Approximate \(k\)-flat nearest neighbor search
- Approximate nearest neighbor search in high dimensions
- scientific article; zbMATH DE number 437552
- Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
- scientific article; zbMATH DE number 1775451
- scientific article; zbMATH DE number 6783438
- Approximate nearest neighbor search for low-dimensional queries
- Approximate nearest neighbor queries revisited
- New directions in approximate nearest-neighbor searching
approximate nearest neighbor search\(k\)-flatslinear programming queriespolyhedral distance functions
Data structures (68P05) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Voronoi diagrams and Delaunay triangulations
- Geometric approximation algorithms
- Optimal partition trees
- Range searching with efficient hierarchical cuttings
- Higher-dimensional Voronoi diagrams in linear expected time
- Approximate closest-point queries in high dimensions
- Metric entropy of some classes of sets with differentiable boundaries
- Polyhedral Voronoi diagrams of polyhedra in three dimensions
- Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions
- Dimensionality reductions in \(\ell_{2}\) that preserve volumes and distance to affine spaces
- Approximate range searching
- Title not available (Why is that?)
- Approximate \(k\)-flat nearest neighbor search
- Approximate nearest line search in high dimensions
- Simplex Range Searching and Its Variants: A Review
- 3-Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations
- Title not available (Why is that?)
- Beyond locality-sensitive hashing
- Space-efficient approximate Voronoi diagrams
- Title not available (Why is that?)
- Optimal approximate polytope membership
- Approximate line nearest neighbor in high dimensions
- Title not available (Why is that?)
Cited In (4)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111687)