From post

The k-Fréchet Distance: How to Walk Your Dog While Teleporting.

, , , и . ISAAC, том 149 из LIPIcs, стр. 50:1-50:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Augmenting Planar Straight Line Graphs to 2-Edge-Connectivity., , , , и . GD, том 9411 из Lecture Notes in Computer Science, стр. 563-564. Springer, (2015)The k-Fréchet Distance: How to Walk Your Dog While Teleporting., , , и . ISAAC, том 149 из LIPIcs, стр. 50:1-50:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Reconstruction of Weakly Simple Polygons from their Edges., и . ISAAC, том 64 из LIPIcs, стр. 10:1-10:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Robot Development and Path Planning for Indoor Ultraviolet Light Disinfection., , , , , , , и . ICRA, стр. 7795-7801. IEEE, (2021)Box Pleating is Hard., , , , , , , и . JCDCGG, том 9943 из Lecture Notes in Computer Science, стр. 167-179. Springer, (2015)Recognizing Weakly Simple Polygons., , , и . SoCG, том 51 из LIPIcs, стр. 8:1-8:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)