Kevin Verbeek 2019-01-24.

email
office MF 4.106 (MetaForum)
phone +31 40 247 8926
mail address Department of Mathematics and Computer Science
TU Eindhoven
P.O. Box 513
5600MB Eindhoven
The Netherlands
email
office MF 4.106 (MetaForum)
phone +31 40 247 8926
mail address Department of Mathematics and Computer Science
TU Eindhoven
P.O. Box 513
5600MB Eindhoven
The Netherlands

I am an assistant professor in the Applied Geometric Algorithms group at the Department of Mathematics and Computer Science of TU Eindhoven.

Background

I obtained my PhD at TU Eindhoven in 2012, with a thesis on Algorithms for Cartographic Visualization. From October 2012 to October 2014 I was a postdoctoral researcher at UC Santa Barbara, where I researched the use of geometric techniques to analyze social networks. Since November 2014 I am an assistant professor in the Applied Geometric Algorithms group at TU Eindhoven. In January 2016 I received a VENI-grant for a project on "Stable Geometric Algorithms". I am currently the coordinator of the bachelor honors track Competitive Programming and Problem Solving, which is part of the TU/e Honors Academy. Furthermore, I am currently a member of the Eindhoven Young Academy of Engineering.

Research Interests

My main research interests lie within the area of computational geometry. I am specialized in using theoretical techniques from computational geometry to solve real-world problems, mostly in the area of information visualization. My favorite research topics include:

Current Projects

Glammap

GlamMap is a geo-spatial visualization tool that allows users to visualize geo-referenced metadata of cultural heritage artifacts (GLAM: Galleries, Libraries, Archives, Museums) on an interactive, two-dimensional geographic map.

Stable Geometric Algorithms

Time-varying data like stock prices, traffic status, or weather play an important role in our everyday lives. When creating dynamic visualizations for the purpose of understanding such time-varying data, the stability of the geometric algorithms underlying these visualizations play an important role: small changes in the data should lead to small changes in the visualization. Often there is a tradeoff between the (static) quality of a visualization and its stability, as demonstrated by the treemap video below. In the left treemap the rectangles have smaller aspect ratios, but the right treemap is more stable.

We develop new rigorous tools to measure the stability of geometric algorithms, new methods to analyze the tradeoff between the quality of the output and the stability of algorithms, and new algorithms with provable guarantees on the stability.

Stable Treemaps via Local Moves M. Sondag, B. Speckmann, and K. Verbeek. IEEE Transactions on Visualization and Computer Graphics, 24(1), 2018.
A Framework for Algorithm Stability and its Application to Kinetic Euclidean MSTs W. Meulemans, B. Speckmann, K. Verbeek, and J. Wulms. Proc. 13th Latin American Theoretical Informatics Symposium (LATIN), 805-819, 2018.
Topological stability of k-centers. (Work in progress.)
Stable oriented shape descriptors. (Work in progress.)
 

Here is a poster, and here is a EU Research article on the project (EU Research WINT18/P52). The entire issue can be viewed here.