The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection

DOI10.1145/2582112.2582155zbMath1395.68290arXiv1310.5245OpenAlexW1983449524MaRDI QIDQ4635562

Omrit Filtser, Rinat Ben-Avraham, Haim Kaplan, Micha Sharir, Matthew J. Katz

Publication date: 23 April 2018

Published in: Proceedings of the thirtieth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.5245

zbMATH Keywords

outliersshortcutsgeometric optimizationcurve matchingdiscrete Fréchet distanceapproximate distance selection and counting

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (2)

On the Chain Pair Simplification Problem ⋮ Unnamed Item

This page was built for publication: The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection