{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:20:11Z","timestamp":1742617211145,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540620341"},{"type":"electronic","value":"9783540496311"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-62034-6_43","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:31:14Z","timestamp":1330295474000},"page":"123-134","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic maintenance of shortest path trees in simple polygons"],"prefix":"10.1007","author":[{"given":"Sanjiv","family":"Kapoor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tripurari","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"[CT] \u201cDynamic algorithms in computational geometry\u201d by Y.J. Chiang and R. Tamassia, Proc. IEEE, 80(9):1412\u20131434","DOI":"10.1109\/5.163409"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"[GH] \u201cOptimal Shortest Path Queries in a Simple Polygon\u201d, L.J. Guibas and J.Hershberger. Proceedings of the 3rd ACM Symposium on computational Geometry, Waterloo, Canada (1987), pp 50\u201363.","DOI":"10.1145\/41958.41964"},{"key":"11_CR3","unstructured":"[GHLST) \u201cLinear time algorithms for visibility and shortest path problems inside simple polygons\u201d by L.Guibas, J.Hershberger, D.Leven, M.Sharir and R.Tarjan, Proc. of the 3rd ACM Symposium on Computational Geometry, June 1987."},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"[GT] \u201cDynamic trees and dynamic point location\u201d, by M. Goodrich and R. Tamassia,Proceedings of the 23rd Annu. ACM Sympos. Theory Comput., pp 523\u2013533, 1991.","DOI":"10.1145\/103418.103472"},{"key":"11_CR5","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"D.T. Lee","year":"1984","unstructured":"[LP] \u201cEuclidean Shortest Paths in the Presence of Rectilinear Barriers\u201d, D.T. Lee and F.P. Preparata., Networks, vol.14 (1984), pp.393\u2013410.","journal-title":"Networks"},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"D.D. Sleator","year":"1983","unstructured":"[ST) \u201cA Data Structure for Dynamic Trees\u201d, D.D.Sleator and R.E. Tarjan, Jour. of Computer and System Sciences, 26, 362\u2013391 (1983).","journal-title":"Jour. of Computer and System Sciences"},{"key":"11_CR7","unstructured":"[V] \u201cDynamically maintaining the visibility graph\u201d, G. Vegter, WADS, 1991, pp 425\u2013436."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62034-6_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:27:24Z","timestamp":1742599644000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62034-6_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620341","9783540496311"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-62034-6_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}