Visibility representations of complete graphs

ill this paper we study 3-dimensional visibility representations of complete graphs. The vertices are represented by equal regular polygons lying in planes parallel to the xy-plane. Two vertices are adjacent if and only if the two corresponding polygons see each other - i.e. it is possible to construct an abscissa perpendicular to the xy-plane connecting the two polygons and avoiding all the others. We give the bounds for the maximal size f(k) of a clique represented by regular k-gons: [k+1/2] + 2 less than or equal to f(k) less than or equal to 2(2k) and we present a particular result fur triangles: f(3) greater than or equal to 14.