An O(log⁡n) query time algorithm for reducing ϵ-NN to (c,r)-NN

The problem of reducing ϵ-NN to (c,r)-NN is very important in theoretical computer science area and has attracted many research efforts. In this paper a new algorithm for such problem is proposed, which achieves O(log⁡n) query time. Comparing with the former algorithms for the same problem, this que...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 803; pp. 178 - 195
Main Authors Ma, Hengzhao, Li, Jianzhong
Format Journal Article
LanguageEnglish
Published Elsevier B.V 10.01.2020
Subjects
Approximate nearest neighbor
Computation geometry
Reduction
Approximate nearest neighbor
Computation geometry
Reduction
Online AccessGet full text

Cover

More Information
Summary:The problem of reducing ϵ-NN to (c,r)-NN is very important in theoretical computer science area and has attracted many research efforts. In this paper a new algorithm for such problem is proposed, which achieves O(log⁡n) query time. Comparing with the former algorithms for the same problem, this query time is the lowest, which is the main contribution of this paper. The low query time complexity is achieved by raising the preprocessing time and space complexity. How to reduce the cost added into the two complexities is also discussed in this paper.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2019.10.004