scientific article
From MaRDI portal
Publication:3140429
zbMath0801.68161MaRDI QIDQ3140429
Publication date: 21 December 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (23)
A strong lower bound for approximate nearest neighbor searching ⋮ 6D SLAM-3D mapping outdoor environments ⋮ Topology B-trees and their applications ⋮ Robust multi-view feature matching from multiple unordered views ⋮ Fast spectral analysis for approximate nearest neighbor search ⋮ Proximate point searching ⋮ Boundary layer mesh generation with fast collision detection ⋮ Accounting for boundary effects in nearest-neighbor searching ⋮ Part-Based Segmentation by Skeleton Cut Space Analysis ⋮ Decomposable algorithms for nearest neighbor computing ⋮ Distance-based index structures for fast similarity search ⋮ Concurrent linearizable nearest neighbour search in LockFree-kD-tree ⋮ Efficient data structures for model-free data-driven computational mechanics ⋮ Group nearest-neighbor queries in the \(L_1\) plane ⋮ Tighter lower bounds for nearest neighbor search and related problems in the cell probe model ⋮ Index structures for fast similarity search for real vectors. II ⋮ Numerical simulations of the steady Navier–Stokes equations using adaptive meshing schemes ⋮ Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions ⋮ An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN ⋮ Kernel-independent adaptive construction of \(\mathcal{H}^2\)-matrix approximations ⋮ Kaldor-Kalecki new model on business cycles ⋮ Chromatic nearest neighbor searching: A query sensitive approach ⋮ On approximate nearest neighbors under \(l_\infty\) norm
This page was built for publication:
