Trajectory similarity computation is a fundamental problem for various applications in
trajectory data analysis. However, the high computation cost of existing trajectory similarity …

Trajectory similarity computation is the cornerstone of many applications in the field of
trajectory data analysis. To cope with the high time complexity of calculating exact similarity …

We propose a model for subtrajectory clustering---the clustering of subsequences of
trajectories; each cluster of subtrajectories is represented as a pathlet, a sequence of points …

Abstract Emerging Urban Air Mobility (UAM) operations are expected to introduce novel air
traffic networks in metropolitan areas in order to provide on-demand air transportation …

Center-based clustering, in particular k-means clustering, is frequently used for point data.
Its advantages include that the resulting clustering is often easy to interpret and that the …

En-route congestion causes delays in air traffic networks and will become more prominent
as air traffic demand will continue to increase yet airspace volume cannot grow. However …

Map inference algorithm aims to construct a digital map from other data sources
automatically. Due to the labour intensity of traditional map creation and the frequent road …

We show by reduction from the Orthogonal Vectors problem that algorithms with strongly
subquadratic running time cannot approximate the Fréchet distance between curves better …

We study several polygonal curve problems under the Fréchet distance via algebraic
geometric methods. Let 𝕏 dm and 𝕏 dk be the spaces of all polygonal curves of m and k …

Let m and n be the numbers of vertices of two polygonal curves in ℝ d for any fixed d such
that m≤ n. Since it was known in 1995 how to compute the Fréchet distance of these two …