Similarity of polygonal curves in the presence of outliers
From MaRDI portal
Publication:2444314
DOI10.1016/j.comgeo.2014.01.002zbMath1287.65013arXiv1212.1617OpenAlexW2042670297WikidataQ62037424 ScholiaQ62037424MaRDI QIDQ2444314
Jean-Lou De Carufel, Christian Scheffer, Jörg-Rüdiger Sack, Amin Gheibi, Anil Maheshwari
Publication date: 9 April 2014
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.1617
Related Items (5)
Approximating the integral Fréchet distance ⋮ The prefix Fréchet similarity ⋮ On length-sensitive Fréchet similarity ⋮ A note on the unsolvability of the weighted region shortest path problem ⋮ More Flexible Curve Matching via the Partial Fréchet Similarity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces
- The algebraic degree of geometric optimization problems
- The complexity of the free space for a robot moving amidst fat obstacles
- A note on the unsolvability of the weighted region shortest path problem
- Median trajectories
- DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES
- SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE
- Computing the Fréchet distance with shortcuts is NP-hard
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- Better bounds on the union complexity of locally fat objects
This page was built for publication: Similarity of polygonal curves in the presence of outliers
