{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T03:19:30Z","timestamp":1774495170924,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T00:00:00Z","timestamp":1101859200000},"content-version":"vor","delay-in-days":5540,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1989,10]]},"DOI":"10.1016\/0022-0000(89)90041-x","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"126-152","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":144,"title":["Optimal shortest path queries in a simple polygon"],"prefix":"10.1016","volume":"39","author":[{"given":"Leonidas J.","family":"Guibas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Hershberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(89)90041-X_BIB1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01840359","article-title":"Geometric applications of a matrix searching algorithm","volume":"2","author":"Aggarwal","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0022-0000(89)90041-X_BIB2","article-title":"A Linear Algorithm for Determining Translation Separability of Two Simple Polygons","author":"Bhattacharya","year":"1986"},{"key":"10.1016\/0022-0000(89)90041-X_BIB3","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1137\/0215023","article-title":"Optimal point location in a monotone subdivision","volume":"15","author":"Edelsbrunner","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(89)90041-X_BIB4","series-title":"Proceedings, 23rd Annual ACM Symp. on Theory of Computing","first-page":"70","article-title":"A theorem on polygon cutting with applications","author":"Chazelle","year":"1981"},{"key":"10.1016\/0022-0000(89)90041-X_BIB5","series-title":"Proceedings, 1st ACM Symposium on Computational Geometry","first-page":"135","article-title":"Visibility and intersection problems in plane geometry","author":"Chazelle","year":"1985"},{"key":"10.1016\/0022-0000(89)90041-X_BIB6","series-title":"Proceedings, 2nd ACM Symposium on Computational Geometry","first-page":"1","article-title":"Linear time algorithms for visibility and shortest path problems inside simple polygons","author":"Guibas","year":"1986"},{"key":"10.1016\/0022-0000(89)90041-X_BIB7","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/net.3230140304","article-title":"Euclidean shortest paths in the presence of rectilinear barriers","volume":"14","author":"Lee","year":"1984","journal-title":"Networks"},{"key":"10.1016\/0022-0000(89)90041-X_BIB8","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","article-title":"Maintenance of configurations in the plane","volume":"23","author":"Overmars","year":"1981","journal-title":"J.Comput. System Sci."},{"key":"10.1016\/0022-0000(89)90041-X_BIB9","series-title":"Computational Geometry","author":"Preparata","year":"1986"},{"key":"10.1016\/0022-0000(89)90041-X_BIB10","article-title":"Shortest Paths in Euclidean Space with Polyhedral Obstacles","author":"Reif","year":"1985"},{"key":"10.1016\/0022-0000(89)90041-X_BIB11","series-title":"Proceedings, 3rd ACM Symposium on Computational Geometry","first-page":"64","article-title":"The all-geodesic-furthest neighbor problem for simple polygons","author":"Suri","year":"1987"},{"key":"10.1016\/0022-0000(89)90041-X_BIB12","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1137\/0217010","article-title":"An O(n log log n)-time algorithm for triangulating a simple polygon","volume":"17","author":"Tarjan","year":"1988","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200008990041X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200008990041X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T09:08:50Z","timestamp":1734080930000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200008990041X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["002200008990041X"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(89)90041-x","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1989,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimal shortest path queries in a simple polygon","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0022-0000(89)90041-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}