Important Dates

Abstract submission: Sunday, September 29, 2024  
Notification of acceptance: Friday, October 11 Saturday October 12, 2024  
Requests for financial support: Tuesday, October 15 Friday, October 18, 2024  
Final version due and
hotel block deadline:		 Tuesday, October 29, 2024
(***Additional Rooms Added!***)
  
Registration (no fee): Sunday October 27 Tuesday, October 29, 2024 *  
Workshop: Fri-Sat November 15--16, 2024  

The program is expected to run from 9AM on Friday through 6pm on Saturday. A reception is planned on Friday night at the hotel, open to all participants.

* Please be sure to register in advance (ideally by the date above), if at all possible, as we rely on the registration numbers to plan for food and drinks. While there is an option to register on site, it would be most helpful to know your intentions in advance!

Invited Speakers

Justin Solomon

Convex Relaxation Strategies for Geometry Processing

Abstract: While classical models in geometry processing often boil down to linear systems of equations, modern techniques depend on solution of nonlinear and possibly nonconvex problems. In this talk, I will share a variety of works that show how convex relaxations can be used to extract solutions to difficult geometry processing problems, often with theoretical guarantees of optimality. Our methods are applicable to a wide range of geometry processing tasks, from solution of partial differential equations to design of frame fields and optimization of minimal surfaces. This talk will cover collaborative research with Mirela Ben-Chen, Albert Chern, Michal Edelstein, Nestor Guillen, Zoë Marschner, Leticia Mattos Da Silva, David Palmer, Dmitriy Smirnov, Oded Stein, Stephanie Wang, Paul Zhang, and others.

Vida Dujmović

Graph Product Structure: Theory and Applications

Abstract: Graph product structure theory describes graphs in complicated classes as subgraphs of products of simple tree-like graphs. There has been an explosion of interest in this field since 2019, when the speaker and her colleagues proved that every planar graph is contained in the product of a tree-like graph and a path. This result opened up a new research direction, and has been the key tool in solving a number of longstanding open problems. This talk will introduce graph product structure theory, describing the main results and several of the applications.

Accepted Papers

Gill Barequet, Neal Madras and Johann Peters.
On $t$-fold Totally Concave Polyominoes
Kevin Lu, Jie Gao, Feng Luo, Chengyuan Deng, Hongbin Sun and Cheng Xin.
Neuc-MDS: Non-Euclidean Multidimensional Scaling Through Bilinear Forms
Oliver Chubet, Siddharth Sheth and Don Sheehy.
Simple Construction of Greedy Trees and Greedy Permutations
Anastasiia Tkachenko and Haitao Wang.
Independent Set and Dispersion Problems for Planar Points in Convex Position
Soham Samanta and Hugo Akitaya.
Path-Unfolding the Tesseract
Oliver Chubet, Donald Sheehy and Siddharth Sheth.
Approximating All-$k$-Nearest Neighbor Distances in Doubling Metrics
Francis Motta, Nicole Abreu and Parker Edwards.
Topological Machine Learning with Unreduced Persistence Diagrams
Linh Nguyen and Joseph Mitchell.
Fully Polynomial-Time Approximation Scheme for Anchored Multiwatchman Routes
Aditya Acharya and David Mount.
Evolving Distributions Under Local Motion
Varpreet Dhaliwal and Thomas Shermer.
Optimal Coverings of Spirals Using Half Guards
Prosenjit Bose, Jean-Lou De Carufel and John Stuart.
Routing from Pentagon to Octagon Delaunay graphs
Arjun Agarwal and Sayan Bandyapadhyay.
Extraction Theorems With Small Extraction Numbers
Waldo Gálvez, Mayank Goswami, Arturo Merino, Gibeom Park, Meng-Tsung Tsai and Victor Verdugo.
Computing Diverse and Nice Triangulations: Hardness and Algorithms
Halley Fritze, Sushovan Majhi, Marissa Masden, Atish Mitra and Michael Stickney.
Embedded Graph Reconstruction under Hausdorff Noise
Hugo Akitaya, João Carlos Canto de Almeida, Lucas Fonseca and Gabriel Shahrouzi.
Classifying Human Movement Using Discrete Fréchet and DTW Distances
Leticia Mattos Da Silva, Oded Stein and Justin Solomon.
A Framework for Solving Parabolic Partial Differential Equations on Discrete Domains
Reymond Akpanya, Adi Rivkin and Frederick Stock.
On inside-out dissections of polygons and polyhedra
Hugo Akitaya, Majid Mirzanezhad, Maarten Löffler and Carola Wenk.
Clustering Points with Line Segments under the Hausdorff Distance is NP-hard
Erik D. Demaine and Stefan Langerman.
Tiling with Three Polygons is Undecidable
Therese Biedl, Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat and Bastien Rivier.
Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons
Erfan Hosseini Sereshgi, Maarten Löffler, Frank Staals and Carola Wenk.
Length-Preserving Matching Between Closed Curves
Uml Modular Robots Group, Hugo Akitaya, Andrew Clements, Sam Downey, Jonathan Eisenbies, Saba Molaei, Sohan Samantha, Gabriel Shahrouzi and Frederick Stock.
Finding Shortest Reconfiguration Sequences for Modular Robots
Hugo Akitaya, Matias Korman and Frederick Stock.
Input-Sensitive Reconfiguration of Sliding Cubes
Henry Adams, Sushovan Majhi, Fedor Manin, Žiga Virk and Nicolò Zava.
Lower Bounding the Gromov--Hausdorff distance in Metric Graphs
Hanieh Ghabelialla, David Bremner and Rasoul Shahsavarifar.
A Data Depth Based Method in Anti Money Laundering (AML) Domain
Julian Vanecek, Auguste Gezalyan and David Mount.
Support Vector Machines in the Hilbert Geometry
Nilanjan Chakraborty, Prahlad Narasimhan Kasthurirangan, Joseph Mitchell, Linh Nguyen and Michael Perk.
Provable Methods for Searching with an Imperfect Sensor
Timothy Gomez, Rebecca Lin and Suhani Sharma. Deploying Convex Polyhedral Nets
Eliot Robson, Jack Spalding-Jamieson and Da Wei Zheng.
MOPBucket: A Massively OP algorithm for k-means clustering bucketloads of data
Kenneth McCabe and Michael Lesnick.
Sparse Approximation of the Subdivision-Rips Bifiltration for Doubling Metrics
Korey Pickering, Ka Teo and Ovidiu Daescu.
Implementation of a Trajectory Planner for an Articulated Probe

Scope and Format

The aim of this workshop is to bring together students and researchers from academia and industry, to stimulate collaboration on problems of common interest arising in geometric computations. Topics to be covered include, but are not limited to:

  • Algorithmic methods in geometry
  • I/O-scalable geometric algorithms
  • Animation of geometric algorithms
  • Computer graphics
  • Solid modeling
  • Geographic information systems
  • Computational metrology
  • Graph drawing
  • Experimental studies
  • Folding and unfolding
  • Geometric data structures
  • Implementation issues
  • Robustness in geometric computations
  • Computer vision
  • Robotics
  • Computer-aided design
  • Mesh generation
  • Manufacturing applications of geometry
  • Computational biology and geometric computations

Following the tradition of the previous Fall Workshops on Computational Geometry, the format of the workshop will be informal, extending over 2 days, with several breaks scheduled for discussions. The workshop is open to the public, with no registration fee. There will be an Open Problem Session where participants are encouraged to pose and present research questions.