{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T13:40:34Z","timestamp":1758634834056,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319272603"},{"type":"electronic","value":"9783319272610"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27261-0_39","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T01:24:59Z","timestamp":1448501099000},"page":"472-486","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Pixel and Voxel Representations of Graphs"],"prefix":"10.1007","author":[{"given":"Md. Jawaherul","family":"Alam","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Bl\u00e4sius","sequence":"additional","affiliation":[]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[]},{"given":"Torsten","family":"Ueckerdt","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"key":"39_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/978-3-319-12340-0_5","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"N Aerts","year":"2014","unstructured":"Aerts, N., Felsner, S.: Vertex contact graphs of paths on a grid. In: Kratsch, D., Todinca, I. (eds.) WG 2014. LNCS, vol. 8747, pp. 56\u201368. Springer, Heidelberg (2014)"},{"issue":"3","key":"39_CR2","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1007\/s00454-013-9521-1","volume":"50","author":"MJ Alam","year":"2013","unstructured":"Alam, M.J., Biedl, T., Felsner, S., Kaufmann, M., Kobourov, S., Ueckerdt, T.: Computing cartograms with optimal complexity. Discrete Comput. Geom. 50(3), 784\u2013810 (2013)","journal-title":"Discrete Comput. Geom."},{"unstructured":"Alam, M.J., Bl\u00e4sius, T., Rutter, I., Ueckerdt, T., Wolff, A.: Pixel and voxel representations of graphs. Arxiv report (2015). \n                      arxiv.org\/abs\/1507.01450","key":"39_CR3"},{"unstructured":"Badent, M., Binucci, C., Di Giacomo, E., Didimo, W., Felsner, S., Giordano, F., Kratochv\u00edl, J., Palladino, P., Patrignani, M., Trotta, F.: Homothetic triangle contact representations of planar graphs. In: Canadian Conference on Computational Geometry (CCCG 2007), pp. 233\u2013236 (2007)","key":"39_CR4"},{"key":"39_CR5","first-page":"121","volume":"52","author":"A Bezdek","year":"2005","unstructured":"Bezdek, A.: On the number of mutually touching cylinders. Comb. Comput. Geom. 52, 121\u2013127 (2005)","journal-title":"Comb. Comput. Geom."},{"issue":"1","key":"39_CR6","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s00022-013-0156-4","volume":"104","author":"K Bezdek","year":"2013","unstructured":"Bezdek, K., Reid, S.: Contact graphs of unit sphere packings revisited. J. Geom. 104(1), 57\u201383 (2013)","journal-title":"J. Geom."},{"issue":"4","key":"39_CR7","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0020-0190(87)90173-6","volume":"25","author":"SN Bhatt","year":"1987","unstructured":"Bhatt, S.N., Cosmadakis, S.S.: The complexity of minimizing wire lengths in VLSI layouts. Inform. Process. Lett. 25(4), 263\u2013267 (1987)","journal-title":"Inform. Process. Lett."},{"key":"39_CR8","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.dam.2014.10.017","volume":"181","author":"T Biedl","year":"2015","unstructured":"Biedl, T.: On triangulating \n                      \n                        \n                      \n                      $$k$$\n                    -outerplanar graphs. Discrete Appl. Math. 181, 275\u2013279 (2015). \n                      arxiv.org\/abs\/1310.1845","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"39_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s00454-010-9310-z","volume":"45","author":"TC Biedl","year":"2011","unstructured":"Biedl, T.C.: Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs. Discrete Comput. Geom. 45(1), 141\u2013160 (2011)","journal-title":"Discrete Comput. Geom."},{"key":"39_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BFb0029946","volume-title":"Mathematical Foundations of Computer Science 1997","author":"HL Bodlaender","year":"1997","unstructured":"Bodlaender, H.L.: Treewidth: algorithmic techniques and results. In: Pr\u00edvara, I., Ru\u017ei\u010dka, P. (eds.) MFCS 1997. LNCS, vol. 1295, pp. 19\u201336. Springer, Heidelberg (1997)"},{"issue":"3","key":"39_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00006","volume":"2","author":"P Bose","year":"1998","unstructured":"Bose, P., Everett, H., Fekete, S.P., Houle, M.E., Lubiw, A., Meijer, H., Romanik, K., Rote, G., Shermer, T.C., Whitesides, S., Zelle, C.: A visibility representation for graphs in three dimensions. J. Graph Algorithms Appl. 2(3), 1\u201316 (1998)","journal-title":"J. Graph Algorithms Appl."},{"key":"39_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-540-24595-7_55","volume-title":"Graph Drawing","author":"FJ Brandenburg","year":"2004","unstructured":"Brandenburg, F.J., Eppstein, D., Goodrich, M.T., Kobourov, S.G., Liotta, G., Mutzel, P.: Selected open problems in graph drawing. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 515\u2013539. Springer, Heidelberg (2004)"},{"issue":"3","key":"39_CR13","doi-asserted-by":"publisher","first-page":"421","DOI":"10.7155\/jgaa.00330","volume":"18","author":"FJ Brandenburg","year":"2014","unstructured":"Brandenburg, F.J.: 1-visibility representations of 1-planar graphs. J. Graph Algorithms Appl. 18(3), 421\u2013438 (2014)","journal-title":"J. Graph Algorithms Appl."},{"key":"39_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-642-36763-2_17","volume-title":"Graph Drawing","author":"D Bremner","year":"2013","unstructured":"Bremner, D., et al.: On representing graphs by touching cuboids. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 187\u2013198. Springer, Heidelberg (2013)"},{"issue":"1","key":"39_CR15","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/1328911.1328919","volume":"4","author":"AL Buchsbaum","year":"2008","unstructured":"Buchsbaum, A.L., Gansner, E.R., Procopiuc, C.M., Venkatasubramanian, S.: Rectangular layouts and contact graphs. ACM Trans. Algorithms 4(1), 8\u201328 (2008)","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"39_CR16","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1111\/cgf.12648","volume":"34","author":"R Cano","year":"2015","unstructured":"Cano, R., Buchin, K., Castermans, T., Pieterse, A., Sonke, W., Speckmann, B.: Mosaic drawings and cartograms. Comput. Graph. Forum 34(3), 361\u2013370 (2015)","journal-title":"Comput. Graph. Forum"},{"issue":"2","key":"39_CR17","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0925-7721(01)00066-9","volume":"23","author":"TM Chan","year":"2002","unstructured":"Chan, T.M., Goodrich, M.T., Kosaraju, S.R., Tamassia, R.: Optimizing area and aspect ratio in straight-line orthogonal tree drawings. Comput. Geom. Theory Appl. 23(2), 153\u2013162 (2002)","journal-title":"Comput. Geom. Theory Appl."},{"key":"39_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-642-45043-3_13","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S Chaplick","year":"2013","unstructured":"Chaplick, S., Kobourov, S.G., Ueckerdt, T.: Equilateral L-contact graphs. In: Brandst\u00e4dt, A., Jansen, K., Reischuk, R. (eds.) WG 2013. LNCS, vol. 8165, pp. 139\u2013151. Springer, Heidelberg (2013)"},{"issue":"1","key":"39_CR19","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00453-007-9117-3","volume":"54","author":"G Battista Di","year":"2009","unstructured":"Di Battista, G., Frati, F.: Small area drawings of outerplanar graphs. Algorithmica 54(1), 25\u201353 (2009)","journal-title":"Algorithmica"},{"key":"39_CR20","first-page":"147","volume":"2","author":"D Dolev","year":"1984","unstructured":"Dolev, D., Leighton, T., Trickey, H.: Planar embedding of planar graphs. Adv. Comput. Res. 2, 147\u2013161 (1984)","journal-title":"Adv. Comput. Res."},{"doi-asserted-by":"crossref","unstructured":"Dujmovi\u0107, V., Morin, P., Wood, D.: Layered separators for queue layouts, 3d graph drawing and nonrepetitive coloring. In: Foundations of Computer Science (FOCS 2013), pp. 280\u2013289. IEEE (2013)","key":"39_CR21","DOI":"10.1109\/FOCS.2013.38"},{"issue":"3","key":"39_CR22","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1007\/s00453-011-9525-2","volume":"63","author":"CA Duncan","year":"2012","unstructured":"Duncan, C.A., Gansner, E.R., Hu, Y.F., Kaufmann, M., Kobourov, S.G.: Optimal polygonal representation of planar graphs. Algorithmica 63(3), 672\u2013691 (2012)","journal-title":"Algorithmica"},{"issue":"5","key":"39_CR23","doi-asserted-by":"publisher","first-page":"721","DOI":"10.7155\/jgaa.00343","volume":"18","author":"W Evans","year":"2014","unstructured":"Evans, W., Kaufmann, M., Lenhart, W., Mchedlidze, T., Wismath, S.: Bar 1-visibility graphs and their relation to other nearly planar graphs. J. Graph Algorithms Appl. 18(5), 721\u2013739 (2014)","journal-title":"J. Graph Algorithms Appl."},{"key":"39_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-540-77120-3_16","volume-title":"Algorithms and Computation","author":"J-H Fan","year":"2007","unstructured":"Fan, J.-H., Lin, C.-C., Lu, H.-I., Yen, H.-C.: Width-optimal visibility representations of plane graphs. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 160\u2013171. Springer, Heidelberg (2007)"},{"doi-asserted-by":"crossref","unstructured":"Felsner, S.: Rectangle and square representations of planar graphs. Thirty Essays on Geometric Graph Theory, pp. 213\u2013248 (2013)","key":"39_CR25","DOI":"10.1007\/978-1-4614-0110-0_12"},{"doi-asserted-by":"crossref","unstructured":"Felsner, S., Francis, M.C.: Contact representations of planar graphs with cubes. In: Symposium on Computational Geometry (SoCG 2011), pp. 315\u2013320. ACM (2011)","key":"39_CR26","DOI":"10.1145\/1998196.1998250"},{"issue":"1","key":"39_CR27","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1002\/jgt.20121","volume":"51","author":"FV Fomin","year":"2006","unstructured":"Fomin, F.V., Thilikos, D.M.: New upper bounds on the decomposability of planar graphs. J. Graph Theory 51(1), 53\u201381 (2006)","journal-title":"J. Graph Theory"},{"issue":"4","key":"39_CR28","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s00453-006-0157-x","volume":"47","author":"H Fraysseix de","year":"2007","unstructured":"de Fraysseix, H., de Mendez, P.O.: Representations by contact and intersection of segments. Algorithmica 47(4), 453\u2013463 (2007)","journal-title":"Algorithmica"},{"key":"39_CR29","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1017\/S0963548300001139","volume":"3","author":"H Fraysseix de","year":"1994","unstructured":"de Fraysseix, H., de Mendez, P.O., Rosenstiehl, P.: On triangle contact graphs. Comb. Prob. Comput. 3, 233\u2013246 (1994)","journal-title":"Comb. Prob. Comput."},{"issue":"1","key":"39_CR30","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H Fraysseix de","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"issue":"1\u20133","key":"39_CR31","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0012-365X(00)00204-1","volume":"229","author":"P Hlin\u011bn\u00fd","year":"2001","unstructured":"Hlin\u011bn\u00fd, P., Kratochv\u00edl, J.: Representing graphs by disks and balls (a survey of recognition-complexity results). Discrete Math. 229(1\u20133), 101\u2013124 (2001)","journal-title":"Discrete Math."},{"key":"39_CR32","first-page":"141","volume":"88","author":"P Koebe","year":"1936","unstructured":"Koebe, P.: Kontaktprobleme der konformen Abbildung. Berichte \u00fcber die Verhandlungen der S\u00e4chsischen Akademie der Wissenschaften zu Leipzig. Math. Phy. Kla. 88, 141\u2013164 (1936)","journal-title":"Math. Phy. Kla."},{"doi-asserted-by":"crossref","unstructured":"Leiserson, C.E.: Area-efficient graph layouts (for VLSI). In: Foundations of Computer Science (FOCS 1980), pp. 270\u2013281. IEEE (1980)","key":"39_CR33","DOI":"10.1109\/SFCS.1980.13"},{"key":"39_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-63938-1_49","volume-title":"Graph Drawing","author":"J Pach","year":"1997","unstructured":"Pach, J., Thiele, T., T\u00f3th, G.: Three-dimensional grid drawings of graphs. In: Di Battista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 47\u201351. Springer, Heidelberg (1997)"},{"issue":"1","key":"39_CR35","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.jda.2006.06.002","volume":"6","author":"M Patrignani","year":"2008","unstructured":"Patrignani, M.: Complexity results for three-dimensional orthogonal graph drawing. J. Discrete Algorithms 6(1), 140\u2013161 (2008)","journal-title":"J. Discrete Algorithms"},{"unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Symposium on Discrete Algorithms (SODA 1990), pp. 138\u2013148. ACM-SIAM (1990)","key":"39_CR36"},{"key":"39_CR37","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R Tamassia","year":"1986","unstructured":"Tamassia, R., Tollis, I.G.: A unified approach a visibility representation of planar graphs. Discrete Comput. Geom. 1, 321\u2013341 (1986)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"39_CR38","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0095-8956(86)90061-4","volume":"40","author":"C Thomassen","year":"1986","unstructured":"Thomassen, C.: Interval representations of planar graphs. J. Comb. Theory B 40(1), 9\u201320 (1986)","journal-title":"J. Comb. Theory B"},{"issue":"3","key":"39_CR39","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF02711493","volume":"15","author":"C Zong","year":"1996","unstructured":"Zong, C.: The kissing numbers of tetrahedra. Discrete Comput. Geom. 15(3), 239\u2013252 (1996)","journal-title":"Discrete Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27261-0_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T20:13:20Z","timestamp":1569269600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27261-0_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319272603","9783319272610"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27261-0_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"27 November 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}