{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T18:46:23Z","timestamp":1747853183571,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811565328"},{"type":"electronic","value":"9789811565335"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-981-15-6533-5_10","type":"book-chapter","created":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T13:06:26Z","timestamp":1601471186000},"page":"171-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Angular Resolutions: Around Vertices and Crossings"],"prefix":"10.1007","author":[{"given":"Yoshio","family":"Okamoto","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,1]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Aichholzer, O., Korman, M., Okamoto, Y., Parada, I., Perz, D., van Renssen, A., Vogtenhuber, B.: Graphs with large total angular resolution. In: Archambault, D., T\u00f3th, C.D. (eds.) Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, 17\u201320 September 2019, Proceedings. Lecture Notes in Computer Science, vol. 11904, pp. 193\u2013199. Springer (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-35802-0_15","DOI":"10.1007\/978-3-030-35802-0_15"},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Angelini, P., Cittadini, L., Didimo, W., Frati, F., Di Battista, G., Kaufmann, M., Symvonis, A.: On the perspectives opened by right angle crossing drawings. J. Graph Algorithms Appl. 15(1), 53\u201378 (2011). \nhttps:\/\/doi.org\/10.7155\/jgaa.00217","DOI":"10.7155\/jgaa.00217"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Argyriou, E.N., Bekos, M.A., Symvonis, A.: The straight-line RAC drawing problem is NP-hard. J. Graph Algorithms Appl. 16(2), 569\u2013597 (2012). \nhttps:\/\/doi.org\/10.7155\/jgaa.00274","DOI":"10.7155\/jgaa.00274"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"Argyriou, E.N., Bekos, M.A., Symvonis, A.: Maximizing the total resolution of graphs. Comput. J. 56(7), 887\u2013900 (2013). \nhttps:\/\/doi.org\/10.1093\/comjnl\/bxs088","DOI":"10.1093\/comjnl\/bxs088"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Bar\u00e1t, J., Matou\u0161ek, J., Wood, D.R.: Bounded-degree graphs have arbitrarily large geometric thickness. Electron. J. Comb. 13(1) (2006)","DOI":"10.37236\/1029"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Bekos, M.A., F\u00f6rster, H., Geckeler, C., Holl\u00e4nder, L., Kaufmann, M., Spallek, A.M., Splett, J.: A heuristic approach towards drawings of graphs with high crossing resolution. In: Biedl, T.C., Kerren, A. (eds.) Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Barcelona, Spain, 26\u201328 September 2018, Proceedings. Lecture Notes in Computer Science, vol. 11282, pp. 271\u2013285. Springer (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-030-04414-5_19","DOI":"10.1007\/978-3-030-04414-5_19"},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H.: Area, curve complexity, and crossing resolution of non-planar graph drawings. Theory Comput. Syst. 49(3), 565\u2013575 (2011). \nhttps:\/\/doi.org\/10.1007\/s00224-010-9275-6","DOI":"10.1007\/s00224-010-9275-6"},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Di Giacomo, E., Didimo, W., Eades, P., Hong, S., Liotta, G.: Bounds on the crossing resolution of complete geometric graphs. Discret. Appl. Math. 160(1\u20132), 132\u2013139 (2012). \nhttps:\/\/doi.org\/10.1016\/j.dam.2011.09.016","DOI":"10.1016\/j.dam.2011.09.016"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Didimo, W., Eades, P., Liotta, G.: Drawing graphs with right angle crossings. Theor. Comput. Sci. 412(39), 5156\u20135166 (2011). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2011.05.025","DOI":"10.1016\/j.tcs.2011.05.025"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Didimo, W., Kaufmann, M., Liotta, G., Okamoto, Y., Spillner, A.: Vertex angle and crossing angle resolution of leveled tree drawings. Inf. Process. Lett. 112(16), 630\u2013635 (2012). \nhttps:\/\/doi.org\/10.1016\/j.ipl.2012.05.006","DOI":"10.1016\/j.ipl.2012.05.006"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Dillencourt, M.B., Eppstein, D., Hirschberg, D.S.: Geometric thickness of complete graphs. J. Graph Algorithms Appl. 4(3), 5\u201317 (2000). \nhttps:\/\/doi.org\/10.7155\/jgaa.00023","DOI":"10.7155\/jgaa.00023"},{"key":"10_CR12","unstructured":"Dujmovic, V., Gudmundsson, J., Morin, P., Wolle, T.: Notes on large angle crossing graphs. Chic. J. Theor. Comput. Sci. 2011 (2011)"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Formann, M., Hagerup, T., Haralambides, J., Kaufmann, M., Leighton, F.T., Symvonis, A., Welzl, E., Woeginger, G.J.: Drawing graphs in the plane with high resolution. SIAM J. Comput. 22(5), 1035\u20131052 (1993). \nhttps:\/\/doi.org\/10.1137\/0222063","DOI":"10.1137\/0222063"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"Garg, A., Tamassia, R.: Planar drawings and angular resolution: algorithms and bounds (extended abstract). In: van Leeuwen, J. (ed.) Algorithms - ESA \u201994, Second Annual European Symposium, Utrecht, The Netherlands, 26\u201328 September 1994, Proceedings. Lecture Notes in Computer Science, vol. 855, pp. 12\u201323. Springer (1994). \nhttps:\/\/doi.org\/10.1007\/BFb0049393","DOI":"10.1007\/BFb0049393"},{"key":"10_CR15","unstructured":"Havet, F., van\u00a0den Heuvel, J., McDiarmid, C., Reed, B.: List colouring squares of planar graphs (2008). \narXiv:0807.3233"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"van den Heuvel, J., McGuinness, S.: Coloring the square of a planar graph. J. Graph Theory 42(2), 110\u2013124 (2003). \nhttps:\/\/doi.org\/10.1002\/jgt.10077","DOI":"10.1002\/jgt.10077"},{"key":"10_CR17","unstructured":"Hoffmann, M., van Kreveld, M.J., Kusters, V., Rote, G.: Quality ratios of measures for graph drawing styles. In: Proceedings of the 26th Canadian Conference on Computational Geometry, CCCG 2014, Halifax, Nova Scotia, Canada, 2014. Carleton University, Ottawa, Canada (2014). \nhttp:\/\/www.cccg.ca\/proceedings\/2014\/papers\/paper05.pdf"},{"key":"10_CR18","doi-asserted-by":"publisher","unstructured":"Keszegh, B., Pach, J., P\u00e1lv\u00f6lgyi, D.: Drawing planar graphs of bounded degree with few slopes. SIAM J. Discret. Math. 27(2), 1171\u20131183 (2013). \nhttps:\/\/doi.org\/10.1137\/100815001","DOI":"10.1137\/100815001"},{"key":"10_CR19","unstructured":"Koebe, P.: Kontaktprobleme der konformen Abbildung. Ber. S\u00e4chs. Akad. Wiss. Leipzig Math.-Phys. Kl. 88, 141\u2013164 (1936)"},{"key":"10_CR20","doi-asserted-by":"publisher","unstructured":"van Kreveld, M.J.: The quality ratio of RAC drawings and planar drawings of planar graphs. In: Brandes, U., Cornelsen, S. (eds.) Graph Drawing - 18th International Symposium, GD 2010, Konstanz, Germany, 21\u201324 September 2010. Revised Selected Papers. Lecture Notes in Computer Science, vol. 6502, pp. 371\u2013376. Springer (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-18469-7_34","DOI":"10.1007\/978-3-642-18469-7_34"},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"Malitz, S.M., Papakostas, A.: On the angular resolution of planar graphs. SIAM J. Discret. Math. 7(2), 172\u2013183 (1994). \nhttps:\/\/doi.org\/10.1137\/S0895480193242931","DOI":"10.1137\/S0895480193242931"},{"key":"10_CR22","doi-asserted-by":"publisher","unstructured":"Mukkamala, P., P\u00e1lv\u00f6lgyi, D.: Drawing cubic graphs with the four basic slopes. In: van Kreveld, M.J., Speckmann, B. (eds.) Graph Drawing - 19th International Symposium, GD 2011, Eindhoven, The Netherlands, 21\u201323 September 2011, Revised Selected Papers. Lecture Notes in Computer Science, vol. 7034, pp. 254\u2013265. Springer (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-25878-7_25","DOI":"10.1007\/978-3-642-25878-7_25"}],"container-title":["Beyond Planar Graphs"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-6533-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T13:42:37Z","timestamp":1601473357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-6533-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811565328","9789811565335"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-6533-5_10","relation":{},"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"1 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}