Mark de Berg

Mark is a full professor at Eindhoven University of Technology (TU/e) and chair of the TU/e Algorithms Group. This group performs research in various areas within algorithms, including computational geometry and FPT algorithms, and is inspired by applications in complex networks, geographic information science and design and manufacturing. Mark’s personal interest is in algorithms and data structures in general, and in algorithmic questions involving spatial data in particular. His current research includes algorithms for geometric networks, exact algorithms for NP-hard geometric problems, and spatial data structures. Much of his work centers around the question: How can we exploit the properties that real-world spatial data sets often possess to obtain provably efficient solutions?

Geometry is everywhere. By my research I want to contribute to a deeper understanding of the techniques needed to tackle the algorithmic challenges involved in processing spatial data in an efficient and reliable manner.”