Featured
CGYesterday
Flip Distance Between Triangulations of Convex Polygons is NP-CompleteJoseph Dorfer
This resolves a fundamental open problem in computational geometry regarding the complexity of flip distance for convex polygon triangulations, which had resisted proof for decades.