Výsledky vyhledávání

Autor: Buchin, K., Buchin, M., Meulemans, W., Speckmann, B., Epstein, L., Ferragina, P.

Publikováno v: Computational Geometry, 76, 1-18. Elsevier
STARTPAGE=81;ENDPAGE=84;TITLE=None
20th European Symposium on Algorithms (ESA), 229-240
STARTPAGE=229;ENDPAGE=240;TITLE=20th European Symposium on Algorithms (ESA)
Algorithms – ESA 2012 ISBN: 9783642330896
ESA

The Frechet distance is a metric to compare two curves, which is based on monotone matchings between these curves. We call a matching that results in the Frechet distance a Frechet matching. There are often many different Frechet matchings and not al

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::511a180e81ca2a921c0e016a05f12dba
https://research.tue.nl/nl/publications/5a93ed18-5d51-4038-b4dd-f74a974fe081

Zobrazit plný text záznamu

Computing the Fréchet distance with a retractable leash

Autor: Buchin, K., Buchin, M., Leusden, van, R., Meulemans, W., Mulzer, W., Bodlaender, H.L., Italiano, G.F.

Publikováno v: 21st Annual European Symposium on Algorithms (ESA), 241-252
STARTPAGE=241;ENDPAGE=252;TITLE=21st Annual European Symposium on Algorithms (ESA)
Lecture Notes in Computer Science ISBN: 9783642404498
ESA

All known algorithms for the Fréchet distance between curves proceed in two steps: first, they construct an efficient oracle for the decision version; then they use this oracle to find the optimum among a finite set of critical values. We present a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f8aa963de126d556ab8cf4a1e34c0820
https://doi.org/10.1007/978-3-642-40450-4_21

Zobrazit plný text záznamu

Trajectory grouping structure

Autor: Buchin, K., Buchin, M., Kreveld, van, M.J., Speckmann, B., Staals, F., Dehne, F., Solis-Orba, R., Sack, J.-R.

Publikováno v: Lecture Notes in Computer Science ISBN: 9783642401039
WADS
Algorithms and Data Structures (13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings), 219-230
STARTPAGE=219;ENDPAGE=230;TITLE=Algorithms and Data Structures (13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings)

The collective motion of a set of moving entities like people, birds, or other animals, is characterized by groups arising, merging, splitting, and ending. Given the trajectories of these entities, we define and model a structure that captures all of

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::49853ddf6be7d720e9de4d739cd966c2
https://doi.org/10.1007/978-3-642-40104-6_19

Zobrazit plný text záznamu

Finding long and similar parts of trajectories

Autor: Buchin, K., Buchin, M., Kreveld, van, M.J., Luo, J., Wolfson, O., Agrawal, D., Lu, C.-T.

Publikováno v: Computational Geometry, 44(9), 465-476. Elsevier
Proceedings 17th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems (ACM-GIS 2009, Seattle WA, USA, November 4-6, 2009), 296-305
STARTPAGE=296;ENDPAGE=305;TITLE=Proceedings 17th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems (ACM-GIS 2009, Seattle WA, USA, November 4-6, 2009)
GIS

A natural time-dependent similarity measure for two trajectories is their average distance at corresponding times. We give algorithms for computing the most similar subtrajectories under this measure, assuming the two trajectories are given as two po

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::10cfca0f8c5372dfc2421d4d623abf82

Zobrazit plný text záznamu

Conference

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Model-based segmentation and classification of trajectories (Extended abstract)

Autor: Alewijnse, S.P.A., Buchin, K., Buchin, M., Sijben, S., Westenberg, M.A.

Publikováno v: 30th European Workshop on Computational Geometry (EuroCG 2014, Ein-Gedi, Israel, March 3-5, 2014), 1-4
STARTPAGE=1;ENDPAGE=4;TITLE=30th European Workshop on Computational Geometry (EuroCG 2014, Ein-Gedi, Israel, March 3-5, 2014)

We present efficient algorithms for segmenting and classifying a trajectory based on a parameterized movement model like the Brownian bridge movement model. Segmentation is the problem of subdividing a trajectory into parts such that each art is homo

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::9c20bf8796eaddf0cd258a0c6514c278
https://research.tue.nl/nl/publications/c9d6754b-e388-4c21-a2d2-63f7d3756d6f

Zobrazit plný text záznamu

Four Soviets walk the dog, with an application to Alt's conjecture

Autor: Buchin, K., Buchin, M., Meulemans, W., Mulzer, W., Chekuri, C.

Publikováno v: 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1399-1413
STARTPAGE=1399;ENDPAGE=1413;TITLE=25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)

Given two polygonal curves in the plane, there are many ways to define a notion of similarity between them. One measure that is extremely popular is the Fréchet distance. Since it has been proposed by Alt and Godau in 1992, many variants and extensi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b8158a9d1586c61a58cefe72adab19b
https://research.tue.nl/nl/publications/d78689ef-71b1-4802-9a92-73362965232d

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání