dc.citation.endPage |
188 |
- |
dc.citation.number |
2 |
- |
dc.citation.startPage |
179 |
- |
dc.citation.title |
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS |
- |
dc.citation.volume |
21 |
- |
dc.contributor.author |
Cheong, Otfried |
- |
dc.contributor.author |
Vigneron, Antoine |
- |
dc.contributor.author |
Yon, Juyoung |
- |
dc.date.accessioned |
2023-12-22T06:12:19Z |
- |
dc.date.available |
2023-12-22T06:12:19Z |
- |
dc.date.created |
2016-06-18 |
- |
dc.date.issued |
2011-04 |
- |
dc.description.abstract |
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) |
- |
dc.identifier.bibliographicCitation |
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, v.21, no.2, pp.179 - 188 |
- |
dc.identifier.doi |
10.1142/S0218195911003603 |
- |
dc.identifier.issn |
0218-1959 |
- |
dc.identifier.scopusid |
2-s2.0-79954495237 |
- |
dc.identifier.uri |
https://scholarworks.unist.ac.kr/handle/201301/19943 |
- |
dc.identifier.url |
http://www.worldscientific.com/doi/abs/10.1142/S0218195911003603 |
- |
dc.identifier.wosid |
000289373800003 |
- |
dc.language |
영어 |
- |
dc.publisher |
WORLD SCIENTIFIC PUBL CO PTE LTD |
- |
dc.title |
REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSION |
- |
dc.type |
Article |
- |
dc.description.journalRegisteredClass |
scie |
- |
dc.description.journalRegisteredClass |
scopus |
- |