Als u wijzigingen in Pure hebt gemaakt, zullen deze hier binnenkort zichtbaar zijn.

Persoonlijk profiel

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.

Vingerafdruk Duik in de onderzoeksthema's waar Kevin A. Buchin actief is. Deze onderwerplabels komen voort uit het werk van deze persoon. Samen vormen ze een unieke vingerafdruk.

Triangulation Engineering en materiaalwetenschappen
Trajectories Engineering en materiaalwetenschappen
Computing Rekenkunde
Curve Rekenkunde
Labeling Engineering en materiaalwetenschappen
Random access storage Engineering en materiaalwetenschappen
Trajectory Rekenkunde
Hardness Rekenkunde

Netwerk Recente externe samenwerking op landenniveau. Duik in de details door op de stippen te klikken.

Onderzoeksoutput 2005 2019

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. (redactie). Society for Industrial and Applied Mathematics (SIAM), blz. 2922-2938 17 blz.

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureHoofdstukAcademicpeer review

Open Access
Clustering
Curve
Simplification
Approximation
Hardness of Approximation

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. (redactie). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 15 blz. 19. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 129)

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

Open Access
Bestand

Locally correct Fréchet matchings

Buchin, K., Buchin, M., Meulemans, W. & Speckmann, B., 1 jan 2019, In : Computational Geometry: Theory and Applications. 76, blz. 1-18 18 blz.

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

Open Access
Curve
Monotone
Metric

Minimum perimeter-sum partitions in the plane

Abrahamsen, M., de Berg, M., Buchin, K., Mehr, M. & Mehrabi, A. D., 1 jan 2019, In : Discrete and Computational Geometry. 23 blz.

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

Perimeter
Partition
Approximation algorithms
Exact Algorithms
Pi

Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)

Buchin, K., Kostitsyna, I., Löffler, M. & Silveira, R. I., 1 jul 2019, In : Algorithmica. 81, 7, blz. 2682–2715

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

Open Access
Bestand
Visibility
Probability distributions
Probability density function
Probability Distribution
Polygon

Cursussen

Bachelor research project

1/09/15 → …

Cursus

CS Research Honors project 1

1/09/14 → …

Cursus

CS Research Honors project 2

1/09/15 → …

Cursus

Data-structures and Algorithms

1/09/16 → …

Cursus

Geometric algorithms

1/09/15 → …

Cursus

Scriptie

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

Auteur: Alewijnse, S., 31 aug 2013

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

Scriptie/masterproef: Master

Bestand

Algorithms for center-based trajectory clustering

Auteur: van de L'Isle, N., 28 jan 2019

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

Scriptie/masterproef: Master

Bestand

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

Auteur: Ophelders, T., 30 sep 2014

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

Scriptie/masterproef: Master

Bestand

A novel algorithm for computing the Fréchet distance

Auteur: van Leusden, R., 31 mei 2013

Begeleider: Buchin, K. (Afstudeerdocent 1)

Scriptie/masterproef: Master

Bestand

Automatic construction of machine learning pipelines

Auteur: Gijsbers, P., 30 okt 2017

Begeleider: Vanschoren, J. (Afstudeerdocent 1), Pechenizkiy, M. (Afstudeerdocent 2) & Buchin, K. (Afstudeerdocent 2)

Scriptie/masterproef: Master

Bestand