On Representing Graphs by Touching Cuboids
نویسندگان
چکیده
We consider contact representations of graphs where vertices are represented by cuboids, i.e. interior-disjoint axis-aligned boxes in 3D space. Edges are represented by a proper contact between the cuboids representing their endvertices. Two cuboids make a proper contact if they intersect and their intersection is a non-zero area rectangle contained in the boundary of both. We study representations where all cuboids are unit cubes, where they are cubes of different sizes, and where they are axis-aligned 3D boxes. We prove that it is NP-complete to decide whether a graph admits a proper contact representation by unit cubes. We also describe algorithms that compute proper contact representations of varying size cubes for relevant graph families. Finally, we give two new simple proofs of a theorem by Thomassen stating that all planar graphs have a proper contact representation by touching cuboids.
منابع مشابه
On Touching Triangle Graphs
In this paper, we consider the problem of representing graphs by triangles whose sides touch. We present linear time algorithms for creating touching triangle representations for outerplanar graphs, square grid graphs, and hexagonal grid graphs. The class of graphs with touching triangle representations is not closed under minors, making characterization difficult. We do show that pairs of vert...
متن کاملTouching Graphs of Unit Balls
The touching graph of balls is a graph that admits a representation by non-intersecting balls in the space (of prescribed dimension), so that its edges correspond to touching pairs of balls. By a classical result of Koebe [?], the disc touching graphs are exactly the planar graphs. This paper deals with a recognition of unit-ball touching graphs. The 2– dimensional case was proved to be NP-hard...
متن کاملOn the Computation of Maximal-Correlated Cuboids Cells
The main idea of iceberg data cubing methods relies on optimization techniques for computing only the cuboids cells above certain minimum support threshold. Even using such approach the curse of dimensionality remains, given the large number of cuboids to compute, which produces, as we know, huge outputs. However, more recently, some efforts have been done on computing only closed cuboids. Neve...
متن کاملThe Colin de Verdière Number and Sphere Representations of a Graph
Colin de Verdi ere introduced an interesting linear algebraic invariant (G) of graphs. He proved that (G) 2 if and only if G is outerplanar, and (G) 3 if and only if G is planar. We prove that if the complement of a graph G on n nodes is outerplanar, then (G) n ? 4, and if it is planar, then (G) n ? 5. We give a full characterization of maximal planar graphs with (G) = n ? 5. In the opposite di...
متن کاملComputing Data Cubes without Redundant Aggregated Nodes and Single Graph Paths: The Sequential MCG Approach
In this paper, we present a novel full cube computation and representation approach, named MCG. A data cube can be defined as a lattice of cuboids. In our approach, each cuboid is seen as a set of sub-graphs. Redundant suffixed nodes in such sub-graphs are quite common, but their elimination is a hard problem as some previous cube approaches demonstrate. MCG approach computes a data cube in two...
متن کامل