On a visibility representation of graphs
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 thi...
| Autores: | , , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 1996 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/33415 |
| Acceso en línea: | http://hdl.handle.net/11441/33415 https://doi.org/10.1007/BFb0021799 |
| Access Level: | acceso abierto |
| Palabra clave: | Geometry Algorithm Analysis and Problem Complexity Combinatorics Software Engineering Computer Graphics Computer-Aided Engineering (CAD/CAE) and Design |
| Sumario: | 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. |
|---|