LIPIcs.SoCG.2024.90.pdf
- Filesize: 1.12 MB
- 6 pages
We re-examine the 1987 paper by Joan Lucas[Lucas, 1987], who showed that the edge-flip graph of convex polygon triangulations is Hamiltonian. We focus specifically on the first part of her paper on Hamiltonian paths, and we provide a simplified algorithm for that case which elucidates how to assemble a recursive subdivision that she refers to as "stacks." Finally, we provide an interactive web-based visualization of Hamiltonian paths through the stacks.
Feedback for Dagstuhl Publishing