{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T20:44:51Z","timestamp":1725914691283},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319687049"},{"type":"electronic","value":"9783319687056"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-68705-6_24","type":"book-chapter","created":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T02:06:22Z","timestamp":1509501982000},"page":"316-329","source":"Crossref","is-referenced-by-count":3,"title":["Drawing Planar Graphs with Few Geometric Primitives"],"prefix":"10.1007","author":[{"given":"Gregor","family":"H\u00fcltenschmidt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"Kindermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wouter","family":"Meulemans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,2]]},"reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1007\/3-540-45465-9_89","volume-title":"Automata, Languages and Programming","author":"N Bonichon","year":"2002","unstructured":"Bonichon, N., Le Sa\u00ebc, B., Mosbah, M.: Wagner\u2019s theorem on realizers. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 1043\u20131053. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-45465-9_89"},{"key":"24_CR2","unstructured":"Brehm, E.: 3-orientations and Schnyder 3-tree-decompositions. In: Master\u2019s Thesis, Freie Universit\u00e4t Berlin (2000). \nhttp:\/\/page.math.tu-berlin.de\/~felsner\/Diplomarbeiten\/brehm.ps.gz"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-319-50106-2_14","volume-title":"Graph Drawing and Network Visualization","author":"S Chaplick","year":"2016","unstructured":"Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: Drawing graphs on few lines and few planes. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 166\u2013180. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-50106-2_14"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-319-62127-2_23","volume-title":"Algorithms and Data Structures","author":"S Chaplick","year":"2017","unstructured":"Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: The complexity of drawing graphs on few lines and few planes. In: Ellen, F., Kolokolova, A., Sack, J.R. (eds.) Algorithms and Data Structures. LNCS, vol. 10389, pp. 265\u2013276. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-62127-2_23"},{"issue":"1\u20133","key":"24_CR5","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0012-365X(00)00201-6","volume":"229","author":"H Fraysseix de","year":"2001","unstructured":"de Fraysseix, H., de Mendez, P.O.: On topological aspects of orientations. Discrete Math. 229(1\u20133), 57\u201372 (2001). \nhttps:\/\/doi.org\/10.1016\/S0012-365X(00)00201-6","journal-title":"Discrete Math."},{"key":"24_CR6","doi-asserted-by":"publisher","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: Small sets supporting Fary embeddings of planar graphs. In: Simon, J. (ed.) Proceedings of 20th Annual ACM Symposium on Theory of Computing (STOC 1988), pp. 426\u2013433. ACM, 1988. \nhttps:\/\/doi.org\/10.1145\/62212.62254","DOI":"10.1145\/62212.62254"},{"issue":"1","key":"24_CR7","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). \nhttps:\/\/doi.org\/10.1007\/BF02122694","journal-title":"Combinatorica"},{"issue":"3","key":"24_CR8","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.comgeo.2006.09.002","volume":"38","author":"V Dujmovi\u0107","year":"2007","unstructured":"Dujmovi\u0107, V., Eppstein, D., Suderman, M., Wood, D.R.: Drawings of planar graphs with few slopes and segments. Comput. Geom. Theory Appl. 38(3), 194\u2013212 (2007). \nhttps:\/\/doi.org\/10.1016\/j.comgeo.2006.09.002","journal-title":"Comput. Geom. Theory Appl."},{"key":"24_CR9","unstructured":"Durocher, S., Mondal, D.: Drawing plane triangulations with few segments. In: He, M., Zeh, N. (eds.) Proceedings of 26th Canadian Conference on Computational Geometry (CCCG 2014), Carleton University, pp. 40\u201345 (2014). \nhttp:\/\/www.cccg.ca\/proceedings\/2014\/papers\/paper06.pdf"},{"issue":"3","key":"24_CR10","doi-asserted-by":"publisher","first-page":"301","DOI":"10.7155\/jgaa.00295","volume":"17","author":"S Durocher","year":"2013","unstructured":"Durocher, S., Mondal, D., Nishat, R.I., Whitesides, S.: A note on minimum-segment drawings of planar graphs. J. Graph Algorithms Appl. 17(3), 301\u2013328 (2013). \nhttps:\/\/doi.org\/10.7155\/jgaa.00295","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"24_CR11","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1002\/jgt.20081","volume":"49","author":"S Felsner","year":"2005","unstructured":"Felsner, S., Trotter, W.T.: Posets and planar graphs. J. Graph Theory 49(4), 273\u2013284 (2005). \nhttps:\/\/doi.org\/10.1002\/jgt.20081","journal-title":"J. Graph Theory"},{"key":"24_CR12","unstructured":"H\u00fcltenschmidt, G., Kindermann, P., Meulemans, W., Schulz, A.: Drawing planar graphs with few geometric primitives (2017). Arxiv report 1703.01691. \narXiv:1703.01691"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-319-27261-0_10","volume-title":"Graph Drawing and Network Visualization","author":"A Igamberdiev","year":"2015","unstructured":"Igamberdiev, A., Meulemans, W., Schulz, A.: Drawing planar cubic 3-connected graphs with few segments: algorithms and experiments. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 113\u2013124. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-27261-0_10"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.4153\/CJM-1970-125-1","volume":"22","author":"DR Lick","year":"1970","unstructured":"Lick, D.R., White, A.T.: \n            $$k$$\n          -degenerate graphs. Can. J. Math. 22, 1082\u20131096 (1970). \nhttps:\/\/doi.org\/10.4153\/CJM-1970-125-1","journal-title":"Can. J. Math."},{"key":"24_CR15","unstructured":"Mondal, D.: Visualizing graphs: optimization and trade-offs. Ph.D. thesis, University of Manitoba (2016). \nhttp:\/\/hdl.handle.net\/1993\/31673"},{"issue":"3","key":"24_CR16","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/s10878-011-9390-6","volume":"25","author":"D Mondal","year":"2013","unstructured":"Mondal, D., Nishat, R.I., Biswas, S., Rahman, M.S.: Minimum-segment convex drawings of 3-connected cubic plane graphs. J. Comb. Optim. 25(3), 460\u2013480 (2013). \nhttps:\/\/doi.org\/10.1007\/s10878-011-9390-6","journal-title":"J. Comb. Optim."},{"key":"24_CR17","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Johnson, D.S. (ed.) Proceedings of 1st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1990), pp 138\u2013148. SIAM (1990). \nhttp:\/\/dl.acm.org\/citation.cfm?id=320191"},{"issue":"1","key":"24_CR18","doi-asserted-by":"publisher","first-page":"393","DOI":"10.7155\/jgaa.00366","volume":"19","author":"A Schulz","year":"2015","unstructured":"Schulz, A.: Drawing graphs with few arcs. J. Graph Algorithms Appl. 19(1), 393\u2013412 (2015). \nhttps:\/\/doi.org\/10.7155\/jgaa.00366","journal-title":"J. Graph Algorithms Appl."},{"key":"24_CR19","doi-asserted-by":"publisher","unstructured":"Tarjan, R.E.: Linking and cutting trees. In: Data Structures and Network Algorithms, pp. 59\u201370. SIAM (1983). \nhttps:\/\/doi.org\/10.1137\/1.9781611970265.ch5","DOI":"10.1137\/1.9781611970265.ch5"},{"issue":"2","key":"24_CR20","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1093\/comjnl\/37.2.139","volume":"37","author":"GA Wade","year":"1994","unstructured":"Wade, G.A., Chu, J.: Drawability of complete graphs using a minimal slope set. Comput. J. 37(2), 139\u2013142 (1994). \nhttps:\/\/doi.org\/10.1093\/comjnl\/37.2.139","journal-title":"Comput. J."},{"issue":"2","key":"24_CR21","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00454-004-1154-y","volume":"33","author":"H Zhang","year":"2005","unstructured":"Zhang, H., He, X.: Canonical ordering trees and their applications in graph drawing. Discrete Comput. Geom. 33(2), 321\u2013344 (2005). \nhttps:\/\/doi.org\/10.1007\/s00454-004-1154-y","journal-title":"Discrete Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68705-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T02:12:55Z","timestamp":1509502375000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68705-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319687049","9783319687056"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68705-6_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}