|
|
|
|
|
Hyung-Ju Cho
Given a set of facilities F and a query point q, a k-farthest neighbor (kFN) query returns the k farthest facilities f1,f1,⋯,fk" role="presentation">??1,??1,?,????f1,f1,?,fk
f
1
,
f
1
,
?
,
f
k
from q. This study considers the moving k-farthe...
ver más
|
|
|
|
|