{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:48Z","timestamp":1759638408430},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319519623"},{"type":"electronic","value":"9783319519630"}],"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-51963-0_23","type":"book-chapter","created":{"date-parts":[[2017,1,10]],"date-time":"2017-01-10T06:17:39Z","timestamp":1484029059000},"page":"295-308","source":"Crossref","is-referenced-by-count":3,"title":["How to Draw a Planarization"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Bl\u00e4sius","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcel","family":"Radermacher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,11]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"\u00c1brego, B.M., Fern\u00e1ndez-Merchant, S., Lea\u00f1os, J., Salazar, G.: The maximum number of halving lines and the rectilinear crossing number of kn for n $$\\le $$ 27. Electron. Notes Discrete Math. 30, 261\u2013266 (2008)","DOI":"10.1016\/j.endm.2008.01.045"},{"key":"23_CR2","unstructured":"Buchheim, C., Chimani, M., Gutwenger, C., J\u00fcnger, M., Mutzel, P.: Crossings and planarization. In: Handbook of Graph Drawing and Visualization, pp. 43\u201385. Chapman and Hall\/CRC (2013)"},{"issue":"2","key":"23_CR3","doi-asserted-by":"crossref","first-page":"243","DOI":"10.7155\/jgaa.00257","volume":"16","author":"EW Chambers","year":"2012","unstructured":"Chambers, E.W., Eppstein, D., Goodrich, M.T., L\u00f6ffler, M.: Drawing graphs in the plane with a prescribed outer face and polynomial area. J. Graph Alg. Appl. 16(2), 243\u2013259 (2012)","journal-title":"J. Graph Alg. Appl."},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-642-18469-7_15","volume-title":"Graph Drawing","author":"W Didimo","year":"2011","unstructured":"Didimo, W., Liotta, G., Romeo, S.A.: Topology-driven force-directed algorithms. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 165\u2013176. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-18469-7_15"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-00219-9_22","volume-title":"Graph Drawing","author":"T Dwyer","year":"2009","unstructured":"Dwyer, T., Marriott, K., Wybrow, M.: Topology preserving constrained graph layout. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 230\u2013241. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-00219-9_22"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BFb0030816","volume-title":"Computing and Combinatorics","author":"Q-W Feng","year":"1995","unstructured":"Feng, Q.-W., Cohen, R.F., Eades, P.: How to draw a planar clustered graph. In: Du, D.-Z., Li, M. (eds.) COCOON 1995. LNCS, vol. 959, pp. 21\u201330. Springer, Heidelberg (1995). doi: 10.1007\/BFb0030816"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-662-45803-7_4","volume-title":"Graph Drawing","author":"L Grilli","year":"2014","unstructured":"Grilli, L., Hong, S.-H., Kratochv\u00edl, J., Rutter, I.: Drawing simultaneously embedded graphs with few bends. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 40\u201351. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-45803-7_4"},{"issue":"4","key":"23_CR8","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/s00453-004-1128-8","volume":"41","author":"C Gutwenger","year":"2005","unstructured":"Gutwenger, C., Mutzel, P., Weiskircher, R.: Inserting an edge into a planar graph. Algorithmica 41(4), 289\u2013308 (2005)","journal-title":"Algorithmica"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-642-32241-9_29","volume-title":"Computing and Combinatorics","author":"S-H Hong","year":"2012","unstructured":"Hong, S.-H., Eades, P., Liotta, G., Poon, S.-H.: F\u00e1ry\u2019s theorem for 1-planar graphs. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol. 7434, pp. 335\u2013346. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-32241-9_29"},{"key":"23_CR10","first-page":"1","volume":"16","author":"S Huber","year":"2011","unstructured":"Huber, S., Held, M.: Motorcycle graphs: stochastic properties motivate an efficient yet simple implementation. J. Exper. Algo. 16, 1\u20133 (2011)","journal-title":"J. Exper. Algo."},{"issue":"05","key":"23_CR11","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1142\/S0218195912500124","volume":"22","author":"S Huber","year":"2012","unstructured":"Huber, S., Held, M.: A fast straight-skeleton algorithm based on generalized motorcycle graphs. Int. J. Comput. Geom. Appl. 22(05), 471\u2013498 (2012)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"4","key":"23_CR12","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1007\/BF01937271","volume":"27","author":"B Joe","year":"1987","unstructured":"Joe, B., Simpson, R.B.: Corrections to Lee\u2019s visibility polygon algorithm. BIT Num. Math. 27(4), 458\u2013473 (1987)","journal-title":"BIT Num. Math."},{"issue":"1","key":"23_CR13","doi-asserted-by":"crossref","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 16(1), 4\u201332 (1996)","journal-title":"Algorithmica"},{"key":"23_CR14","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/BFb0082792","volume-title":"Topology and Geometry \u2014 Rohlin Seminar","author":"NE Mnev","year":"1988","unstructured":"Mnev, N.E.: The universality theorems on the classification problem of configuration varieties and convex polytopes varieties. In: Viro, O.Y., Vershik, A.M. (eds.) Topology and Geometry \u2014 Rohlin Seminar. LNM, vol. 1346, pp. 527\u2013543. Springer, Heidelberg (1988). doi: 10.1007\/BFb0082792"},{"issue":"10","key":"23_CR15","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1145\/358656.358681","volume":"25","author":"J Nievergelt","year":"1982","unstructured":"Nievergelt, J., Preparata, F.P.: Plane-sweep algorithms for intersecting geometric figures. Commun. ACM 25(10), 739\u2013747 (1982)","journal-title":"Commun. ACM"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-642-11805-0_32","volume-title":"Graph Drawing","author":"M Schaefer","year":"2010","unstructured":"Schaefer, M.: Complexity of some geometric and topological problems. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 334\u2013344. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-11805-0_32"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Sheskin, D.J.: Handbook of Parametric and Nonparametric Statistical Procedures. Chapman and Hall\/CRC (2003)","DOI":"10.1201\/9781420036268"},{"issue":"3","key":"23_CR18","doi-asserted-by":"crossref","first-page":"1071","DOI":"10.1111\/j.1467-8659.2011.01956.x","volume":"30","author":"P Simonetto","year":"2011","unstructured":"Simonetto, P., Archambault, D., Auber, D., Bourqui, R.: ImPrEd: an improved force-directed algorithm that prevents nodes from crossing edges. Comput. Graph. Forum (EuroVis 2011) 30(3), 1071\u20131080 (2011)","journal-title":"Comput. Graph. Forum (EuroVis 2011)"},{"issue":"3","key":"23_CR19","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R Tamassia","year":"1987","unstructured":"Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput. 16(3), 421\u2013444 (1987)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"23_CR20","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"s3\u201313","author":"WT Tutte","year":"1963","unstructured":"Tutte, W.T.: How to draw a graph. Proc. Lond. Math. Soc. s3\u201313(1), 743\u2013767 (1963)","journal-title":"Proc. Lond. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2017: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-51963-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T07:46:24Z","timestamp":1498376784000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-51963-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319519623","9783319519630"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51963-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}