On a Visibility Representation of Graphs

Cobos, F. J. and Dana, J. C. and Hurtado, Ferran and Márquez, Alberto and Mateos, F. (1996) On a Visibility Representation of Graphs. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995 , pp. 152-161(Official URL: http://dx.doi.org/10.1007/BFb0021799).

Full text not available from this repository.


We give a visibility representation of graphs which extends some very well-known representations considered extensively in the literature. Concretely, the vertices are represented by a collection of parallel hyper-rectangles in R^n and the visibility is orthogonal to those hyper-rectangles. With this generalization, we can prove that each graph admits a visibility representation. But, it arises the problem of determining the minimum Euclidean space where such representation is possible. We consider this problem for concrete well-known families of graphs such as planar graphs, complete graphs and complete bipartite graphs.

Item Type: Conference Paper
Additional Information: 10.1007/BFb0021799
Classifications: G Algorithms and Complexity > G.070 Area / Edge Length
P Styles > P.900 Visibility
G Algorithms and Complexity > G.560 Geometry
URI: http://gdea.informatik.uni-koeln.de/id/eprint/139

Actions (login required)

View Item View Item