Please note: This master’s thesis presentation will take place online.
Reza Bigdeli, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Anna Lubiw
The flip graph for a set $P$ of points in the plane has a vertex for every triangulation of $P$, and an edge when two triangulations differ by one flip that replaces one triangulation edge by another.
The flip graph is known to have some connectivity properties: