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...

ver descrição completa

Na minha lista:
Detalhes bibliográficos
Main Authors: Jing Li, Xuantong Wang, Tong Zhang, You Xu
Formato: Artigo
Idioma:Inglês
Publicado em: MDPI AG 2018-06-01
Colecção:ISPRS International Journal of Geo-Information
Assuntos:
trajectory
similarity search
parallel computing
GPGPU
CUDA
Acesso em linha:http://www.mdpi.com/2220-9964/7/7/239
Tags: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!

Registos relacionados