{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:12:44Z","timestamp":1742922764536,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121999"},{"type":"electronic","value":"9783642122002"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12200-2_37","type":"book-chapter","created":{"date-parts":[[2010,4,21]],"date-time":"2010-04-21T13:53:05Z","timestamp":1271857985000},"page":"417-432","source":"Crossref","is-referenced-by-count":7,"title":["Optimal Polygonal Representation of Planar Graphs"],"prefix":"10.1007","author":[{"given":"E. R.","family":"Gansner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y. F.","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. G.","family":"Kobourov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/3-540-58950-3_388","volume-title":"Graph Drawing","author":"G.D. Battista","year":"1995","unstructured":"Battista, G.D., Lenhart, W., Liotta, G.: Proximity drawability: A survey. In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol.\u00a0894, pp. 328\u2013339. Springer, Heidelberg (1995)"},{"key":"37_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/3-540-46648-7_37","volume-title":"Graph Drawing","author":"T. Biedl","year":"1999","unstructured":"Biedl, T., Bretscher, A., Meijer, H.: Rectangle of influence drawings of graphs without filled 3-cycles. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol.\u00a01731, pp. 359\u2013368. Springer, Heidelberg (1999)"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Bruls, M., Huizing, K., van Wijk, J.J.: Squarified treemaps. In: Proc. Joint Eurographics\/IEEE TVCG Symp. Visualization, VisSym., pp. 33\u201342 (2000)","DOI":"10.1007\/978-3-7091-6783-0_4"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Buchsbaum, A.L., Gansner, E.R., Procopiuc, C.M., Venkatasubramanian, S.: Rectangular layouts and contact graphs. ACM Transactions on Algorithms\u00a04(1) (2008)","DOI":"10.1145\/1328911.1328919"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0020-0190(95)00020-D","volume":"54","author":"M. Chrobak","year":"1995","unstructured":"Chrobak, M., Payne, T.: A linear-time algorithm for drawing planar graphs. Inform. Process. Lett.\u00a054, 241\u2013246 (1995)","journal-title":"Inform. Process. Lett."},{"issue":"7","key":"37_CR6","doi-asserted-by":"publisher","first-page":"1794","DOI":"10.1016\/j.disc.2007.12.087","volume":"309","author":"M. de Berg","year":"2009","unstructured":"de Berg, M., Mumford, E., Speckmann, B.: On rectilinear duals for vertex-weighted plane graphs. Discrete Mathematics\u00a0309(7), 1794\u20131812 (2009)","journal-title":"Discrete Mathematics"},{"key":"37_CR7","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1017\/S0963548300001139","volume":"3","author":"H. de Fraysseix","year":"1994","unstructured":"de Fraysseix, H., de Mendez, P.O., Rosenstiehl, P.: On triangle contact graphs. Combinatorics, Probability and Computing\u00a03, 233\u2013246 (1994)","journal-title":"Combinatorics, Probability and Computing"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: Small sets supporting Fary embeddings of planar graphs. In: Procs. 20th Symposium on Theory of Computing (STOC), pp. 426\u2013433 (1988)","DOI":"10.1145\/62212.62254"},{"issue":"1","key":"37_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. de Fraysseix","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica\u00a010(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"37_CR10","doi-asserted-by":"publisher","first-page":"54","DOI":"10.2307\/2412323","volume":"18","author":"K.R. Gabriel","year":"1969","unstructured":"Gabriel, K.R., Sokal, R.R.: A new statistical approach to geographical analysis. Systematic Zoology\u00a018, 54\u201364 (1969)","journal-title":"Systematic Zoology"},{"issue":"6","key":"37_CR11","doi-asserted-by":"publisher","first-page":"1218","DOI":"10.1137\/0222072","volume":"22","author":"X. He","year":"1993","unstructured":"He, X.: On finding the rectangular duals of planar triangular graphs. SIAM Journal of Computing\u00a022(6), 1218\u20131226 (1993)","journal-title":"SIAM Journal of Computing"},{"issue":"6","key":"37_CR12","doi-asserted-by":"publisher","first-page":"2150","DOI":"10.1137\/S0097539796308874","volume":"28","author":"X. He","year":"1999","unstructured":"He, X.: On floor-plan of plane graphs. SIAM Journal of Computing\u00a028(6), 2150\u20132167 (1999)","journal-title":"SIAM Journal of Computing"},{"issue":"1","key":"37_CR13","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1006\/jctb.1998.1846","volume":"74","author":"P. Hlin\u011bn\u00fd","year":"1998","unstructured":"Hlin\u011bn\u00fd, P.: Classes and recognition of curve contact graphs. Journal of Comb.\u00a0 Theory (B)\u00a074(1), 87\u2013103 (1998)","journal-title":"Journal of Comb.\u00a0 Theory (B)"},{"issue":"1-3","key":"37_CR14","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 Mathematics\u00a0229(1-3), 101\u2013124 (2001)","journal-title":"Discrete Mathematics"},{"issue":"4","key":"37_CR15","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R.E.: Efficient planarity testing. Journal of the ACM\u00a021(4), 549\u2013568 (1974)","journal-title":"Journal of the ACM"},{"key":"37_CR16","doi-asserted-by":"publisher","first-page":"1502","DOI":"10.1109\/5.163414","volume":"80","author":"J.W. Jaromczyk","year":"1992","unstructured":"Jaromczyk, J.W., Toussaint, G.T.: Relative neighborhood graphs and their relatives. Proceedings of the IEEE\u00a080, 1502\u20131517 (1992)","journal-title":"Proceedings of the IEEE"},{"key":"37_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/3-540-56402-0_53","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"G. Kant","year":"1993","unstructured":"Kant, G.: Hexagonal grid drawings. In: Mayr, E.W. (ed.) WG 1992. LNCS, vol.\u00a0657, pp. 263\u2013276. Springer, Heidelberg (1993)"},{"key":"37_CR18","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"G. Kant","year":"1996","unstructured":"Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica\u00a016, 4\u201332 (1996) (special issue on Graph Drawing, edited by G. Di Battista and R. Tamassia)","journal-title":"Algorithmica"},{"key":"37_CR19","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0304-3975(95)00257-X","volume":"172","author":"G. Kant","year":"1997","unstructured":"Kant, G., He, X.: Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theoretical Computer Science\u00a0172, 175\u2013193 (1997)","journal-title":"Theoretical Computer Science"},{"key":"37_CR20","unstructured":"Koebe, P.: Kontaktprobleme der konformen Abbildung. Berichte \u00fcber die Verhandlungen der S\u00e4chsischen Akademie der Wissenschaften zu Leipzig. Math.-Phys. Klasse 88,141\u2013164 (1936)"},{"issue":"11","key":"37_CR21","doi-asserted-by":"publisher","first-page":"1401","DOI":"10.1109\/31.14464","volume":"35","author":"K. Ko\u017ami\u0144ski","year":"1988","unstructured":"Ko\u017ami\u0144ski, K., Kinnen, W.: Rectangular dualization and rectangular dissections. IEEE Transactions on Circuits and Systems\u00a035(11), 1401\u20131416 (1988)","journal-title":"IEEE Transactions on Circuits and Systems"},{"key":"37_CR22","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1109\/43.3167","volume":"7","author":"Y.-T. Lai","year":"1988","unstructured":"Lai, Y.-T., Leinwand, S.M.: Algorithms for floorplan design via rectangular dualization. IEEE Transactions on Computer-Aided Design\u00a07, 1278\u20131289 (1988)","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"37_CR23","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF01840399","volume":"5","author":"Y.-T. Lai","year":"1990","unstructured":"Lai, Y.-T., Leinwand, S.M.: A theory of rectangular dual graphs. Algorithmica\u00a05, 467\u2013483 (1990)","journal-title":"Algorithmica"},{"key":"37_CR24","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/S0196-6774(03)00057-9","volume":"48","author":"C.-C. Liao","year":"2003","unstructured":"Liao, C.-C., Lu, H.-I., Yen, H.-C.: Compact floor-planning via orderly spanning trees. Journal of Algorithms\u00a048, 441\u2013451 (2003)","journal-title":"Journal of Algorithms"},{"key":"37_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0925-7721(97)00018-7","volume":"10","author":"G. Liotta","year":"1998","unstructured":"Liotta, G., Lubiw, A., Meijer, H., Whitesides, S.H.: The rectangle of influence drawability problem. Computational Geometry: Theory and Applications\u00a010, 1\u201322 (1998)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"1","key":"37_CR26","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/S0196-6774(03)00126-3","volume":"50","author":"M. Rahman","year":"2004","unstructured":"Rahman, M., Nishizeki, T., Ghosh, S.: Rectangular drawings of planar graphs. Journal of Algorithms\u00a050(1), 62\u201378 (2004)","journal-title":"Journal of Algorithms"},{"key":"37_CR27","first-page":"31","volume":"56","author":"R.C. Read","year":"1987","unstructured":"Read, R.C.: A new method for drawing a graph given the cyclic order of the edges at each vertex. Congressus Numerantium\u00a056, 31\u201344 (1987)","journal-title":"Congressus Numerantium"},{"key":"37_CR28","first-page":"94","volume-title":"The Architecture of Form","author":"P. Steadman","year":"1976","unstructured":"Steadman, P.: Graph-theoretic representation of architectural arrangement. In: March, L. (ed.) The Architecture of Form, pp. 94\u2013115. Cambridge University Press, Cambridge (1976)"},{"key":"37_CR29","unstructured":"Thomassen, C.: Plane representations of graphs. In: Bondy, J.A., Murty, U.S.R. (eds.) Progress in Graph Theory, pp. 43\u201369 (1982)"},{"key":"37_CR30","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0095-8956(86)90061-4","volume":"40","author":"C. Thomassen","year":"1988","unstructured":"Thomassen, C.: Interval representations of planar graphs. Journal of Comb.\u00a0 Theory (B)\u00a040, 9\u201320 (1988)","journal-title":"Journal of Comb.\u00a0 Theory (B)"},{"issue":"2","key":"37_CR31","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1137\/S0895480191266700","volume":"8","author":"G.K. Yeap","year":"1995","unstructured":"Yeap, G.K., Sarrafzadeh, M.: Sliceable floorplanning by graph dualization. SIAM Journal on Discrete Mathematics\u00a08(2), 258\u2013280 (1995)","journal-title":"SIAM Journal on Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","LATIN 2010: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12200-2_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T21:04:58Z","timestamp":1674853498000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-12200-2_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121999","9783642122002"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12200-2_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}