Given a set of vertex-norm, or distances from the origin, in two-dimensional space, there does not always exist a convex configuration, or convex polygon, whose vertices satisfy the vertex-norm. In this research, we provide the necessary and sufficient conditions, based on the angles spanned by the polygon around the origin, for the existence of such convex configuration. General strategies for constructing a convex configuration satisfying a given vertex-norm set as well as examples of vertex-norm sets for which no such convex configuration exists are also illustrated.