• 1270 Citations
20052020

Research output per year

If you made any changes in Pure these will be visible here soon.

Personal profile

Quote

“In our spatial world, much of the data we generate is geometric. It is a great challenge to develop algorithms for dealing with these data.”

Research profile

Kevin Buchin is an Associate Professor in the Algorithms group at Eindhoven University of Technology (TU/e). His work focuses on computational geometry. He has a broad interest in fundamental algorithmic problems as well as problems driven by applications such as geographic data analysis and robotics. Kevin’s primary goal is to develop algorithmic solutions that are both practical and provably efficient.  

Kevin has made many contributions to the theory of geometric algorithms, including fast algorithms for the Delaunay triangulation in the transdichotomous model, for computing the similarity between curves, and for constructing geometric spanners. For all of these problems, he has also developed practically efficient algorithms. On the applications side, Kevin has contributed to spatial networks analysis, movement data analysis, and robot motion planning. He is in particular interested in geometric algorithms that integrate data uncertainty.

Academic background

Kevin Buchin holds a PhD in Computer Science from the Free University of Berlin and an MSc in Mathematics from the University of Münster. He has also studied in Zurich, Prague, Leeds and Potsdam. He came to the Netherlands as a postdoctoral researcher at the University of Utrecht. Kevin has been working at the TU/e Department of Mathematics and Computer Science since 2009.  

He is teaching at the TU/e and the Jheronimus Academy of Data Science in Den Bosch. For his teaching achievements, he has been awarded the education award of the study association of the department of Mathematics and Computer Science, and the TU/e-wide award for  best Bachelor lecturer.

Fingerprint Dive into the research topics where Kevin A. Buchin is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

  • 3 Similar Profiles

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output

Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency: Proceedings of the 14th International Workshop on the Algorithmic Foundations of Robotics (WAFR 20)

Afshani, P., de Berg, M. T., Buchin, K. A., Gao, J., Löffler, M., Nayyeri, A., Raichel, B., Sarkar, R., Wang, H. & Yang, H-T., 2020, 25 p. Cornell university.

Research output: Other contributionAcademic

  • Minimum perimeter-sum partitions in the plane

    Abrahamsen, M., de Berg, M., Buchin, K., Mehr, M. & Mehrabi, A. D., 1 Mar 2020, In : Discrete and Computational Geometry. 63, 2, p. 483-505 23 p.

    Research output: Contribution to journalArticleAcademicpeer-review

  • Approximating (k,ℓ)-center clustering for curves

    Buchin, K., Driemel, A., Gudmundsson, J., Horton, M., Kostitsyna, I., Löffler, M. & Struijs, M., 2 Jan 2019, 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Chan, T. M. (ed.). Society for Industrial and Applied Mathematics (SIAM), p. 2922-2938 17 p.

    Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

    Open Access
  • 3 Citations (Scopus)
    1 Downloads (Pure)

    A sampling-based strategy for distributing taxis in a road network for occupancy maximization (GIS Cup)

    Buchin, K. A., Kostitsyna, I., Custers, B. & Struijs, M. A. C., 5 Nov 2019, 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2019. Banaei-Kashani, F., Trajcevski, G., Guting, R. H., Kulik, L. & Newsam, S. (eds.). Association for Computing Machinery, Inc, p. 616-619 4 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

  • A spanner for the day after

    Buchin, K., Har-Peled, S. & Oláh, D., 1 Jun 2019, 35th International Symposium on Computational Geometry, SoCG 2019. Barequet, G. & Wang, Y. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 15 p. 19. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 129).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
    File
    7 Downloads (Pure)

    Courses

    Bachelor research project

    1/09/15 → …

    Course

    CS Research Honors project 1

    1/09/14 → …

    Course

    CS Research Honors project 2

    1/09/15 → …

    Course

    Data Sci & Engineering

    1/09/15 → …

    Course

    Geometric algorithms

    1/09/15 → …

    Course

    Student theses

    A framework for trajectory segmentation by stable criteria and Brownian Bridge Movement Model

    Author: Alewijnse, S., 31 Aug 2013

    Supervisor: Buchin, K. (Supervisor 1) & Westenberg, M. (Supervisor 2)

    Student thesis: Master

    File

    Algorithms for center-based trajectory clustering

    Author: van de L'Isle, N., 28 Jan 2019

    Supervisor: Buchin, K. (Supervisor 1) & Driemel, A. (Supervisor 2)

    Student thesis: Master

    File

    Algorithms for comparing moving complex shapes: higher-dimensional Fréchet distance

    Author: Ophelders, T., 30 Sep 2014

    Supervisor: Buchin, K. (Supervisor 1) & Speckmann, B. (Supervisor 2)

    Student thesis: Master

    File

    Algorithms for parallel machine scheduling with a sequence dependent cost function: application in a printed circuit board assembly production environment

    Author: Reusken, E., 28 Oct 2019

    Supervisor: Buchin, K. A. (Supervisor 1), Spieksma, F. C. (Supervisor 2), Kowalczyk, D. (Supervisor 2), van de Ven, M. (External person) (External coach) & de Wit, L. (External person) (External coach)

    Student thesis: Master

    A novel algorithm for computing the Fréchet distance

    Author: van Leusden, R., 31 May 2013

    Supervisor: Buchin, K. (Supervisor 1)

    Student thesis: Master

    File