The preliminary program is
| 8.15-9.00 | Breakfast available | in Steinman Exhibition Room | |
| 9.00-9.20 | Ivo Vigan | Packing and Covering a Polygon with Geodesic Discs | |
| 9.20-9.40 | John Iacono | The Complexity of Order Type Isomorphism | |
| 9.40-10.00 | Mark Yagnatinsky | A Simple Way to Place A Point to Maximize Angles | |
| 10.00-10.30 | 1st Coffee Break | in Steinman Exhibition Room | |
| 10.30-11.15 | Jianting Zhang | High-Performance Processing of Large-Scale Geospatial Data on GPUs | |
| 11.15-11.30 | 2nd Coffee Break | in Steinman Exhibition Room | |
| 11.30-10.50 | W Randolph Franklin | Parallel Volume Computation of Massive Polyhedron Union | |
| 11.50-12.10 | Wenli Li | Parallel Multiple Observer Siting on Terrain | |
| 12.10-12.30 | Daniel Benedetti | CUDA-Accelerated ODETLAP: A Parallel Lossy Compression Implementation | |
| 12.30-12.40 | Dean Gilda Barabino | Welcome | |
| 12.40-14.00 | Lunch Break | in Steinman Exhibition Room | |
| 14.00-14.20 | Val Pinciu | Guarding Orthogonal Polygons with h Holes: A Bound Independent of h | |
| 14.20-14.40 | Matthew Johnson | Representing a Graph Using Few Obstacles | |
| 14.40-15.00 | Christiane Schmidt | Simple Rectilinear Polygons are Perfect under Rectilinear Vision | |
| 15.00-15.20 | 3rd Coffee Break | in Steinman Exhibition Room | |
| 15.20-15.40 | Huck Bennett | Amortized Analysis of Balanced Quadtrees | |
| 15.40-16.00 | Zhongdi Luo | Resolution-Exact Algorithms for Link Robots | |
| 16.00-16.20 | Robert Fraser | On Geometric Duality for 2-Admissible Geometric Set Cover and Hitting Set Problems | |
| 16.20-16.40 | Sorelle Friedler | Probabilistic Kinetic Data Structures | |
| 16.40-17.00 | 4th Coffee Break | in Steinman Exhibition Room | |
| 17.00-17.20 | Bahman Kalantari | On the Triangle Algorithm for Convex Hull Membership | |
| 17.20-17.40 | Thomas Gibson | Experiments with the Triangle Algorithm for Linear Systems | |
| 17.40-18.00 | Meng Li | Experimental Study of the Convex Hull Decision Problem via a New Geometric Algorithm | |
| 18.00-18.?? | everyone | Problem Session |
| 8.15-9.00 | Breakfast available | in Steinman Exhibition Room | |
| 9.00-9.20 | Justin Iwerks | Tetrahedron Contact Graphs | |
| 9.20-9.40 | Michael Biro | Counting Subgraphs of triangulated Prism Graphs | |
| 9.40-10.00 | Samira Daruki | Range Counting Coresets for Uncertain Data | |
| 10.00-10.30 | 1st Coffee Break | in Steinman Exhibition Room | |
| 10.30-11.15 | Csaba Toth | Universality in Geometric Graph Theory | |
| 11.15-11.30 | 2nd Coffee Break | in Steinman Exhibition Room | |
| 11.30-11.50 | Wah Loon Keng | New and Improved Stretch Factors of Yao Graphs | |
| 11.50-12.10 | Iffat Chowdhury | A Characterization of Consistent Digital Line Segments | |
| 12.10-12.30 | Chien-Chun Ni | Capacitated Wireless Base Station Allocation in Mobile Networks by Optimal Transportation Theory | |
| 12.30-14.00 | Lunch Break | in Steinman Exhibition Room | |
| 14.00-14.20 | Robert Fraser | The Distance 4-Sector of Two Points is Unique | |
| 14.20-14.40 | Undine Leopold | Vertex-Transitive Polyhedra in 3-Space | |
| 14.40-15.00 | Carlos Bedregal | Longest-Edge Algorithms for Quality Delaunay Refinement | |
| 15.00--15.20 | 3rd Coffee Break | in Steinman Exhibition Room | |
| 15.20--15.40 | Donald Sheehy | Persistent Homology and Nested Dissection | |
| 15.40--16.00 | David Letscher | Random Projections, Topological Persistence, and the Johnson-Lindenstrauss Lemma | |
| 16.00--16.20 | Xianfeng Gu | A Discrete Uniformization Theorem for Polyhedral Surfaces | |
| 16.20--16.40 | Rui Shi | Hyperbolic Harmonic Mapping for Surface Registration | |
| 16.40--17.00 | 4th Coffee Break | in the Steinman Exhibition Room | |
| 17.00--17.20 | Mirela Damian | Unfolding Orthogrids with Constant Refinement | |
| 17.20--17.40 | Kyle Sykes | The Zipper Foldings of the Diamond | |
| 17.40--18.00 | Braxton Carrigan | Golden Triangulations | |
| 18.00--18.05 | Peter Brass | Closing Comments |