scientific article; zbMATH DE number 7204982
From MaRDI portal
Publication:5111687
DOI10.4230/LIPIcs.ESA.2017.4zbMath1442.68246MaRDI QIDQ5111687
Natan Rubin, Pankaj K. Agarwal, Micha Sharir
Publication date: 27 May 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
approximate nearest neighbor search\(k\)-flatslinear programming queriespolyhedral distance functions
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal partition trees
- Range searching with efficient hierarchical cuttings
- Higher-dimensional Voronoi diagrams in linear expected time
- Approximate closest-point queries in high dimensions
- Polyhedral Voronoi diagrams of polyhedra in three dimensions
- Approximate range searching
- Metric entropy of some classes of sets with differentiable boundaries
- Dimensionality reductions in \(\ell_{2}\) that preserve volumes and distance to affine spaces
- Voronoi Diagrams and Delaunay Triangulations
- Approximate k -flat Nearest Neighbor Search
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Space-efficient approximate Voronoi diagrams
- Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions
- Optimal Approximate Polytope Membership
- Simplex Range Searching and Its Variants: A Review
- 3-Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations
- Approximate Nearest Line Search in High Dimensions
- Beyond Locality-Sensitive Hashing
This page was built for publication:
