Happy endings for flip graphs
英文摘要：
We show that the triangulations of a finite point set form a flip graph that can be embedded isometrically into a hypercube, if and only if the point set has no empty convex pentagon. Point sets of this type include convex subsets of lattices, points on two lines, and several other infinite families. As a consequence, flip distance in such point sets can be computed efficiently.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
