3D Visibility Representations by Regular Polygons

Abstract

We study 3D visibility representations of complete graphs where vertices are represented by equal regular polygons lying in planes parallel to the xy-plane. Edges correspond to the z-parallel visibility among these polygons. We improve the upper bound on the maximum size of a complete graph with a 3D visibility representation by regular n-gons from 2 O(n) to O(n 4).