About:Convex embedding

In geometric graph theory, a convex embedding of a graph is an embedding of the graph into a Euclidean space, with its vertices represented as points and its edges as line segments, so that all of the vertices outside a specified subset belong to the convex hull of their neighbors. More precisely, if is a subset of the vertices of the graph, then a convex -embedding embeds the graph in such a way that every vertex either belongs to or is placed within the convex hull of its neighbors. A convex embedding into -dimensional Euclidean space is said to be in general position if every subset of its vertices spans a subspace of dimension .