{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:54:50Z","timestamp":1725890090219},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540639381"},{"type":"electronic","value":"9783540696742"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63938-1_68","type":"book-chapter","created":{"date-parts":[[2006,7,18]],"date-time":"2006-07-18T07:35:47Z","timestamp":1153208147000},"page":"262-271","source":"Crossref","is-referenced-by-count":14,"title":["Implementing a general-purpose edge router"],"prefix":"10.1007","author":[{"given":"David P.","family":"Dobkin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emden R.","family":"Gansner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eleftherios","family":"Koutsofios","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen C.","family":"North","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,29]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF01258291","volume":"11","author":"J.-D. Boissonnat","year":"1994","unstructured":"J.-D. Boissonnat, A. Cerezo, and J. Leblond. Shortest paths of bounded curvature in the plane. J. Intell. and Robotics Systems, 11:5\u201320, 1994.","journal-title":"J. Intell. and Robotics Systems"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"B. Chazelle. A theorem on polygon cutting with applications. In Proc. 23rd IEEE Symp. Foundations of Computer Science, pages 339\u2013349, 1982.","DOI":"10.1109\/SFCS.1982.58"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/BF01762127","volume":"3","author":"D. P. Dobkin","year":"1988","unstructured":"D. P. Dobkin, D. L. Souvaine, and C. J. Van Wyk. Decomposition and intersection of simple splinegons. Algorithmica, 3:473\u2013486, 1988.","journal-title":"Algorithmica"},{"key":"24_CR4","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/2372560","volume":"79","author":"L. E. Dubins","year":"1957","unstructured":"L. E. Dubins. On curves of minimal length with a constraint on average curvature and with prescribed initial and terminal positions and tangents. Amer. J. Math., 79:497\u2013516, 1957.","journal-title":"Amer. J. Math."},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF01530887","volume":"3","author":"S. Fortune","year":"1991","unstructured":"S. Fortune and G. Wilfong. Planning constrained motion. Annals of Mathematics and Artificial Intelligence, 3:21\u201382, 1991.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"E.R. Gansner, E. Koutsofios, S.C. North, and K.P. Vo. A technique for drawing directed graphs. IEEE Transactions on Software Engineering, March 1993.","DOI":"10.1109\/32.221135"},{"issue":"11","key":"24_CR7","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1002\/spe.4380181104","volume":"18","author":"E.R. Gansner","year":"1988","unstructured":"E.R. Gansner, S.C. North, and K.P. Vo. Dag-a program that draws directed graphs. Software-Practice and Experience, 18(11):1047\u20131062, 1988.","journal-title":"Software-Practice and Experience"},{"issue":"5","key":"24_CR8","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1137\/0220055","volume":"20","author":"S. K. Ghosh","year":"1991","unstructured":"S. K. Ghosh and D. M. Mount. An output-sensitive algorithm for computing visibility graphs. SIAM J. Computing, 20(5):888\u2013910, 1991.","journal-title":"SIAM J. Computing"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"J. Hershberger and J. Snoeyink. Computing minimum length paths of a given homotopy class. In Proc. 2nd Workshop Algorithms Data Struct., volume 519 of Lecture Notes in Computer Science, pages 331\u2013342. Springer-Verlag, 1991.","DOI":"10.1007\/BFb0028273"},{"key":"24_CR10","unstructured":"10.P. Jacobs. Minimal length curvature constrained paths in the presence of obstacles. Technical Report 90042, Laboratoire d'Automatique et d'Analyse des Systemes, 7 Avenue du Colonel Roche-31077 Toulouse, France, February 1990."},{"key":"24_CR11","first-page":"1265","volume":"3","author":"Y. Kanayama","year":"1989","unstructured":"Y. Kanayama and B. I. Hartman. Smooth local path planning for autonomous vehicles. In Proc. IEEE Intl. Conf. on Robotics and Automation, volume 3, pages 1265\u20131270, 1989.","journal-title":"Proc. IEEE Intl. Conf. on Robotics and Automation"},{"key":"24_CR12","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":"24_CR13","unstructured":"J. P. Laumond. Finding collision-free smooth trajectories for a non-holonomic mobile robot. In Proc. Intl. Joint Conf. on Artificial Intelligence, pages 1120\u20131123, 1987."},{"key":"24_CR14","first-page":"1260","volume":"3","author":"W. Nelson","year":"1989","unstructured":"W. Nelson. Continuous-curvature paths for autonomous vehicles. In Proc. IEEE Intl. Conf. on Robotics and Automation, volume 3, pages 1260\u20131264, 1989.","journal-title":"Proc. IEEE Intl. Conf. on Robotics and Automation"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"S.C. North. Incremental layout in dynadag. In F.J. Brandenburg, editor, Symp. on Graph Drawing GD'95, volume 1027 of Lecture Notes in Computer Science, pages 409\u2013418, 1996.","DOI":"10.1007\/BFb0021824"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"M. H. Overmars and E. Welzl. New methods for computing visibility graphs. In Proc. 4th Annu. ACM Sympos. Comput. Geom., pages 164\u2013171, 1988.","DOI":"10.1145\/73393.73410"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"J. A. Reeds and L. A. Shepp. Optimal paths for a car that goes both forwards and backwards. Pacific J. of Mathematics, 145(2), 1990.","DOI":"10.2140\/pjm.1990.145.367"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"G. Sander, M. Alt, C. Ferdinand, and R. Wilhelm. Clax, a visualized compiler. In F.J. Brandenburg, editor, Symp. on Graph Drawing GD'95, volume 1027 of Lecture Notes in Computer Science, pages 459\u2013462, 1996.","DOI":"10.1007\/BFb0021829"},{"key":"24_CR19","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1016\/B978-0-08-050753-8.50132-7","volume-title":"Graphics Gems","author":"P. J. Schneider","year":"1990","unstructured":"Philip J. Schneider. An algorithm for automatically fitting digitized curves. In Andrew S. Glassner, editor, Graphics Gems, pages 612\u2013626. Academic Press, Boston, Mass., 1990."},{"key":"24_CR20","first-page":"391","volume-title":"Algorithms and Complexity, volume A of Handbook of Theoretical Computer Science","author":"J. T. Schwartz","year":"1990","unstructured":"J. T. Schwartz and M. Sharin, Algorithmic motion planning in robotics. In J. van Leeuwen, editor, Algorithms and Complexity, volume A of Handbook of Theoretical Computer Science, pages 391\u2013430. Elsevier, Amsterdam, 1990."},{"key":"24_CR21","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0734-189X(86)90127-1","volume":"35","author":"S. Suri","year":"1986","unstructured":"S. Suri. A linear time algorithm for minimum link paths inside a simple polygon. Computer Vision and Graphical Image Processing, 35:99\u2013110, 1986.","journal-title":"Computer Vision and Graphical Image Processing"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63938-1_68","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T10:58:15Z","timestamp":1549191495000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63938-1_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540639381","9783540696742"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-63938-1_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}