A Voronoi-Based Group Reverse k Farthest Neighbor Query Method in the Obstacle Space
With the rapid development of intelligent transportation and geographic information system, spatial data query technology has attracted the attention of many scholars. Among them, the reverse farthest neighbor query from the data point to find the target point as its farthest adjacent data points, u...
Main Authors: | Yongshan Liu, Xiang Gong, Dehan Kong, Tianbao Hao, Xiaoqi Yan |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9031413/ |
Similar Items
-
Optimized Number of Reverse Neighbor Clustering Algorithm by Voronoi Diagram in Obstacle Space
by: HE Yunbin, LIU Wanxu, WAN Jing
Published: (2022-09-01) -
Group Processing of Multiple k-Farthest Neighbor Queries in Road Networks
by: Hyung-Ju Cho, et al.
Published: (2020-01-01) -
The Efficient Processing of Moving <i>k</i>-Farthest Neighbor Queries in Road Networks
by: Hyung-Ju Cho
Published: (2022-06-01) -
A Novel Density based Clustering Method using Nearest and Farthest Neighbor with PCA
by: Azadeh Faroughi, et al.
Published: (2017-06-01) -
Cluster Nested Loop <i>k</i>-Farthest Neighbor Join Algorithm for Spatial Networks
by: Hyung-Ju Cho
Published: (2022-02-01)