The Computational Geometry Week (CG Week) is the premier international forum for advances in computational geometry and its many applications.
CG Week combines a number of events, most notably the 38th International Symposium on Computational Geometry (SoCG 2022), the associated Media Exposition (CG:ME), workshops, the Young Researchers Forum (CG:YRF), and the CG Challenge (CG:SHOP).
The 2022 edition is planned to take place in Berlin, Germany, June 07–10, 2022.
Abstract: Geodata is all kind of data associated with a location on earth. It usually has a geometric component (like the shape of a city border) and "knowledge" components (like the type of food served in a restaurant). An example query requiring this kind of data is: find all restaurants in Berlin near a transit station. Geodata can be huge: for example, the OpenStreetMap project alone provides over 14 billion pieces of such information for the whole planet. In my talk, I will given an overview of current research behind representing, querying, and visualizing such data both efficiently and user-friendly. The talk should be understandable for anyone and there will be lots of nice examples and demos. In particular, I will explain all the necessary basics and present some open computational-geometry problems.
Abstract: Biological processes are governed by interactions at multiple scales (genomic, molecular, cellular), which are now captured by multiple modalities (multi-indexed data) and/or multi-scale spatial data. Understanding these complex biological phenomena require mathematical approaches to elucidate dynamics, predict mechanisms and reveal function. With the wealth of state-of-the-art data available at unprecedented depth and scales, new approaches are required to extract meaningful and interpretable biological insights. This talk will present computational topology methods, relying on persistent homology, that provide insight and quantification to geometric structures arising at multiple scales in biology, such as proteins and cancer.
Daniel Rutschmann and Manuel Wettstein: Chains, Koch Chains, and Point Sets with many Triangulations [doi].
Paul Jungeblut for his presentation on The Complexity of the Hausdorff Distance, with Linda Kleist and Tillman Miltzow [doi].
Helmut Alt and Michael Godau: Measuring the Resemblance of Polygonal Curves, SoCG 1992, pp. 102–109, [doi].
Jiří Matoušek: Efficient Partition Trees, SoCG 1991, pp. 1–9, [doi].
Child care will be offered during all regular sessions.
If you need child care, please contact the organizers as early as possible.
CG Week adopts the recommendations of SafeToC to help prevent and combat harassment in the Theory of Computing community. All CG Week participants must observe the code of conduct reported here.
The local organizing committee can be contacted at firstname.lastname@example.org.