Author of the publication

A Middle Curve Based on Discrete Fréchet Distance.

, , , , , and . LATIN, volume 9644 of Lecture Notes in Computer Science, page 14-26. Springer, (2016)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

10491 Results of the break-out group: Gulls Data., , , , , , , and . Representation, Analysis and Visualization of Moving Objects, volume 10491 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2010)Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability, , , , , , and . Arxiv report, (June 2008)Available at http://arxiv.org/abs/0806.0920.Approximating Length-Restricted Means Under Dynamic Time Warping., , , , and . WAOA, volume 13538 of Lecture Notes in Computer Science, page 225-253. Springer, (2022)Improved Map Construction using Subtrajectory Clustering., , , , , , , , , and . LocalRec@SIGSPATIAL, page 5:1-5:4. ACM, (2020)Triangulations in Geometry and Topology (Dagstuhl Seminar 24072)., , , , and . Dagstuhl Reports, 14 (2): 120-163 (2024)Dynamic L-Budget Clustering of Curves., , , , , and . SWAT, volume 294 of LIPIcs, page 18:1-18:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Realizability of Free Spaces of Curves., , , , and . ISAAC, volume 283 of LIPIcs, page 3:1-3:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Distance Measures for Embedded Graphs., , , , and . ISAAC, volume 149 of LIPIcs, page 55:1-55:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Anonymous Routing Using Minimum Capacity Clustering (Short Paper)., and . GIScience, volume 277 of LIPIcs, page 18:1-18:6. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Detecting single file movement., , and . GIS, page 33. ACM, (2008)