On the existence of a combinatorial Schlegel diagram of a simplicial unstacked 3-polytope with a prescribed set of vertices (Q687115)

The paper refers to 2-dimensional Schlegel diagrams of 3-polytopes, i.e. to central projections of their boundary cell complexes onto one of their facets through a projection center lying beyond (but closely enough to) that facet. It is proved that (with two exceptions) any finite set \(V\subset R^ 2\) with exactly three elements in the boundary of its convex hull \(\text{conv}(V)\) is the vertex set of a triangulation of \(\text{conv}(V)\) which is a combinatorial Schlegel diagram of a simplicial unstacked 3-polytope. The two exceptional cases can be described as follows: either \(V\) minus one of its boundary points is in a (weak) convex position, or \(V\) minus one of its inner points is contained in the three segments joining this inner point with the vertices of \(\text{conv}(V)\).