Universal 3-Dimensional Visibility Representations Graphs

Alt, Helmut and Godau, Michael and Whitesides, Sue (1996) Universal 3-Dimensional Visibility Representations Graphs. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995 , pp. 8-19(Official URL: http://dx.doi.org/10.1007/BFb0021785).

Full text not available from this repository.

Abstract

This paper studies 3-dimensional visibility representations of graphs in which objects in 3-d correspond to vertices and vertical visibilities between these objects correspond to edges. We ask which classes of simple objects are universal, i.e. powerful enough to represent all graphs. In particular, we show that there is no constant k for which the class of all polygons having k or fewer sides is universal. However, we show by construction that every graph on n vertices can be represented by polygons each having at most 2n sides. The constrution can be carried out by an O(n^2) algorithm. We also study the universality of classes of simple objects (translates of a single, not necessarily polygonal object) relative to cliques K_n and similarly relative to complete bipartite graphs K_{n,m}.

Item Type: Conference Paper
Additional Information: 10.1007/BFb0021785
Classifications: Z Theory > Z.500 Representations
P Styles > P.900 Visibility
P Styles > P.060 3D
URI: http://gdea.informatik.uni-koeln.de/id/eprint/137

Actions (login required)

View Item View Item