On Representing Graphs by Touching Cuboids-Reference-Cited by-同舟云学术

On Representing Graphs by Touching Cuboids

Published:2013 Issue: Volume: Page:187-198
ISSN:0302-9743
Container-title:Graph Drawing
language:
Short-container-title:

Author:

Bremner David,Evans William,Frati Fabrizio,Heyer Laurie,Kobourov Stephen G.,Lenhart William J.,Liotta Giuseppe,Rappaport David,Whitesides Sue H.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-36763-2_17

Reference23 articles.

1. 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)

2. 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)

3. Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall (1999)

4. Borchard-Ott, W.: Crystallography. Springer (2011)

5. Breu, H.: Algorithmic Aspects of Constrained Unit Disk Graphs. Ph.D. thesis, The University of British Columbia, Canada (1996)

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Representing Graphs and Hypergraphs by Touching Polygons in 3D;Lecture Notes in Computer Science;2019

2. Weak Unit Disk and Interval Representation of Graphs;Graph-Theoretic Concepts in Computer Science;2016

3. On Contact Graphs with Cubes and Proportional Boxes;Lecture Notes in Computer Science;2016

4. Pixel and Voxel Representations of Graphs;Lecture Notes in Computer Science;2015

5. Contact Representations of Graphs in 3D;Lecture Notes in Computer Science;2015