29 citations · 89 across the 22 of their papers we have counts for
Showing 2012 · cs.CGShow all
2 papers · 2 filters
cs.CG2012★ 29 cited
Flip Distance Between Triangulations of a Simple Polygon is NP-Complete
Oswin Aichholzer, Wolfgang Mulzer, Alexander Pilz
Let T be a triangulation of a simple polygon. A flip in T is the operation of removing one diagonal of T and adding a different one such that the resulting graph is again a triangu…
cs.CG2012★ 27 cited
Flip Distance Between Triangulations of a Planar Point Set is APX-Hard
Alexander Pilz
In this work we consider triangulations of point sets in the Euclidean plane, i.e., maximal straight-line crossing-free graphs on a finite set of points. Given a triangulation of a…