Before revision:  An   \emph{  NP-hardness result for the case that D(P ,P')
After revision:  An \emph{ distance. And we study different restrictions on the choice of vertices for P'. We provide polynomial-time algorithms for some variants of the global curve simplification problem and show NP-hardness result for the case that D(P ,P')