Kevin Buchin
Kevin Buchin
Associate Professor of Computer Science, Technical University Eindhoven
Bestätigte E-Mail-Adresse bei tue.nl - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Flow map layout via spiral trees
K Buchin, B Speckmann, K Verbeek
IEEE transactions on visualization and computer graphics 17 (12), 2536-2544, 2011
1612011
Analysis and visualisation of movement: an interdisciplinary review
U Demšar, K Buchin, F Cagnacci, K Safi, B Speckmann, N Van de Weghe, ...
Movement ecology 3 (1), 1-24, 2015
1352015
Detecting commuting patterns by clustering subtrajectories
K Buchin, M Buchin, J Gudmundsson, M Löffler, J Luo
International Journal of Computational Geometry & Applications 21 (03), 253-282, 2011
1142011
Exact algorithms for partial curve matching via the Fréchet distance
K Buchin, M Buchin, Y Wang
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
1022009
Finding long and similar parts of trajectories
K Buchin, M Buchin, M Van Kreveld, J Luo
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances …, 2009
972009
Detecting commuting patterns by clustering subtrajectories
K Buchin, M Buchin, J Gudmundsson, M Löffler, J Luo
International Symposium on Algorithms and Computation, 644-655, 2008
722008
Median trajectories
K Buchin, M Buchin, M Van Kreveld, M Löffler, RI Silveira, C Wenk, ...
Algorithmica 66 (3), 595-614, 2013
632013
Constrained free space diagrams: a tool for trajectory analysis
K Buchin, M Buchin, J Gudmundsson
International Journal of Geographical Information Science 24 (7), 1101-1125, 2010
612010
On Planar Supports for Hypergraphs.
K Buchin, MJ van Kreveld, H Meijer, B Speckmann, K Verbeek
J. Graph Algorithms Appl. 15 (4), 533-549, 2011
592011
Constructing Delaunay triangulations along space-filling curves
K Buchin
European Symposium on Algorithms, 119-130, 2009
59*2009
Computing the Fréchet distance between simple polygons
K Buchin, M Buchin, C Wenk
Computational Geometry 41 (1), 2-20, 2008
592008
Computing the Fréchet distance between simple polygons
K Buchin, M Buchin, C Wenk
Computational Geometry 41 (1-2), 2-20, 2008
592008
Computing the Fréchet distance between simple polygons in polynomial time
K Buchin, M Buchin, C Wenk
Proceedings of the twenty-second annual symposium on Computational geometry …, 2006
582006
Four soviets walk the dog—with an application to Alt's conjecture
K Buchin, M Buchin, W Meulemans, W Mulzer
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
552014
Trajectory grouping structure
K Buchin, M Buchin, M van Kreveld, B Speckmann, F Staals
Workshop on Algorithms and Data Structures, 219-230, 2013
532013
Delaunay triangulations in O(sort(n)) time and more
K Buchin, W Mulzer
Journal of the ACM (JACM) 58 (2), 1-27, 2011
522011
Detecting single file movement
K Buchin, M Buchin, J Gudmundsson
Proceedings of the 16th ACM SIGSPATIAL International Conference on Advances …, 2008
522008
On the number of cycles in planar graphs
K Buchin, C Knauer, K Kriegel, A Schulz, R Seidel
International Computing and Combinatorics Conference, 97-107, 2007
512007
A framework for trajectory segmentation by stable criteria
SPA Alewijnse, K Buchin, M Buchin, A Kölzsch, H Kruckenberg, ...
Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances …, 2014
462014
How difficult is it to walk the dog
K Buchin, M Buchin, C Knauer, G Rote, C Wenk
Proc. 23rd Euro. Workshop on Comput. Geom, 170-173, 2007
442007
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20