{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:56:00Z","timestamp":1742932560387,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540642756"},{"type":"electronic","value":"9783540697152"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054318","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T05:37:37Z","timestamp":1149658657000},"page":"151-162","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Short and smooth polygonal paths"],"prefix":"10.1007","author":[{"given":"James","family":"Abello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emden","family":"Gansner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,25]]},"reference":[{"issue":"No.3","key":"14_CR1","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF02570710","volume":"14","author":"J. Abello","year":"1995","unstructured":"J. Abello, O. Egecioglu, K. Kumar, \u201cVisibility Graphs of Staircase Polygons and the Weak Bruhat Order I: Prom Polygons to Maximal Chains,\u201d Discrete and Computational Geometry, Vol. 14, No. 3, 1995, pp. 331\u2013358.","journal-title":"Discrete and Computational Geometry"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"J. Abello, K. Kumar, \u201cVisibility Graphs and Oriented Matroids,\u201d In R. Tamassia, I. Tollis, editors, Symposium on Graph Drawing GD'94, Princeton, Lecture Notes in Computer Science, Vol. 894, 1994, pp. 147\u2013158.","DOI":"10.1007\/3-540-58950-3_366"},{"key":"14_CR3","volume-title":"An Introduction to Splines for Use in Computer Graphics and Geometric Modeling","author":"R. Bartels","year":"1987","unstructured":"R. Bartels, J. Beatty, B. Barsky, An Introduction to Splines for Use in Computer Graphics and Geometric Modeling, Morgan Kaufman, Los Altos, California, 1987."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"D. P. Dobkin, E. Gansner, E. Koutsofios, S. C. North, \u201cImplementing a general-purpose edge router,\u201d To appear in, Proceedings of the Symposium on Graph Drawing GD'97, Rome, Sept. 1997.","DOI":"10.1007\/3-540-63938-1_68"},{"key":"14_CR5","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/2372560","volume":"79","author":"L. E. Dubis","year":"1957","unstructured":"L. E. Dubis. \u201cOn Curves of minimal length with a constraint on average curvature and with prescribed initial and terminal positions and tangents,\u201d Amer. J. Math., 79:497\u2013516, 1957.","journal-title":"Amer. J. Math."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"S. Fortune and G. Wilfong, \u201cPlanning constraint motion,\u201d In Proc. 20th Annu. ACM Sympos. Theory Comput., pp. 445\u2013459, 1988.","DOI":"10.1145\/62212.62256"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"E. R. Gansner, E. Koutsofios, S.C. North and K.P. Vo, \u201cA technique for drawing directed graphs,\u201d IEEE Transactions on Software Engineering, March 1993.","DOI":"10.1109\/32.221135"},{"issue":"5","key":"14_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, \u201cAn output-sensitive algorithm for computing visibility graphs\u201d, Siam J. Computing, 20(5):888\u2013910, 1991.","journal-title":"Siam J. Computing"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"J. Hershberger and S. Suri, \u201cEfficient computation of Euclidean shortest paths in the plane,\u201d In Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci., pp. 508\u2013517, 1993.","DOI":"10.1109\/SFCS.1993.366836"},{"key":"14_CR10","first-page":"1265","volume":"3","author":"Y. Kanayama","year":"1989","unstructured":"Y. Kanayama and B. I. Hartman, \u201cSmooth local path planning for autonomous vehicles,\u201d In Proc. IEEE Intl. Conf. on Robotics and Automation, Vol. 3, pp. 1265\u20131270, 1989.","journal-title":"Proc. IEEE Intl. Conf. on Robotics and Automation"},{"key":"14_CR11","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_CR12","unstructured":"J. P. Laumond, \u201cFinding collision free smooth trajectories for a non-holonomic mobile robot,\u201d In Proc. IEEE Intl. Join Conf. on Artificial Intelligence, pp. 1120\u20131123, 1987."},{"key":"14_CR13","unstructured":"J. O'Rourke, \u201cThe Computational Geometry Column,\u201d SIGACT News, 1992."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"J. O'Rourke, I. Streinu, \u201cPseudo Visibility Graphs,\u201d Proc. ACM Symposium on Computational Geometry, June 1997, France.","DOI":"10.1145\/262839.262915"},{"key":"14_CR15","volume-title":"Computational Geometry: An Introduction","author":"F. Preparata","year":"1995","unstructured":"F. Preparata, M. Shamos, Computational Geometry: An Introduction, Springer Verlag, NY, 1995."},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"J. A. Reeds and L. A. Shepp, \u201cOptimal paths for a car that goes both forward and backwards,\u201d Pacific Journal of Mathematics, 145(2), 1990.","DOI":"10.2140\/pjm.1990.145.367"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"G. Sander, M, Alt, A, Ferdinand, and R. Wilhelm, \u201cClax, a visualized Compiler,\u201d In F. J. Brandenburg, editor, Symposium on Graph Drawing GD'95, Vol. 1027 of Lecture Notes in Computer Science, pp. 459\u2013462, 1996.","DOI":"10.1007\/BFb0021829"},{"key":"14_CR18","series-title":"Handbook of Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/B978-0-444-88071-0.50013-8","volume-title":"Algorithms and Complexity","author":"J. T. Schwartz","year":"1990","unstructured":"J. T. Schwartz and M. Sharir, \u201cAlgorithmic motion planning in robotics,\u201d In J. van Leeuwen, editor, Algorithms and Complexity, Vol A of Handbook of Theoretical Computer Science, pp. 391\u2013430. Elsevier, Amsterdam, 1990."}],"container-title":["Lecture Notes in Computer Science","LATIN'98: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054318","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T07:11:19Z","timestamp":1736406679000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0054318"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540642756","9783540697152"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0054318","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"25 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}