Cluster Nested Loop <i>k</i>-Farthest Neighbor Join Algorithm for Spatial Networks
This paper considers <i>k</i>-farthest neighbor (<i>k</i>FN) join queries in spatial networks where the distance between two points is the length of the shortest path connecting them. Given a positive integer <i>k</i>, a set of query points <i>Q</i>, a...
Main Author: | Hyung-Ju Cho |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-02-01
|
Series: | ISPRS International Journal of Geo-Information |
Subjects: | |
Online Access: | https://www.mdpi.com/2220-9964/11/2/123 |
Similar Items
-
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) -
Fridtjof Nansen’s <i>Farthest North</i>: Scientific Report or Personal Account?
by: Silje Solheim Karlsen
Published: (2008-02-01) -
Robustness Analysis of Pin Joining
by: David Römisch, et al.
Published: (2022-10-01) -
Closest Farthest Widest
by: Kenneth Lange
Published: (2024-02-01)