Cobos Gavala, JavierDana Jiménez, Juan CarlosHurtado, FerránMárquez Pérez, AlbertoMateos Mateos, Felipe2016-01-272016-01-271996http://hdl.handle.net/11441/33415We 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.application/pdfengAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/GeometryAlgorithm Analysis and Problem ComplexityCombinatoricsSoftware EngineeringComputer GraphicsComputer-Aided Engineering (CAD/CAE) and Designinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccesshttps://doi.org/10.1007/BFb0021799