{"paper":{"title":"ANN queries: covering Voronoi diagram with hyperboxes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Rajasekhar Inkulu, Sanjiv Kapoor","submitted_at":"2011-11-25T05:23:06Z","abstract_excerpt":"Given a set $S$ of $n$ points in $d$-dimensional Euclidean metric space $X$ and a small positive real number $\\epsilon$, we present an algorithm to preprocess $S$ and answer queries that require finding a set $S' \\subseteq S$ of $\\epsilon$-approximate nearest neighbors (ANNs) to a given query point $q \\in X$. The following are the characteristics of points belonging to set $S'$:\n  - $\\forall s \\in S'$, $\\exists$ a point $p \\in X$ such that $|pq| \\le \\epsilon$ and the nearest neighbor of $p$ is $s$, and\n  - $\\exists$ a $s' \\in S'$ such that $s'$ is a nearest neighbor of $q$.\n  During the prepro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5893","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}