Before revision:  An   \emph{  NP-hardness result for the case that D(P ,P')
After revision:  An sense, bounding the distance between a shortcut and its corresponding section of the curve. In this work, we aim to provide a systematic overview of curve simplification problems under \emph{ NP-hardness result for the case that D(P ,P')