Folding Free-Space Diagrams

preview_player
Показать описание
We analyse the computational complexity of the Fréchet distance between curves in 1 dimension. We exploit a folding-and-cutting connection to show that, if at least one curve has bounded ply, the time complexity is subquadratic.

Joint work with Kevin Buchin, Jinhee Chun, Aleksandar Markovic, Wouter Meulemans, Yoshio Okamoto and Taichi Shiitada.
Рекомендации по теме
Комментарии
Автор

Great video! I wish there was more video material on youtube regarding Frechét distance.

SirCobraXI