Reverse Nearest Neighbor Queries in Fixed Dimension

Cited 5 time in webofscience Cited 0 time in scopus
  • Hit : 581
  • Download : 0
Reverse nearest neighbor queries are defined as follows: Given an input point set P. and a query point q, find all the points p in P whose nearest point in P boolean OR {q} \ {p} is q. We give a data structure to answer reverse nearest neighbor queries in fixed-dimensional Euclidean space. Our data structure uses O(n) space, its preprocessing time is O(n log n), and its query time is O(log n).
Publisher
WORLD SCIENTIFIC PUBL CO PTE LTD
Issue Date
2011-04
Language
English
Article Type
Article
Keywords

QUADTREES; SEARCH

Citation

INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY APPLICATIONS, v.21, no.2, pp.179 - 188

ISSN
0218-1959
DOI
10.1142/S0218195911003603
URI
http://hdl.handle.net/10203/96246
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 5 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0