{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T07:28:12Z","timestamp":1690874892809},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1990,3]]},"DOI":"10.1007\/bf02250584","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T17:00:46Z","timestamp":1132074046000},"page":"51-68","source":"Crossref","is-referenced-by-count":6,"title":["Shortest polygonal paths in space","K\u00fcrzeste Streckenz\u00fcge im Raum"],"prefix":"10.1007","volume":"45","author":[{"given":"R. E.","family":"Burkard","sequence":"first","affiliation":[]},{"given":"G.","family":"Rote","sequence":"additional","affiliation":[]},{"given":"E. Y.","family":"Yao","sequence":"additional","affiliation":[]},{"given":"Z. L.","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02250584_CR1","first-page":"145","volume":"32","author":"H. Alt","year":"1988","unstructured":"H. Alt and E. Welzl (1988): Visibility graphs and obstacle avoiding shortest paths. Zeitschrift f\u00fcr Operations Research32 145\u2013164.","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"BF02250584_CR2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0020-0190(88)90141-X","volume":"28","author":"W. P. Chin","year":"1988","unstructured":"W. P. Chin and S. Ntafos (1988): Optimum watchman routes, Inf. Proc. Letters28 39\u201344","journal-title":"Inf. Proc. Letters"},{"key":"BF02250584_CR3","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1080\/02331938608843141","volume":"17","author":"J. Focke","year":"1986","unstructured":"J. Focke (1986): A finite descent method for Steiner's problem of inpolygons with minimal circumference. Optimization17, 355\u2013366","journal-title":"Optimization"},{"key":"BF02250584_CR4","doi-asserted-by":"crossref","unstructured":"S. Gao, M. Jerrum, M. Kaufmann, K. Mehlhorn, W. R\u00fclling and C. Storb (1988a): On continuous homotopic one layer routing, Proc. Fourth Annual Symp. Computational Geometry, Urbana-champaign, pp. 392\u2013402.","DOI":"10.1145\/73393.73433"},{"key":"BF02250584_CR5","doi-asserted-by":"crossref","unstructured":"S. Gao, M. Jerrum, M. Kaufmann, K. Mehlhorn, W. R\u00fclling and C. Storb (1988b): On continuous homotopic one layer routing (extended abstract), in: H. Noltemeier (ed.), Computational Geometry and its Applications, Proc. CG'88, International Workshop on Computational Geometry, W\u00fcrzburg, FRG, March 1988, Lecture Notes in Computer Science333, Springer-Verlag, pp. 55\u201370.","DOI":"10.1007\/3-540-50335-8_24"},{"key":"BF02250584_CR6","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L. Guibas","year":"1987","unstructured":"L. Guibas, J. Hershberger, D. Leven, M. Sharir and R. E. Tarjan (1987), Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica2, 209\u2013233.","journal-title":"Algorithmica"},{"key":"BF02250584_CR7","doi-asserted-by":"crossref","unstructured":"L. Guibas, J. Hershberger, D. Leven, M. Sharir and R. E. Tarjan (1986), Linear time algorithms for visibility and shortest path problems inside simple polygons, Proc. Second Annual Symp. Computational Geometry, pp. 1\u201313.","DOI":"10.1145\/10515.10516"},{"key":"BF02250584_CR8","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1080\/02331938508843082","volume":"16","author":"R. Kl\u00f6tzler","year":"1985","unstructured":"R. Kl\u00f6tzler and H. Rudolph (1985): Zur analytischen und algorithmischen Behandlung eines geometrischen Optimierungsproblems von J. Steiner, Optimization16, 833\u2013848","journal-title":"Optimization"},{"key":"BF02250584_CR9","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"D. T. Lee","year":"1985","unstructured":"D. T. Lee and F. P. Preparata (1985): Euclidean shortest paths in the presence of rectilinear barriers Networks14, 393\u2013410.","journal-title":"Networks"},{"key":"BF02250584_CR10","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1137\/0216045","volume":"16","author":"J. S. B. Mitchell","year":"1987","unstructured":"J. S. B. Mitchell, D. M. Mount and C. H. Papadimitriou (1987): The discrete geodesic problem, SIAM J. Comput.16, 647\u2013668","journal-title":"SIAM J. Comput."},{"key":"BF02250584_CR11","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1080\/02331938708843244","volume":"18","author":"H. X. Ph\u00f9","year":"1987","unstructured":"H. X. Ph\u00f9 (1987): Ein konstruktives L\u00f6sungsverfahren f\u00fcr das Problem des Inpolygons kleinsten Umfanges von J. Steiner, Optimization18, 349\u2013359.","journal-title":"Optimization"},{"key":"BF02250584_CR12","first-page":"344","volume":"2","author":"H. A. Schwarz","year":"1890","unstructured":"H. A. Schwarz (1890): Gesammelte Mathematische Abhandlungen, Band 2, Berlin, pp. 344\u2013345.","journal-title":"Gesammelte Mathematische Abhandlungen"},{"key":"BF02250584_CR13","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1137\/0215014","volume":"15","author":"M. Sharir","year":"1986","unstructured":"M. Sharir and A. Schorr (1986): On shortest paths in polyhedral spaces. SIAM J. Comput.15, 193\u2013215","journal-title":"SIAM J. Comput."},{"key":"BF02250584_CR14","first-page":"45","volume":"2","author":"J. Steiner","year":"1882","unstructured":"J. Steiner (1882): Gesammelte Werke, Band 2, Berlin, p. 45.","journal-title":"Gesammelte Werke"},{"key":"BF02250584_CR15","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1515\/crll.1884.96.36","volume":"96","author":"R. Sturm","year":"1884","unstructured":"R. Sturm (1884): Bemerkungen und Ans\u00e4tze zu Steiners Aufs\u00e4tzen \u00fcber Maxima und Minima. Journal f\u00fcr reine und angew. Math.96, 36\u201377","journal-title":"Journal f\u00fcr reine und angew. Math."},{"key":"BF02250584_CR16","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0022-0000(81)90010-6","volume":"23","author":"M. Tompa","year":"1981","unstructured":"M. Tompa (1981): An optimal solution to a wire-routing problem, Journal of Computer and Systems Sciences23, 127\u2013150.","journal-title":"Journal of Computer and Systems Sciences"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02250584.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02250584\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02250584","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T12:48:42Z","timestamp":1683290922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02250584"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["BF02250584"],"URL":"https:\/\/doi.org\/10.1007\/bf02250584","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}