 In the geometric setting, finding a diagonal flip path between two triangulations that minimizes the number of diagonal flips over all such paths is NP-complete.
<clarity>  In the geometric setting, finding a diagonal flip path between two triangulations that minimizes the number of diagonal flips over all such paths is NP-complete.
 In the geometric setting, finding a diagonal flip path between two triangulations containing the minimum number of flips is NP-complete.