Y by
Given is a convex octagon
. Given a triangulation
, one can take two triangles
and
and replace them with
and
. Find the minimal number of operations
we have to do so that for any pair of triangulations
, we can reach
from
using at most
operations.










