  In this paper, we deal with the question; under what conditions the points
$P_i(xi,yi)$ $(i = 1,\cdots, n)$ form a convex polygon provided $x_1 < \cdots <
x_n$ holds. One of the main findings of the paper can be stated as follows:
"Let $P_1(x_1,y_1),\cdots ,P_n(x_n,y_n)$ are $n$ distinct points ($n\geq3$)
with $x_1<\cdots<x_n$. Then $\overline{P_1P_2},\cdots \overline{P_nP_1}$ form a
convex $n$-gon that lies in the half-space \begin{equation*}{
\underline{\mathbb{H}}=\bigg\{(x,y)\big|\quad x\in\mathbb{R} \quad \mbox{and}
\quad y\leq
y_1+\bigg(\dfrac{x-x_1}{x_n-x_1}\bigg)(y_n-y_1)\bigg\}\subseteq{\mathbb{R}^{2}}
} \end{equation*} if and only if the following inequality holds
\begin{equation} \dfrac{y_i-y_{i-1}}{x_i-x_{i-1}} \leq
\dfrac{y_{i+1}-y_{i}}{x_{i+1}-x_{i}} \quad \quad \mbox{for all} \quad \quad
i\in\{2,\cdots,n-1\} ." \end{equation} Based on this result, we establish a
linkage between the property of sequential convexity and convex polygon. We
show that in a plane if any $n$ points are scattered in such a way that their
horizontal and vertical distances preserve some specific monotonic properties;
then those points form a $2$-dimensional convex polytope.
