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

Personal profile

Quote

"To quote esteemed statistician Vladimir Vapnik: 'Nothing is more practical than a good theory'!"

Research profile

Anne Driemel is an Assistant Professor in the Data Mining group at Eindhoven University of Technology (TU/e). Her work focuses on the computational geometry of curve similarity computation. She has a broad interest in high-dimensional algorithmic problems involving geometry, motivated by applications in geographic information science and data analysis.

Anne’s primary goal is to design algorithms and data structures that are both practical and have provable performance. To this end, she combines classical worst-case analysis with approximation techniques and realistic input models. Her interests also include application of randomization techniques to obtain simple and effective solutions for computationally hard problems. She is especially interested in curve and graph similarity computations, ranging from mapping trajectories to road networks and clustering time series. Courses examine software, algorithms, control systems and theoretical computer science.

Academic background

Anne Driemel received her PhD in Computing Science from Utrecht University in the Netherlands. She also holds a BSc and MSc in Computer Science from the Free University of Berlin, where she has also worked as a teaching assistant and scientific programmer. Anne has also worked as a Research Assistant at Dortmund University of Technology. In addition, she has been involved in projects at the University of Pennsylvania (GRASP Lab), Université Denis Diderot (Erasmus Program) and Rotary Youth Exchange Australia.

Anne has been a visiting researcher at various Universities in the USA: Tulane University, New Orleans, University of Illinois at Urbana-Champaign (UIUC), Urbana and University of North Carolina at Chapel Hill. She has hosted workshops at a wide variety of locations, including Leibniz Center for Informatics, Wadern, Germany, Lorentz Center, Leiden, The Netherlands, Friedrich-Schiller Universität Jena, Germany and Princeton University, New Jersey, USA. Furthermore, she has acted as a referee at several international conferences  including the International Workshop on Randomization and Computation and International Workshop on Graph-Theoretic Concepts in Computer Science.

Affiliated with

Advisory Board Member 2017-2021 LAMBDA (Learning and Analysing Massive / Big complex Data)

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

Research Output 2010 2019

12 Citations (Scopus)

Locality-sensitive hashing of curves

Driemel, A. & Silvestri, F., 1 Jun 2017, 33rd International Symposium on Computational Geometry, SoCG 2017. Aronov, B. & Katz, M. J. (eds.). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vol. 77, p. 37:1-37:16 16 p. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 77)

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

Open Access
File
Data structures
Nearest neighbor search

Clustering time series under the Fréchet distance

Driemel, A., Krivosija, A. & Sohler, C., 2016, 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016. Association for Computing Machinery, Inc, Vol. 2, p. 766-785 20 p.

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

Time series
Clustering
Approximation algorithms
Clustering algorithms
Distance Measure

On the expected complexity of Voronoi diagrams on terrains

Driemel, A., Har-Peled, S. & Raichel, B., 1 Apr 2016, In : ACM Transactions on Algorithms. 12, 3, p. 1-20 20 p., 37

Research output: Contribution to journalArticleAcademicpeer-review

Voronoi Diagram
Polyhedral Terrains
Combinatorial Complexity
Probabilistic Analysis
Voronoi
27 Citations (Scopus)

Jaywalking your dog : computing the Fréchet distance with shortcuts

Driemel, A. & Har-Peled, S., 2013, In : SIAM Journal on Computing. 42, 5, p. 1830-1866

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Data structures
Curve
Computing
Query
Data Structures
47 Citations (Scopus)

Approximating the Fréchet distance for realistic curves in near linear time

Driemel, A., Har-Peled, S. & Wenk, C., 2012, In : Discrete and Computational Geometry. 48, 1, p. 94-127

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Linear Time
Curve
Approximation algorithms
Simplification
Approximation Algorithms

Prizes

detection method

Student theses

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

Curve clustering: hardness and algorithms

Author: Struijs, M., 26 Nov 2018

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

Student thesis: Master

File