scientific article; zbMATH DE number 7204982

DOI10.4230/LIPICS.ESA.2017.4MaRDI QIDQ5111687zbMATH OpenFDO

Authors Natan Rubin, Pankaj K. Agarwal, Micha Sharir

Publication date 27 May 2020

zbMATH Keywords

approximate nearest neighbor search\(k\)-flatslinear programming queriespolyhedral distance functions

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

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

Cites work

• scientific article; zbMATH DE number 5764809 (Why is no real title available?)
• scientific article; zbMATH DE number 1099195 (Why is no real title available?)
• scientific article; zbMATH DE number 1182924 (Why is no real title available?)
• scientific article; zbMATH DE number 1775450 (Why is no real title available?)
• scientific article; zbMATH DE number 6876122 (Why is no real title available?)
• scientific article; zbMATH DE number 2119656 (Why is no real title available?)
• 3-Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Approximate \(k\)-flat nearest neighbor search
• Approximate closest-point queries in high dimensions
• Approximate line nearest neighbor in high dimensions
• Approximate nearest line search in high dimensions
• Approximate range searching
• Beyond locality-sensitive hashing
• Dimensionality reductions in \(\ell_{2}\) that preserve volumes and distance to affine spaces
• Geometric approximation algorithms
• Higher-dimensional Voronoi diagrams in linear expected time
• Metric entropy of some classes of sets with differentiable boundaries
• Optimal approximate polytope membership
• Optimal partition trees
• Polyhedral Voronoi diagrams of polyhedra in three dimensions
• Range searching with efficient hierarchical cuttings
• Simplex Range Searching and Its Variants: A Review
• Space-efficient approximate Voronoi diagrams
• Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions
• Voronoi diagrams and Delaunay triangulations

Cited in

(4)

• Approximate \(k\)-flat nearest neighbor search
• Approximate nearest line search in high dimensions
• scientific article; zbMATH DE number 6783438 (Why is no real title available?)
• Approximate line nearest neighbor in high dimensions

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)