Computational geometry is concerned with the design, analysis, and implementation of algorithms for geometric and topological problems, which arise naturally in a wide range of areas, including computer graphics, robotics, geographic information systems, molecular biology, sensor networks, machine learning, data mining, scientific computing, theoretical computer science, and pure mathematics. Computational geometry is a vibrant and mature field of research, with several dedicated international conferences and journals, significant real-world impact, and strong intellectual connections with other computing and mathematics disciplines.

Seminar Topics. The emphasis of the seminar will be on presenting recent developments in computational geometry, as well as identifying new challenges, opportunities, and connections to other fields of computing. In addition to the usual broad coverage of emerging results in the field, the seminar will include invited survey talks on two broad and overlapping focus areas that cover a wide range of both theoretical and practical issues in geometric computing. Both focus areas have seen exciting recent progress and offer numerous opportunities for further cross-disciplinary impact.

Computational geometry for monitoring and shape data. The combination of movement and geometry has always been an important topic in computational geometry, initially motivated by robotics and resulting in the study of kinetic data structures. With the advent of widely available location tracking technologies such as GPS sensors, trajectory analysis has become a topic in itself, which has connections to other classical topics in computational geometry such as shape analysis. Still, efficient technologies to perform the most basic operations are lacking. We need data structures supporting similarity queries on trajectory data and geometric clustering algorithms that can handle the infinite-dimensional geometry inherent in the data. A related type of data, namely time series data, has not received much attention in the computational geometry community, despite its universality and its close relation to trajectory data. Shedding light on the interconnections of these topics will promote new results in the field which will address these timely questions.

Computing in high-dimensional and infinite-dimensional spaces. The famous “curse of dimensionality” prevents exact geometric computations in high-dimensional spaces. Most of the data in science and engineering is high-dimensional, rendering classical geometric techniques, such as the sweepline approach, insufficient. One way to address this issue is to use sparsity, but it is not always easy to find a sparse representation of the data. The search of the most efficient representation and how to exploit this representation leads to dimension-reduction techniques, metric embeddings, and approximation algorithms. This line of research has strong ties to machine learning and discrete mathematics as well as computational geometry.

Creative Commons BY 3.0 DE

Otfried Cheong, Anne Driemel, and Jeff Erickson

• Mohammad Ali Abam (Sharif University of Technology - Tehran, IR) [dblp]
• Tetsuo Asano (JAIST - Ishikawa, JP) [dblp]
• Sang Won Bae (Kyonggi University, KR) [dblp]
• Bahareh Banyassady (FU Berlin, DE) [dblp]
• Ulrich Bauer (TU München, DE) [dblp]
• Karl Bringmann (MPI für Informatik - Saarbrücken, DE) [dblp]
• Otfried Cheong (KAIST - Daejeon, KR) [dblp]
• Man-Kwun Chiu (National Institute of Informatics - Tokyo, JP) [dblp]
• Jinhee Chun (Tohoku University - Sendai, JP) [dblp]
• Kenneth L. Clarkson (IBM Almaden Center - San Jose, US) [dblp]
• Michael Gene Dobbins (Binghamton University, US) [dblp]
• Anne Driemel (TU Eindhoven, NL) [dblp]
• Jeff Erickson (University of Illinois - Urbana-Champaign, US) [dblp]
• Esther Ezra (Georgia Institute of Technology - Atlanta, US) [dblp]
• Sándor Fekete (TU Braunschweig, DE) [dblp]
• Kyle Jordan Fox (Duke University - Durham, US) [dblp]
• Jie Gao (Stony Brook University, US) [dblp]
• Joachim Gudmundsson (The University of Sydney, AU) [dblp]
• Anna Gundert (Universität Köln, DE) [dblp]
• Dan Halperin (Tel Aviv University, IL) [dblp]
• David G. Kirkpatrick (University of British Columbia - Vancouver, CA) [dblp]
• Michal Kleinbort (Tel Aviv University, IL) [dblp]
• Christian Knauer (Universität Bayreuth, DE) [dblp]
• Matias Korman (Tohoku University - Sendai, JP) [dblp]
• Amer Krivosija (TU Dortmund, DE) [dblp]
• Maarten Löffler (Utrecht University, NL) [dblp]
• Till Miltzow (Free University of Brussels, BE) [dblp]
• Joseph S. B. Mitchell (Stony Brook University, US) [dblp]
• Wolfgang Mulzer (FU Berlin, DE) [dblp]
• Aleksandar Nikolov (University of Toronto, CA) [dblp]
• Zuzana Patáková (IST Austria - Klosterneuburg, AT) [dblp]
• Jeff M. Phillips (University of Utah - Salt Lake City, US) [dblp]
• Benjamin Raichel (University of Texas - Dallas, US) [dblp]
• Abhishek Rathod (TU München, DE) [dblp]
• Saurabh Ray (New York University - Abu Dhabi, AE) [dblp]
• Marcel J. M. Roeloffzen (National Institute of Informatics - Tokyo, JP) [dblp]
• Michael Sagraloff (MPI für Informatik - Saarbrücken, DE) [dblp]
• Alejandro Salinger (SAP SE - Walldorf, DE) [dblp]
• Lena Schlipf (FernUniversität in Hagen, DE) [dblp]
• Raimund Seidel (Universität des Saarlandes, DE) [dblp]
• Fabian Stehn (Universität Bayreuth, DE) [dblp]
• Monique Teillaud (INRIA Nancy - Grand Est, FR) [dblp]
• André van Renssen (National Institute of Informatics - Tokyo, JP) [dblp]
• Kevin Verbeek (TU Eindhoven, NL) [dblp]
• Bei Wang Phillips (University of Utah - Salt Lake City, US) [dblp]
• David P. Woodruff (IBM Almaden Center - San Jose, US) [dblp]