Efficient Parallel K Best Connected Trajectory (K-BCT) Query with GPGPU: A Combinatorial Min-Distance and Progressive Bounding Box Approach

Efficient Parallel K Best Connected Trajectory (K-BCT) Query with GPGPU: A Combinatorial Min-Distance and Progressive Bounding Box Approach

Performing similarity analysis on trajectories consisting of massive numbers of tracking points is computationally challenging. We introduce a progressive minimum bounding rectangle (MBR) and minimum distance (MINDIST) approach to process the K Best Connected Trajectory (K-BCT) query, which aims to...

Full description

Bibliographic Details
Main Authors: Jing Li, Xuantong Wang, Tong Zhang, You Xu
Format: Article
Language:English
Published: MDPI AG 2018-06-01
Series:ISPRS International Journal of Geo-Information
Subjects:
trajectory
similarity search
parallel computing
GPGPU
CUDA
Online Access:http://www.mdpi.com/2220-9964/7/7/239

Internet

http://www.mdpi.com/2220-9964/7/7/239

Similar Items