Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Alam, M.J., Biedl, T.C., Felsner, S., Kaufmann, M., Kobourov, S.G., Ueckerdt, T.: Computing cartograms with optimal complexity. In: Dey, T.K., Whitesides, S. (eds.) Symposium on Computational Geometry, SoCG 2012, pp. 21–30 (2012)
Badent, M., Binucci, C., Giacomo, E.D., Didimo, W., Felsner, S., Giordano, F., KratochvÃl, J., Palladino, P., Patrignani, M., Trotta, F.: Homothetic triangle contact representations of planar graphs. In: Bose, P. (ed.) Canadian Conference on Computational Geometry, CCCG 2007, pp. 233–236 (2007)
Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall (1999)
Borchard-Ott, W.: Crystallography. Springer (2011)
Breu, H.: Algorithmic Aspects of Constrained Unit Disk Graphs. Ph.D. thesis, The University of British Columbia, Canada (1996)
Buchsbaum, A.L., Gansner, E.R., Procopiuc, C.M., Venkatasubramanian, S.: Rectangular layouts and contact graphs. ACM Transactions on Algorithms 4(1) (2008)
Czyzowicz, J., Kranakis, E., Krizanc, D., Urrutia, J.: Discrete realizations of contact and intersection graphs. International Journal of Pure and Applied Mathematics 13(4), 429–442 (2004)
de Fraysseix, H., Ossona de Mendez, P.: Representations of Planar Graphs by Segments. Colloquia Mathematica Societatis János Bolyai, vol. 63, pp. 109–117. North-Holland (2007)
Duncan, C.A., Gansner, E.R., Hu, Y.F., Kaufmann, M., Kobourov, S.G.: Optimal polygonal representation of planar graphs. Algorithmica 63(3), 672–691 (2012)
Eades, P., Whitesides, S.: The logic engine and the realization problem for nearest neighbor graphs. Theoretical Computer Science 169(1), 23–37 (1996)
Felsner, S.: Rectangle and square representations of planar graphs. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory. Springer (2012)
Felsner, S., Francis, M.C.: Contact representations of planar graphs with cubes. In: Hurtado, F., van Kreveld, M.J. (eds.) Symposium on Computational Geometry, SoCG 2011, pp. 315–320 (2011)
de Fraysseix, H., Ossona de Mendez, P., Rosenstiehl, P.: On triangle contact graphs. Combinatorics, Probability & Computing 3, 233–246 (1994)
de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41–51 (1990)
He, X.: On floor-plan of plane graphs. SIAM Journal on Computing 28(6), 2150–2167 (1999)
Kaufmann, M., Wagner, D. (eds.): Drawing graphs: methods and models. Springer (2001)
Koebe, P.: Kontaktprobleme der konformen Abbildung. Berichte über die Verhandlungen der Sächsischen Akad. der Wissenschaften zu Leipzig. Math.-Phys. Klasse 88, 141–164 (1936)
Koźmiński, K., Kinnen, E.: Rectangular duals of planar graphs. Networks 15, 145–157 (1985)
Leinwand, S.M., Lai, Y.T.: An algorithm for building rectangular floor-plans. In: Lambert, P.H., Ofek, H., O’Neill, L.A., Pistilli, P.O., Losleben, P., Nash, J.D., Shaklee, D.W., Preas, B.T., Lerman, H.N. (eds.) Design Automation Conference, DAC 1984, pp. 663–664 (1984)
Schnyder, W.: Planar graphs and poset dimension. Order 5(4), 323–343 (1989)
Schnyder, W.: Embedding planar graphs on the grid. In: Symposium on Discrete Algorithms, SODA 1990, pp. 138–148 (1990)
Thomassen, C.: Interval representations of planar graphs. Journal of Combinatorial Theory, Series B 40(1), 9–20 (1986)
Ungar, P.: On diagrams representing graphs. Journal of the London Mathematical Society 28, 336–342 (1953)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bremner, D. et al. (2013). On Representing Graphs by Touching Cuboids. In: Didimo, W., Patrignani, M. (eds) Graph Drawing. GD 2012. Lecture Notes in Computer Science, vol 7704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36763-2_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-36763-2_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36762-5
Online ISBN: 978-3-642-36763-2
eBook Packages: Computer ScienceComputer Science (R0)