{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T02:13:10Z","timestamp":1774059190501,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642184680","type":"print"},{"value":"9783642184697","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18469-7_12","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T05:30:40Z","timestamp":1297315840000},"page":"129-140","source":"Crossref","is-referenced-by-count":2,"title":["Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area"],"prefix":"10.1007","author":[{"given":"Erin W.","family":"Chambers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Eppstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maarten","family":"L\u00f6ffler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","first-page":"369","DOI":"10.4171\/dm\/214","volume":"11","author":"I. B\u00e1r\u00e1ny","year":"2006","unstructured":"B\u00e1r\u00e1ny, I., Rote, G.: Strictly convex drawings of planar graphs. Documenta Mathematica\u00a011, 369\u2013391, (2006) arXiv:cs\/0507030 , http:\/\/www.math.uiuc.edu\/documenta\/vol-11\/13.html","journal-title":"Documenta Mathematica"},{"issue":"5","key":"12_CR2","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1137\/0216061","volume":"16","author":"B. Becker","year":"1987","unstructured":"Becker, B., Hotz, G.: On the optimal layout of planar graphs with fixed boundary. SIAM J. Comput.\u00a016(5), 946\u2013972 (1987), doi:10.1137\/0216061","journal-title":"SIAM J. Comput."},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Chrobak, M., Goodrich, M.T., Tamassia, R.: Convex drawings of graphs in two and three dimensions. In: Proc. 12th ACM Symp. Comput. Geom., pp. 319\u2013328 (1996), doi:10.1145\/237218.237401","DOI":"10.1145\/237218.237401"},{"issue":"3","key":"12_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1142\/S0218195997000144","volume":"7","author":"M. Chrobak","year":"1997","unstructured":"Chrobak, M., Kant, G.: Convex grid drawings of 3-connected planar graphs. Internat. J. Comput. Geom. Appl.\u00a07(3), 211\u2013223 (1997), doi:10.1142\/S0218195997000144","journal-title":"Internat. J. Comput. Geom. Appl."},{"issue":"4","key":"12_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.H.: A linear-time algorithm for drawing a planar graph on a grid. Inf. Proc. Lett.\u00a054(4), 241\u2013246 (1995), doi:10.1016\/0020-0190(95)00020-D","journal-title":"Inf. Proc. Lett."},{"issue":"4","key":"12_CR6","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1145\/234535.234538","volume":"15","author":"R. Davidson","year":"1996","unstructured":"Davidson, R., Harel, D.: Drawing graphs nicely using simulated annealing. ACM Trans. Graph.\u00a015(4), 301\u2013331 (1996), doi:10.1145\/234535.234538","journal-title":"ACM Trans. Graph."},{"issue":"2","key":"12_CR7","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s00454-009-9235-6","volume":"43","author":"R. Dhandapani","year":"2010","unstructured":"Dhandapani, R.: Greedy drawings of triangulations. Discrete Comput. Geom.\u00a043(2), 375\u2013392 (2010), doi:10.1007\/s00454-009-9235-6","journal-title":"Discrete Comput. Geom."},{"key":"12_CR8","volume-title":"Graph Drawing","author":"G. Battista di","year":"1999","unstructured":"di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River (1999)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Graph Drawing","author":"C.A. Duncan","year":"2010","unstructured":"Duncan, C.A., Goodrich, M.T., Kobourov, S.G.: Planar drawings of higher-genus graphs. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, Springer, Heidelberg (2010), doi:10.1007\/978-3-642-11805-0_7"},{"key":"12_CR10","first-page":"229","volume":"11","author":"I. F\u00e1ry","year":"1948","unstructured":"F\u00e1ry, I.: On straight-line representation of planar graphs. Acta Sci. Math. (Szeged)\u00a011, 229\u2013233 (1948)","journal-title":"Acta Sci. Math. (Szeged)"},{"issue":"1","key":"12_CR11","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\u00a010(1), 41\u201351 (1990), doi:10.1007\/BF02122694","journal-title":"Combinatorica"},{"issue":"11","key":"12_CR12","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T.M.J. Fruchterman","year":"1991","unstructured":"Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pract. Exp.\u00a021(11), 1129\u20131164 (1991), doi:10.1002\/spe.4380211102","journal-title":"Softw. Pract. Exp."},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.comgeo.2004.03.014","volume":"29","author":"P. Gajer","year":"2004","unstructured":"Gajer, P., Goodrich, M.T., Kobourov, S.G.: A multi-dimensional approach to force-directed layouts of large graphs. Comput. Geom. Theory Appl.\u00a029(1), 3\u201318 (2004), doi:10.1016\/j.comgeo.2004.03.014","journal-title":"Comput. Geom. Theory Appl."},{"issue":"1","key":"12_CR14","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(1), 4\u201332 (1996), doi:10.1007\/BF02086606","journal-title":"Algorithmica"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Lazarus, F., Pocchiola, M., Vegter, G., Verroust, A.: Computing a canonical polygonal schema of an Orientable Triangulated Surface. In: Proc. 17th ACM Symp. Comput. Geom., pp. 80\u201389 (2001), doi:10.1145\/378583.378630","DOI":"10.1145\/378583.378630"},{"key":"12_CR16","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Proc. 1st ACM-SIAM Symp. Discrete Algorithms, pp. 138\u2013148 (1990), http:\/\/portal.acm.org\/citation.cfm?id=320191"},{"issue":"3","key":"12_CR17","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1090\/S0002-9939-1951-0041425-5","volume":"2","author":"S.K. Stein","year":"1951","unstructured":"Stein, S.K.: Convex maps. Proc. Amer. Math. Soc.\u00a02(3), 464\u2013466 (1951), doi:10.1090\/S0002-9939-1951-0041425-5","journal-title":"Proc. Amer. Math. Soc."},{"issue":"3","key":"12_CR18","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1006\/jvlc.1995.1013","volume":"6","author":"K. Sugiyama","year":"1995","unstructured":"Sugiyama, K., Misue, K.: Graph drawing by the magnetic spring model. J. Visual Lang. Comput.\u00a06(3), 217\u2013231 (1995), doi:10.1006\/jvlc.1995.1013","journal-title":"J. Visual Lang. Comput."},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Tutte, W.T.: Convex representations of graphs. Proc. London Math. Soc.\u00a010(38), 304\u2013320 (1960), doi:10.1112\/plms\/s3-10.1.304","DOI":"10.1112\/plms\/s3-10.1.304"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Tutte, W.T.: How to draw a graph. Proc. London Math. Soc.\u00a013(52), 743\u2013768 (1963), doi:10.1112\/plms\/s3-13.1.743","DOI":"10.1112\/plms\/s3-13.1.743"},{"key":"12_CR21","first-page":"26","volume":"46","author":"K. Wagner","year":"1936","unstructured":"Wagner, K.: Bemerkungen zum Vierfarbenproblem. Jber. Deutsch. Math.-Verein.\u00a046, 26\u201332 (1936)","journal-title":"Jber. Deutsch. Math.-Verein."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18469-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,5]],"date-time":"2023-06-05T05:00:02Z","timestamp":1685941202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18469-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184680","9783642184697"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18469-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}