The slots are 20 minutes for SoCG and 15 minutes for CG:YRF. Please plan with a talk length of 18 minutes for SoCG and 13 minutes for CG:YRF, allowing 2 minutes for questions, discussion, and the change of speaker.

A draft of the week's program is available as a pdf. Each slot is associated with the corresponding paper's index as in the list of accepted papers here.
CG Week combines a number of events, most notably the 40th International Symposium on Computational Geometry (SoCG 2024), the associated Media Exposition (CG:ME), the Young Researchers Forum (CG:YRF), the CG Challenge (CG:SHOP) and three Workshops.

• Monday, 10. June 2024

  Time
  15:00-	Registration
  16:00-17:00	Open Archimedes Workshop Constantinos Daskalakis - New Connections Between Online Learning and Game Theory (Auditorium) Chair: Ioannis Emiris
  17:00-18:30	40 years SoCG Celebration (Auditorium) Chair: Sándor Fekete
  18:30-20:30	Welcome Reception

• Tuesday, 11. June 2024

  Time
  09:00-09:10	Opening (Auditorium)
  09:10-09:40	SoCG Best Paper (Auditorium) Sayan Bandyapadhyay and Jie Xue An $O(n \log n)$-Time Approximation Scheme for Geometric Many-to-Many Matching Chair: Jeff Phillips
  09:40-10:00	SoCG Best Student Paper (Auditorium) Rhuaidi Burke Practical Software for Triangulating and Simplifying 4-Manifolds Chair: Wolfgang Mulzer
  10:00-10:20	Fast-Forward Session for CG:YRF (Auditorium) Chair: Mikael Vejdemo-Johansson
  10:20-10:35	Coffee Break
  10:35-11:35	SoCG Session 1A (Auditorium) Chair: Martin Tancer			SoCG Session 1B (Conference hall) Chair: Maike Buchin
  10:35-10:55	Willow Barkan, Huck Bennett, and Amir Nayyeri Topological k-metrics			Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Aleksandr Popov, and Sampson Wong Map-Matching Queries Under Fréchet Distance on Low-Density Spanners
  10:55-11:15	Tim Planken and Torsten Ueckerdt Polychromatic Colorings of Geometric Hypergraphs via Shallow Hitting Sets			Boris Aronov, Tsuri Farhana, Matthew J. Katz, and Indu Ramesh Discrete Fréchet Distance Oracles
  11:15-11:35	Hong Liu, Chong Shangguan, Jozef Skokan, and Zixiang Xu Beyond chromatic threshold via $(p,q)$-theorem, and blow-up phenomenon			Jacobus Conradi, Benedikt Kolbe, Ioannis Psarros, and Dennis Rohde Fast approximations and coresets for $(k,\ell)$-median under dynamic time warping
  11:35-11:50	Coffee Break
  11:50-12:50	SoCG Session 2A (Auditorium) Chair: David Mount			SoCG Session 2B (Conference hall) Chair: Michael Hoffmann
  11:50-12:10	Zhimeng Gao and Sariel Har-Peled Almost Optimal Locality Sensitive Orderings in Euclidean Space			Manasseh Ahmed, Tsun-Ming Cheung, Hamed Hatami, and Kusha Sareen Discrepancy of halfplanes
  12:10-12:30	Sándor Kisfaludi-Bak and Geert van Wordragen A Quadtree, a Steiner Spanner, and Approximate Nearest Neighbours in Hyperbolic Space			Mathilde Bouvel, Valentin Feray, Xavier Goaoc, and Florent Koechlin A Canonical Tree Decomposition for Chirotopes
  12:30-12:50	Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenković, Shay Solomon, and Cuong Than Optimal Euclidean Tree Covers			Gábor Damásdi, Zichao Dong, Manfred Scheucher, and Ji Zeng Saturation results around the Erdős-Szekeres problem
  12:50-14:20	Lunch Break
  14:20-15:40	SoCG Session 3A (Auditorium) Chair: Günter Rote			SoCG Session 3B (Conference hall) Chair: Birgit Vogtenhuber
  14:20-14:40	Suyoung Choi, Hyeontae Jang, and Mathieu Vallée A GPU algorithm for enumerating seed PL-spheres of Picard number 4 whose facets are bases of a binary matroid and application to toric topology			Martin Tancer Pach's animal problem within the bounding box
  14:40-15:00	Brannon Basilio, Chaeryn Lee, and Joseph Malionek Totally geodesic surfaces in hyperbolic 3-manifolds: algorithms and examples			Nicolas Bousquet, Lucas De Meyer, Théo Pierron, and Alexandra Wesolek Reconfiguration of plane trees in convex geometric graphs
  15:00-15:20	Benjamin A. Burton and Finn Thompson Effective Computation of the Heegaard Genus of 3-Manifolds			Iyad Kanj and Salman Parsa On the Parameterized Complexity of Motion Planning for Rectangular Robots
  15:20-15:40	Pierre Dehornoy, Corentin Lunel, and Arnaud de Mesmay Hopf Arborescent Links, Minor Theory, and Decidability of the Genus Defect			Zachary Abel, Hugo Akitaya, Scott Kominers, Matias Korman, and Frederick Stock A Universal In-Place Reconfiguration Algorithm for Sliding Cube-Shaped Robots in Quadratic Time
  15:40–16:00	Coffee Break
  16:00–18:00	CG:YRF Session A (Auditorium) Chair: Erin Wolf Chambers			CG:YRF Session B (Conference hall) Chair: Omrit Filtser
  16:00-16:15	Fangfei Lan, Salman Parsa and Bei Wang Labeled Interleaving Distance for Reeb Graphs			Jordan Matuszewski, Daniel Hope and Mikael Vejdemo-Johansson A Symmetry-Aware Vietoris-Rips Algorithm
  16:15-16:30	Thijs Beurskens, Tim Ophelders, Bettina Speckmann and Kevin Verbeek An Interleaving Distance for Ordered Merge Trees			Gill Barequet, Noga Keren, Johann Peters and Adi Rivkin On Totally-Concave Polyominoes
  16:30-16:45	Erin Wolf Chambers, Ishika Ghosh, Elizabeth Munch, Sarah Percival and Bei Wang Computing Loss Function to Bound the Interleaving Distance for Mapper Graphs			Ariel Rosenberg, Esther Arkin, Alon Efrat, Omrit Filtser and Joseph S. B. Mitchell The Gate-Cover Problem in Thin Polyominoes
  16:45-17:00	Enrique G. Alvarado, Robin Belton, Kang-Ju Lee, Sourabh Palande, Sarah Percival and Emilie Purvine Any Graph is a Mapper Graph			Joachim Orthaber and Javier Tejel Counting Crossing-Free Structures in 2-Page-Book Drawings
  17:00-17:15	Soham Mukherjee, Shreyas Samaga, Cheng Xin, Steve Oudot and Tamal K. Dey Differential of Generalized Rank Invariant Landscape (D-GRIL)			Maike Buchin and Lea Thiel Comparison of Graph Distance Measures
  17:15-17:30	Martina Flammer Spatiotemporal Persistence Landscapes			Elfarouk Harb, Zhengcheng Huang and Da Wei Zheng A New Separator Theorem for Unit Disk Graphs
  17:30-17:45	Clemens Bannwart and Claudia Landi Tagged barcodes for the topological analysis of gradient-like vector fields			Tuyen Pham and Hubert Wagner Extending Hausdorff Distances to Asymmetric Geometries
  17:45-18:00	David Munoz, Elizabeth Munch, Brittany Terese Fasy and Firas A. Khasawneh The Walk-Length Filtration for Persistent Homology on Weighted Directed Graphs
  18:00-19:00	Discussion Forum
  19:10-19:50	Planetarium Show: "We are stardust"

• Wednesday, 12. June 2024

  Time
  09:00-10:00	Invited Talk: Leonidas Guibas - The Particle and Wave Theories of Shape (Auditorium) Chair: Jeff Phillips
  10:00-10:15	Coffee Break
  10:15–11:15	SoCG Session 4A (Auditorium) Chair: Sayan Bandyapadhyay			SoCG Session 4B (Conference hall) Chair: Tamal Dey
  10:15-10:35	Boris Aronov, Mark de Berg, and Leonidas Theocharous A Clique-Based Separator for Intersection Graphs of Geodesic Disks in $\mathbb{R}^2$			Justin Curry, Washington Mio, Tom Needham, Osman Berat Okutan, and Florian Russold Stability and Approximations for Decorated Reeb Spaces
  10:35-10:55	Shinwoo An and Eunjin Oh ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs			Uzu Lim Strange Random Topology of the Circle
  10:55-11:15	Hsien-Chih Chang, Jie Gao, and Hung Le Computing Diameter+2 in Truly-Subquadratic Time for Unit-Disk Graphs			Jean-Daniel Boissonnat, Kunal Dutta, Soumik Dutta, and Siddharth Pritam On Edge Collapse of Random Simplicial Complexes
  11:15-11:30	Coffee Break
  11:30–12:50	SoCG Session 5A (Auditorium) Chair: David Mount			SoCG Session 5B (Conference hall) Chair: Boris Aronov
  11:30-11:50	Shaofeng H.-C. Jiang, Robert Krauthgamer, and Shay Sapir Moderate Dimension Reduction for $k$-Center Clustering			Fernando Cortés Kühnast, Justin Dallant, Stefan Felsner, and Manfred Scheucher An Improved Lower Bound on the Number of Pseudoline Arrangements [merged]
  11:50-12:10	Kyungjin Cho, Eunjin Oh, Haitao Wang, and Jie Xue Optimal Algorithm for the Planar Two-Center Problem			Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, and Rebeka Blanka Raffay On the number of digons in arrangements of pairwise intersecting circles
  12:10-12:30	Xiaoyi Zhu, Yuxiang Tian, Lingxiao Huang, and Zengfeng Huang Space Complexity of Euclidean Clustering			Jacob Fox, Janos Pach, and Andrew Suk (the talk will be given by Gábor Damásdi) A structure theorem for pseudo-segments and its applications
  12:30-12:50	Mikkel Abrahamsen, Sarita de Berg, Lucas Meijer, André Nusser, and Leonidas Theocharous Clustering with Few Disks to Minimize the Sum of Radii			Suryendu Dalal, Rahul Gangopadhyay, Rajiv Raman, and Saurabh Ray Sweeping Arrangements of Non-Piercing Curves in Plane
  12:50-14:20	Lunch Break
  14:20-15:40	SoCG Session 6A (Auditorium) Chair: Csaba Tóth			SoCG Session 6B (Conference hall) Chair: Bei Wang
  14:20-14:40	Bruce Brewer, Gerth Stølting Brodal, and Haitao Wang Dynamic Convex Hulls for Simple Paths			Denys Bulavka, Éric Colin de Verdière, and Niloufar Fuladi Computing shortest closed curves on non-orientable surfaces
  14:40-15:00	Alexandros Eskenazis Dimensionality of Hamming metrics and Rademacher type			Tamal K. Dey and Abhishek Rathod Cup Product Persistence and Its Efficient Computation
  15:00-15:20	Sergio Cabello, Siu-Wing Cheng, Otfried Cheong, and Christian Knauer Geometric matching and bottleneck problems			Tamal K. Dey, Florian Russold, and Shreyas N. Samaga Efficient Algorithms for Complexes of Persistence Modules with Applications
  15:20-15:40	Timothy M. Chan and Isaac M. Hair Convex Polygon Containment: Improving Quadratic to Near Linear Time			Ulrich Bauer and Fabian Roll Wrapping Cycles in Delaunay Complexes: Bridging Persistent Homology and Discrete Morse Theory
  15:40-16:00	Coffee Break
  16:00-17:00	CG:MEDIA (Auditorium)
  16:00-16:10	Kacey Thien-Huu La, Jose E. Arbelo, and Christopher J. Tralie Visualizing Lucas’s Hamiltonian Paths Through the Associahedron’s Skeleton
  16:10-16:20	Nithin Parepally, Ainesh Chatterjee, Auguste H. Gezalyan, Hongyang Du, Sukrit Mangla, Kenny Wu, Sarah Hwang, and David M. Mount Ipelets for the Convex Polygonal Geometry
  16:20-16:30	Dominique Attali, Hana Dal Poz Kouřimská, Christopher Fillmore, Ishika Ghosh, André Lieutier, Elizabeth Stephenson, and Mathijs Wintraecken The ultimate frontier: An Optimality Construction for Homotopy Inference
  16:30-16:40	Marjolein Haagsman, Maarten Löffler, and Carola Wenk Computational Geometry Concept Videos: A Dual-Use Project in Education and Outreach
  16:40-16:50	Irina Kostitsyna, Tim Ophelders, Irene Parada, Tom Peters, Willem Sonke, and Bettina Speckmann Optimal In-Place Compaction of Sliding Cubes
  16:50-17:00	Olivia Laske, Lori Ziegelmeier Image Triangulation Using the Sobel Operator for Vertex Selection
  17:00-18:00	CG:SHOP (Auditorium)
  	Sándor Fekete: Welcome and Overview Alkan Atak, Kevin Buchin, Mart Hagedoorn, Jona Heinrichs, Karsten Hogreve, Guangping Li, Patrick Pawelczyk Computing Maximum Polygonal Packings in Convex Polygons using Best-Fit, Genetic Algorithms and ILPs Martin Held Priority-Driven Nesting of Irregular Polygonal Shapes Within a Convex Polygonal Container Based on a Hierarchical Integer Grid Canhui Luo, Zhouxing Su and Zhipeng Lü A General Heuristic Approach for Maximum Polygon Packing Guilherme Dias da Fonseca and Yan Gerard Shadoks Approach to Knapsack Polygonal Packing Questions and Discussion Award Ceremony Outlook
  18:00-19:30	Business Meeting
  20:00-	Dinner

• Thursday, 13. June 2024

  Time
  09:00-10:00	Invited Talk: Edith Cohen - Sketching Techniques for Metric Data (Auditorium) Chair: Wolfgang Mulzer
  10:00-10:15	Coffee Break
  10:15–11:15	SoCG Session 7A (Auditorium) Chair: Omrit Filtser			SoCG Session 7B (Conference hall) Chair: Evanthia Papadopoulou
  10:15-10:35	Emily Fox, Amir Nayyeri, Jonathan James Perry, and Benjamin Raichel Fréchet Edit Distance			Yohai Reani and Omer Bobrowski Morse Theory for the k-NN Distance Function
  10:35-10:55	Karl Bringmann, Frank Staals, Karol Wegrzycki, and Geert van Wordragen Fine-Grained Complexity of Earth Mover's Distance under Translation			Joachim Gudmundsson, Martin P. Seybold, and Sampson Wong Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size
  10:55-11:15	Thijs van der Horst and Tim Ophelders Faster Fréchet Distance Approximation through Truncated Smoothing			Arnold Filtser, Yuval Gitlitz, and Ofer Neiman Light, Reliable Spanners
  11:15-11:30	Coffee Break
  11:30–12:50	SoCG Session 8A (Auditorium) Chair: Ben Raichel			SoCG Session 8B (Conference hall) Chair: Peyman Afshani
  11:30-11:50	Sarita de Berg, Till Miltzow, and Frank Staals Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain			Timothy M. Chan, Pingan Cheng, and Da Wei Zheng Semialgebraic Range Stabbing, Ray Shooting, and Intersection Counting in the Plane
  11:50-12:10	Mark de Berg and Leonidas Theocharous A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon			Pankaj K. Agarwal, Esther Ezra, and Micha Sharir Off-line Semi-Algebraic Range Searching in the Plane
  12:10-12:30	Rathish Das, Omrit Filtser, Matthew J. Katz, and Joseph Mitchell Robustly Guarding Polygons			Friedrich Eisenbrand, Matthieu Haeberle, and Neta Singer An improved bound on sums of square roots via the subspace theorem
  12:30-12:50	Fabrizio Grandoni, Edin Husić, Mathieu Mari, and Antoine Tinguely Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions			Patrick Schnider and Simon Weber A Topological Version of Schaefer's Dichotomy Theorem
  12:50-14:20	Lunch Break
  14:20–15:40	SoCG Session 9A (Auditorium) Chair: Michael Hoffmann			SoCG Session 9B (Conference hall) Chair: Csaba Tóth
  14:20-14:40	Moritz Buchem, Paul Deuker, and Andreas Wiese Approximating the geometric knapsack problem in near-linear time and dynamically			Boris Aronov, Abdul Basit, Indu Ramesh, Gianluca Tasinato, and Uli Wagner 8-Partitioning Points in 3D, and Efficiently Too
  14:40-15:00	Ernest van Wijland and Hang Zhou Faster Approximation Scheme for Euclidean $k$-TSP			Günter Rote, Moritz Rüber, and Morteza Saghafian Grid Peeling of Parabolas
  15:00-15:20	Helena Bergold, Stefan Felsner, Meghana M. Reddy, Joachim Orthaber, and Manfred Scheucher Plane Hamiltonian cycles in convex drawings			Dror Chawin and Ishay Haviv Nearly Orthogonal Sets over Finite Fields
  15:20-15:40	Václav Blažej, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, and Johannes Zink Constrained and Ordered Level Planarity Parameterized by the Number of Levels			Michael Gene Dobbins, Andreas F. Holmsen, and Dohyeon Lee Colorful intersections and Tverberg partitions
  15:40-16:00	Coffee Break
  16:00-17:30	The 8th Workshop on Geometry and Machine Learning (Auditorium)		International Workshop on Uncertainty in Computational Geometry (Conference hall)
  16:00-16:20	Hubert Wagner, Nickolas Arustamyan, Matthew Wheeler, and Peter Bubenik Quantifying Geometric-Topological Interactions using Mixup Barcodes		16:00-16:30	Wolfgang Mulzer Self-Improving Algorithms
  16:20-16:40	Lori Ziegelmeier , Russell J. Funk, Jingyi Guan, Jason Owen-Smith, and Adam Schroeder The Survival Analysis of Topological Features of Knowledge Networks		16:30-17:00	Joachim Gudmundsson Realistic Input Assumptions
  16:45-17:05	Bala Krishnamoorthy, Enrique Alvarado and Prashant Gupta Box Filtration		17:00-17:30	Maarten Löffler Robustness and Uncertain Points
  17:05-17:25	Iolo Jones Diffusion Geometry for Machine Learning
  17:30-17:45	Coffee Break
  17:45-19:15	The 8th Workshop on Geometry and Machine Learning (Auditorium)		Workshop on Directional Transforms in Applied Topology (Conference hall)
  17:45-18:45	Invited talk Dimitrios Gunopulos Learning from Data with Geometric Properties		17:45-18:20	Sarah McGuire Classification of Euler Characteristic Transforms using Convolutional Neural Networks
  18:50-19:10	Alexander Munteanu , Amer Krivosija, Andre Nusser, and Chris Schwiegelshohn Improved learning via k-DTW: a novel dissimilarity measure for curves		18:20-	Erin Chambers, Ishika Ghosh, Elizabeth Munch, Sarah Percival and Bei Wang Bounding the Interleaving Distance for Mapper Graphs with a Loss Function

• Friday, 14. June 2024

  Time
  09:00-10:00	SoCG Session 10A (Auditorium) Chair: Omrit Filtser			SoCG Session 10B (Conference hall) Chair: Tamal Dey
  09:00-09:20	Timothy M. Chan and Zhengcheng Huang Dynamic Geometric Connectivity in the Plane with Constant Query Time			Ángel Javier Alonso, Michael Kerber, and Primoz Skraba Probabilistic Analysis of Multiparameter Persistence Decompositions into Intervals
  09:20-09:40	Sujoy Bhore, Martin Nöllenburg, Csaba D. Tóth, and Jules Wulms Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time			Qingsong Wang, Guanqun Ma, Raghavendra Sridharamurthy, and Bei Wang Measure Theoretic Reeb Graphs and Reeb Spaces
  09:40-10:00	Chaya Keller and Shakhar Smorodinsky Zarankiewicz's Problem via $\epsilon$-t-Nets			Dominique Attali, Hana Dal Poz Kourimska, Christopher Fillmore, Ishika Ghosh, André Lieutier, Elizabeth Stephenson, and Mathijs Wintraecken Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of Euclidean spaces and of Riemannian manifolds
  10:00-10:15	Coffee Break
  10:15-11:15	SoCG Session 11A (Auditorium) Chair: Sayan Bandyapadhyay			SoCG Session 11B (Conference hall) Chair: Steve Oudot
  10:15-10:35	Sándor Kisfaludi-Bak, Jana Masaříková, Erik Jan van Leeuwen, Bartosz Walczak, and Karol Węgrzycki Separator Theorem and Algorithms for Planar Hyperbolic Graphs			Sushovan Majhi Demystifying Latschev's Theorem: Manifold Reconstruction from Noisy Data
  10:35-10:55	Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, and Meirav Zehavi A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs			Tamal K. Dey and Tao Hou Computing Zigzag Vineyard Efficiently Including Expansions and Contractions
  10:55-11:15	Jacob Focke, Florian Hoersch, Shaohua Li, and Dániel Marx Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern			Hana Dal Poz Kourimska, André Lieutier, and Mathijs Wintraecken The medial axis of closed bounded sets is Lipschitz stable with respect to the Hausdorff distance under ambient diffeomorphisms
  11:15-11:30	Coffee Break
  11:30–12:10	SoCG Session 12A (Auditorium) Chair: Ben Raichel			SoCG Session 12B (Conference hall) Chair: Martin Tancer
  11:30-11:50	Haitao Wang and Jie Xue Algorithms for Halfplane Coverage and Related Problems			Luca Castelli Aleardi and Olivier Devillers SCARST: Schnyder Compact And Regularity Sensitive Triangulation Data Structure
  11:50-12:10	Timothy Chan, Qizheng He, and Jie Xue Enclosing Points with Geometric Objects			Herbert Edelsbrunner and Janos Pach Maximum Betti Numbers of Čech Complexes
  12:10-13:00	Test of Time Award (Auditorium)
  12:10-12:15	Siu-Wing Cheng: Opening remark and introduction
  12:15-12:35	Nina Amenta, Marshall W. Bern: Surface Reconstruction by Voronoi Filtering
  12:35-12:40	Siu-Wing Cheng: Introduction
  12:40-13:00	David Avis, Komei Fukuda: A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra
  13:00-13:15	Best student presentation (Auditorium)
  13:15–14:30	Lunch Break
  14:30-16:00	Workshop on Directional Transforms in Applied Topology (Auditorium)		3rd International Workshop on Uncertainty in Computational Geometry (Conference hall)
  14:30-15:05	Anna Schenfisch Concise vs. verbose descriptors – how events with a trivial lifespan can have a non-trivial impact		14:30-15:00	Martin Seybold On the Complexity of Algorithms with Predictions for Dynamic Graph Problems
  15:05-	Mattie Ji Euler Characteristics and Homotopy Types of Definable Sublevel Sets		15:00-15:30	Fangfei Lan Topological Characterization and Uncertainty Visualization of Atmospheric Rivers
  			15:30-16:00	Arindam Khan Random-Order Online Interval Scheduling and Geometric Generalizations
  16:00–16:15	Closing

• Organizer

  

• Platinum Sponsors

  

• Silver Sponsors*

  

  

  

  

  

• Supporters

  

*Sponsors are listed alphabetically.