Følg
Kevin Buchin
Kevin Buchin
Professor of Computer Science, Technical University Dortmund
Verificeret mail på tu-dortmund.de - Startside
Titel
Citeret af
Citeret af
År
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
2352011
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-24, 2015
2212015
Flow map layout via spiral trees
K Buchin, B Speckmann, K Verbeek
IEEE transactions on visualization and computer graphics 17 (12), 2536-2544, 2011
2132011
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
1362009
A comparative analysis of trajectory similarity measures
Y Tao, A Both, RI Silveira, K Buchin, S Sijben, RS Purves, P Laube, ...
GIScience & Remote Sensing 58 (5), 643-669, 2021
1322021
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
1122009
Median trajectories
K Buchin, M Buchin, M Van Kreveld, M Löffler, RI Silveira, C Wenk, ...
Algorithmica 66, 595-614, 2013
1062013
Computing the Fréchet distance between simple polygons
K Buchin, M Buchin, C Wenk
Computational Geometry 41 (1), 2-20, 2008
832008
Trajectory grouping structure
K Buchin, M Buchin, M van Kreveld, B Speckmann, F Staals
Workshop on Algorithms and Data Structures, 219-230, 2013
822013
On planar supports for hypergraphs
K Buchin, M van Kreveld, H Meijer, B Speckmann, K Verbeek
Journal of Graph Algorithms and Applications 15 (4), 533-549, 2011
782011
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
762010
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
712014
Drawing (complete) binary tanglegrams: Hardness, approximation, fixed-parameter tractability
K Buchin, M Buchin, J Byrka, M Nöllenburg, Y Okamoto, RI Silveira, ...
Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete …, 2009
672009
Constructing Delaunay triangulations along space-filling curves
K Buchin
European Symposium on Algorithms, 119-130, 2009
66*2009
Four soviets walk the dog: Improved bounds for computing the Fréchet distance
K Buchin, M Buchin, W Meulemans, W Mulzer
Discrete & Computational Geometry 58, 180-216, 2017
642017
Delaunay triangulations in O(sort(n)) time and more
K Buchin, W Mulzer
Journal of the ACM (JACM) 58 (2), 1-27, 2011
642011
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
632006
Approximating (k, ℓ)-center clustering for curves
K Buchin, A Driemel, J Gudmundsson, M Horton, I Kostitsyna, M Löffler, ...
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
612019
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
612014
Preprocessing imprecise points for Delaunay triangulation: Simplified and extended
K Buchin, M Löffler, P Morin, W Mulzer
Algorithmica 61 (3), 674-693, 2011
61*2011
Systemet kan ikke foretage handlingen nu. Prøv igen senere.
Artikler 1–20