{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:21Z","timestamp":1725663621360},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540565031"},{"type":"electronic","value":"9783540475743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56503-5_29","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T06:14:37Z","timestamp":1330236877000},"page":"282-293","source":"Crossref","is-referenced-by-count":1,"title":["Rectilinear path queries in a simple rectilinear polygon"],"prefix":"10.1007","author":[{"given":"Sven","family":"Schuierer","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"29_CR1","unstructured":"E. Arkin, J. Mitchell, and S. Suri. Optimal link path queries in a simple polygon. In Proc. 3rd Symposium on Discrete Algorithms, 1992."},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"O. Berkman and U. Vishkin. Recursive*-tree parallel data-structure. In Proc. 30th Symposium on Foundations of Computer Science, pages 196\u2013202, 1989.","DOI":"10.1109\/SFCS.1989.63478"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Bernard Chazelle. Triangulating a simple polygon in linear time. In Proceedings of the 31th Symposium on Foundations of Computer Science, pages 220\u2013230, IEEE, 1990.","DOI":"10.1109\/FSCS.1990.89541"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"K.L. Clarkson, S. Kapoor, and P.M. Vaidya. Rectilinear shortest paths through polygonal obstacles in O(n log2 n) time. In Proc. 3rd Annual Conference on Computational Geometry, pages 251\u2013257, 1987.","DOI":"10.1145\/41958.41985"},{"issue":"1","key":"29_CR5","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0925-7721(91)90010-C","volume":"1","author":"M. Berg de","year":"1991","unstructured":"M. de Berg. On rectilinear link distance. Computational Geometry: Theory and Applications, 1(1):13\u201334, 1991.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"G. Das and G. Narasimhan. Geometric searching and link distance. In F. Santoro F. Dehne, J.-R. Sack, editor, Proc. 2nd Workshop on Algorithms and Data Structures, pages 261\u2013272, LNCS 519, 199.1.","DOI":"10.1007\/BFb0028268"},{"key":"29_CR7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02187714","volume":"4","author":"P. J. Rezende de","year":"1989","unstructured":"P.J. de Rezende, D.T. Lee, and Y.F. Wu. Rectilinear shortest paths with rectangular barriers. Journal of Discrete and Computational Geometry, 4:41\u201353, 1989.","journal-title":"Journal of Discrete and Computational Geometry"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"M.T. de Berg, M.J. van Kreveld, B.J. Nilsson, and M.H. Overmars. Finding shortest paths in the presence of orthogonal obstacles using a combined l 1 and link metric. In Proc. 2nd Scandinavian Workshop on Algorithm Theory, pages 213\u2013224, LNCS 447, Springer Verlag, 1990.","DOI":"10.1007\/3-540-52846-6_91"},{"issue":"2","key":"29_CR9","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1137\/0215023","volume":"15","author":"H. Edelsbrunner","year":"1986","unstructured":"H. Edelsbrunner, L.J. Guibas, and J. Stolfi. Optimal point location in a monotone subdivision. SIAM Journal of Computing, 15(2):317\u2013340, 1986.","journal-title":"SIAM Journal of Computing"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"L. Guibas and J. Hershberger. Optimal shortest path queries in a simple polygon. In Proc. 3rd Symposium on Computational Geometry, pages 50\u201363, Waterloo, Ontario, 1987.","DOI":"10.1145\/41958.41964"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"J. Hershberger and J. Snoeyink. Computing minimum length paths of a given homotopy class. In F. Santoro F. Dehne, J.-R. Sack, editor, Proc. 2nd Workshop on Algorithms and Data Structures, pages 331\u2013342, LNCS 519, Springer Verlag, 1991.","DOI":"10.1007\/BFb0028273"},{"key":"29_CR12","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13:338\u2013355, 1984.","journal-title":"SIAM Journal on Computing"},{"key":"29_CR13","volume-title":"PhD thesis","author":"C. Levcopoulos","year":"1987","unstructured":"Christos Levcopoulos. Heuristics for Minimum Decompositions of Polygons. PhD thesis, University of Link\u00f6ping, Link\u00f6ping, Sweden, 1987."}],"container-title":["Lecture Notes in Computer Science","STACS 93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56503-5_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:04:17Z","timestamp":1605629057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56503-5_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540565031","9783540475743"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-56503-5_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}