{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:23:27Z","timestamp":1725488607682},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424871"},{"type":"electronic","value":"9783540446699"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44669-9_14","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T06:32:26Z","timestamp":1186727546000},"page":"126-137","source":"Crossref","is-referenced-by-count":5,"title":["Curved Edge Routing"],"prefix":"10.1007","author":[{"given":"K\u0101rlis","family":"Freivalds","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G. Battista Di","year":"1994","unstructured":"G. Di Battista, P. Eades, R. Tamassia, I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography, Computational Geometry: Theory and Applications, vol. 4, no. 5, 1994, pp. 235\u2013282.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"14_CR2","unstructured":"G. Di Battista, P. Eades, R. Tamassia, I. G. Tollis. Graph Drawing. Prentice Hall, 1999."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"A. Bicchi, G. Casalino, C. Santilli. Planning Shortest Bounded-Curvature Paths for a Class of Nonholonomic Vehicles among Obstacles. Proc. IEEE Int. Conf. on Robotics and Automation, pp.1349\u20131354, 1995.","DOI":"10.1109\/ROBOT.1995.525466"},{"key":"14_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/3-540-46648-7_12","volume-title":"Symp. on Graph Drawing GD\u201999","author":"C. C. Cheng","year":"1999","unstructured":"C. C. Cheng, C. A. Duncan, M. T. Goodrich, S. G. Koburov. Drawing Planar Graphs with Circular Arcs. Symp. on Graph Drawing GD\u201999, Lecture Notes in Computer Science, vol.1731, pp.117\u2013126, 1999."},{"key":"14_CR5","first-page":"xvii","volume-title":"Introduction to Algorithms","author":"T. H. Cormen","year":"1990","unstructured":"T. H. Cormen, C. E. Leiserson, R. L. Rivest, Introduction to Algorithms. MIT Press. Cambridge, Massachusetts. xvii, 1990."},{"key":"14_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-63938-1_68","volume-title":"Symp. on Graph Drawing GD\u201997","author":"D.P. Dobkin","year":"1998","unstructured":"D.P. Dobkin, E.R. Gansner, E. Koutsofios, Stephen C. North. Implementing a General-Purpose Edge Router. Symp. on Graph Drawing GD\u201997, Lecture Notes in Computer Science, vol.1353, pp.262\u2013271, 1998."},{"key":"14_CR7","unstructured":"J. D. Foley, A. vanDam, S. K. Feiner, J. F. Huges, Computer Graphics: principles and practice, Addison-Wesley, 1993."},{"issue":"3","key":"14_CR8","first-page":"214","volume":"19","author":"E. R. Gansner","year":"1993","unstructured":"E. R. Gansner, E. Koutsofios, Stephen C. North, Kiem-Phong Vo. A Technique for Drawing Directed Graphs. TSE 19(3), pp.214\u2013230 (1993)","journal-title":"TSE"},{"key":"14_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-37623-2_12","volume-title":"Symp. on Graph Drawing GD\u201998","author":"M. T. Goodrich","year":"1998","unstructured":"M. T. Goodrich, C. G. Wagner. A Framework for Drawing Planar Graphs with Curves and Polylines. Symp. on Graph Drawing GD\u201998, Lecture Notes in Computer Science, vol.1547, pp.153\u2013166, 1998."},{"key":"14_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4022-9","volume-title":"Robot Motion Planning","author":"J.C. Latombe","year":"1991","unstructured":"J.C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, 1991."},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. John Wiley & Sons, 1990.","DOI":"10.1007\/978-3-322-92106-2_3"},{"key":"14_CR12","first-page":"17","volume":"LXVIII","author":"H. Lerchs","year":"1965","unstructured":"H. Lerchs, I. G. Grossmann. Optimum Design of Open-Pit Mines. Transactions, C.I.M., Volume LXVIII, 1965, pp.17\u201324.","journal-title":"Transactions, C.I.M."},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"K. Miriyala, S. W. Hornick, R. Tamassia. An Incremental Approach to Aesthetic Graph Layout, Proc. International Workshop on Computer-Aided Software Engineering, 1993.","DOI":"10.1109\/CASE.1993.634832"},{"key":"14_CR14","unstructured":"G. Sander. Graph Layout through the VCG Tool. Technical Report A03-94, Universit\u00e4t des Saarlandes, FB 14 Informatik, 1994."},{"key":"14_CR15","unstructured":"J.A. Sethian. Level Set Methods. Cambridge University Press, 1996."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44669-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T18:13:11Z","timestamp":1556734391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44669-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424871","9783540446699"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44669-9_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}