Computational Geometry
Each talk will be 20 minutes long, including time for questions. We have a total of seven talks, so we either need to run slightly long on one of the two days (ending at 5:00 instaed of 4:45) or use an extra overflow day to accommodate everyone.
The foollowing schedule is tentative. Talks on each day listed in alphabetical order by student name, not in chronological order. I've split the topics into "meshing" on Thursday and non-"meshing" on Tuesday, but presenters are free to swap days by mutual agreement. Please let Jeff know as soon as possible if you cannot present on the day that you are listed.
- Thu Apr 30
-
- Ilia Kheirkhah — Provably good mesh generation
- Parin Trivedi — An efficient Cartesian mesh generation strategy for complex geometries
- Weixuan Zheng — An optimal algorithm for 3D triangle mesh slicing
- Tue May 5
-
- Junjie Ao — Geometric deep learning: Grids, groups, graphs, geodesics, and gauges
- Saarah Nazar — Quantum algorithms for Hopcroft’s problem
- Pranav Pullabhotla — Simplification of trajectory streams
- Youyou Wu — A linear time algorithm for the maximum overlap of two convex polygons under translation
- Thu May 7
-
Overflow if necessary