DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES

DOI10.1142/S0218195911003652zbMath1227.65024MaRDI QIDQ3089091

Kevin Buchin, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Maike Buchin

Publication date: 23 August 2011

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

trajectoriesalgorithmsFréchet distancedetecting commuting patterns

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Computing the similarity between moving curves ⋮ Locally correct Fréchet matchings ⋮ Median trajectories ⋮ Computing the Fréchet distance with a retractable leash ⋮ Four Soviets walk the dog: improved bounds for computing the Fréchet distance ⋮ Compact Flow Diagrams for State Sequences ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Middle curves based on discrete Fréchet distance ⋮ Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds ⋮ Similarity of polygonal curves in the presence of outliers ⋮ Finding long and similar parts of trajectories ⋮ Computing the Fréchet gap distance ⋮ Model-based segmentation and classification of trajectories ⋮ Weighted minimum backward Fréchet distance ⋮ Optimizing airspace closure with respect to politicians' egos

Cites Work

• Unnamed Item
• On \(k\)-sets in arrangements of curves and surfaces
• A simple algorithm for determining the envelope of a set of lines
• Better lower bounds on detecting affine and spherical degeneracies
• Clique is hard to approximate within \(n^{1-\epsilon}\)
• Comparison of distance measures for planar curves
• On a class of \(O(n^ 2)\) problems in computational geometry
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• On Envelopes of Arrangements of Lines

This page was built for publication: DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES