The goal of this paper is to investigate the curves intersected by a vertical plane with the surfaces based on certain NCP functions. The convexity and differentiability of these curves are studied as well. In most cases, the inflection points of the curves cannot be expressed exactly. Therefore, we instead estimate the interval where the curves are convex under this situation. Then, with the help of differentiability and convexity, we obtain the local minimum or maximum of the curves accordingly. The study of these curves is very useful to binary quadratic programming.