{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:36:41Z","timestamp":1725467801562},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642367625"},{"type":"electronic","value":"9783642367632"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36763-2_14","type":"book-chapter","created":{"date-parts":[[2013,2,14]],"date-time":"2013-02-14T03:17:33Z","timestamp":1360811853000},"page":"150-161","source":"Crossref","is-referenced-by-count":6,"title":["Smooth Orthogonal Layouts"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/BFb0049394","volume-title":"Algorithms - ESA \u201994","author":"T. Biedl","year":"1994","unstructured":"Biedl, T., Kant, G.: A Better Heuristic for Orthogonal Graph Drawings. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol.\u00a0855, pp. 24\u201335. Springer, Heidelberg (1994)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-63397-9_4","volume-title":"Algorithms - ESA \u201997","author":"T.C. Biedl","year":"1997","unstructured":"Biedl, T.C., Kaufmann, M.: Area-Efficient Static and Incremental Graph Drawings. In: Burkard, R.E., Woeginger, G.J. (eds.) ESA 1997. LNCS, vol.\u00a01284, pp. 37\u201352. Springer, Heidelberg (1997)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-540-70904-6_7","volume-title":"Graph Drawing","author":"U. Brandes","year":"2007","unstructured":"Brandes, U., Schlieper, B.: Angle and Distance Constraints on Tree Drawings. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 54\u201365. Springer, Heidelberg (2007)"},{"issue":"3","key":"14_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.7155\/jgaa.00028","volume":"4","author":"U. Brandes","year":"2000","unstructured":"Brandes, U., Wagner, D.: Using graph layout to visualize train interconnection data. J. of Graph Algorithms and Applications\u00a04(3), 135\u2013155 (2000)","journal-title":"J. of Graph Algorithms and Applications"},{"issue":"4","key":"14_CR5","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/PL00009478","volume":"22","author":"T.M. Chan","year":"1999","unstructured":"Chan, T.M.: Geometric applications of a randomized optimization technique. Discrete Computational Geometry\u00a022(4), 547\u2013567 (1999)","journal-title":"Discrete Computational Geometry"},{"issue":"3","key":"14_CR6","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s004540010080","volume":"25","author":"C.C. Cheng","year":"2001","unstructured":"Cheng, C.C., Duncan, C.A., Goodrich, M.T., Kobourov, S.G.: Drawing planar graphs with circular arcs. Discrete Comput. Geom.\u00a025(3), 405\u2013418 (2001)","journal-title":"Discrete Comput. Geom."},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/978-3-642-25878-7_30","volume-title":"GD 2011","author":"C.A. Duncan","year":"2012","unstructured":"Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., L\u00f6ffler, M.: Planar and Poly-arc Lombardi Drawings. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol.\u00a07034, pp. 308\u2013319. Springer, Heidelberg (2012)"},{"issue":"1","key":"14_CR8","doi-asserted-by":"publisher","first-page":"85","DOI":"10.7155\/jgaa.00251","volume":"16","author":"C.A. Duncan","year":"2011","unstructured":"Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., N\u00f6llenburg, M.: Lombardi Drawings of Graphs. J. of Graph Algorithms and Applications\u00a016(1), 85\u2013108 (2011)","journal-title":"J. of Graph Algorithms and Applications"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-540-31843-9_46","volume-title":"Graph Drawing","author":"B. Finkel","year":"2005","unstructured":"Finkel, B., Tamassia, R.: Curvilinear Graph Drawing Using the Force-Directed Method. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 448\u2013453. Springer, Heidelberg (2005)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/BFb0021809","volume-title":"Graph Drawing","author":"U. F\u00f6\u00dfmeier","year":"1996","unstructured":"F\u00f6\u00dfmeier, U., Kaufmann, M.: Drawing High Degree Graphs with Low Bend Numbers. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 254\u2013266. Springer, Heidelberg (1996)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/3-540-58950-3_384","volume-title":"Graph Drawing","author":"A. Garg","year":"1995","unstructured":"Garg, A., Tamassia, R.: On the Computational Complexity of Upward and Rectilinear Planarity Testing. In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol.\u00a0894, pp. 286\u2013297. Springer, Heidelberg (1995)"},{"issue":"2","key":"14_CR12","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1006\/jagm.2000.1115","volume":"37","author":"M.T. Goodrich","year":"2000","unstructured":"Goodrich, M.T., Wagner, C.G.: A framework for drawing planar graphs with curves and polylines. J. of Algorithms\u00a037(2), 399\u2013421 (2000)","journal-title":"J. of Algorithms"},{"issue":"3","key":"14_CR13","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1111\/j.1467-8659.2009.01450.x","volume":"28","author":"D. Holten","year":"2009","unstructured":"Holten, D., van Wijk, J.J.: Force-directed edge bundling for graph visualization. Computer Graphics Forum\u00a028(3), 983\u2013990 (2009)","journal-title":"Computer Graphics Forum"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Huang, W., Eades, P., Hong, S.H.: A graph reading behavior: Geodesic-path tendency. In: IEEE Pacific Visualization Symp. (PacificVis 2009), pp. 137\u2013144. IEEE (2009)","DOI":"10.1109\/PACIFICVIS.2009.4906848"},{"issue":"1","key":"14_CR15","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)","journal-title":"Algorithmica"},{"issue":"1","key":"14_CR16","doi-asserted-by":"publisher","first-page":"115","DOI":"10.7155\/jgaa.00046","volume":"6","author":"M. Kaufmann","year":"2002","unstructured":"Kaufmann, M., Wiese, R.: Embedding vertices at points: Few bends suffice for planar graphs. J. of Graph Algorithms Applications\u00a06(1), 115\u2013129 (2002)","journal-title":"J. of Graph Algorithms Applications"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Leiserson, C.E.: Area-efficient graph layouts (for VLSI). In: 21st Annual IEEE Symp. on Foundations of Computer Science, vol.\u00a01547, pp. 270\u2013281. IEEE (1980)","DOI":"10.1109\/SFCS.1980.13"},{"key":"14_CR18","unstructured":"Lombardi, M., Hobbs, R.: Mark Lombardi: Global Networks. Independent Curators (2003)"},{"issue":"3","key":"14_CR19","doi-asserted-by":"publisher","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. of Computing\u00a016(3), 421\u2013444 (1987)","journal-title":"SIAM J. of Computing"},{"issue":"9","key":"14_CR20","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/31.34669","volume":"36","author":"R. Tamassia","year":"1989","unstructured":"Tamassia, R., Tollis, I.: Planar grid embedding in linear time. IEEE Transactions on Circuits and Systems\u00a036(9), 1230\u20131234 (1989)","journal-title":"IEEE Transactions on Circuits and Systems"},{"issue":"2","key":"14_CR21","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"30","author":"L.G. Valiant","year":"1981","unstructured":"Valiant, L.G.: Universality considerations in VLSI circuits. IEEE Transaction on Computers\u00a030(2), 135\u2013140 (1981)","journal-title":"IEEE Transaction on Computers"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36763-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T06:52:08Z","timestamp":1557557528000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36763-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642367625","9783642367632"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36763-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}