{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T21:04:39Z","timestamp":1764363879324},"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":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8690,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1989,10]]},"DOI":"10.1016\/0022-0000(89)90045-7","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"220-235","source":"Crossref","is-referenced-by-count":33,"title":["Computing geodesic furthest neighbors in simple polygons"],"prefix":"10.1016","volume":"39","author":[{"given":"Subhash","family":"Suri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(89)90045-7_BIB1","series-title":"Proceedings, Second ACM symposium on Computational Geometry","first-page":"285","article-title":"Geometric applications of a matrix searching algorithm","author":"Aggarwal","year":"1986"},{"key":"10.1016\/0022-0000(89)90045-7_BIB2","series-title":"Proceedings, U. S. Japan Seminar on Computer Science","article-title":"Computing the geodesic center of a simple polygon","author":"Asano","year":"1986"},{"key":"10.1016\/0022-0000(89)90045-7_BIB3","series-title":"Proceedings, of 23rd IEEE Symp. on Foundations of Computer Science","first-page":"339","article-title":"A theorem on polygon cutting with applications","author":"Chazelle","year":"1982"},{"key":"10.1016\/0022-0000(89)90045-7_BIB4","series-title":"Proceedings, Third ACM Symposium on Computational Geometry","first-page":"50","article-title":"Optimal shortest path queries in a simple polygon","author":"Guibas","year":"1987"},{"key":"10.1016\/0022-0000(89)90045-7_BIB5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","article-title":"Linear-Time Algorithms for Visibility and Shortest Path Problems inside a Triangulated Simple Polygon","volume":"2","author":"Guibas","year":"1987","journal-title":"Algorithmica"},{"issue":"No. 4","key":"10.1016\/0022-0000(89)90045-7_BIB6","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(78)90062-5","article-title":"Triangulating a simple polygon","volume":"7","author":"Garey","year":"1978","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(89)90045-7_BIB7","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0031-3203(84)90057-8","article-title":"Geodesic methods in quantitative image analysis","volume":"17","author":"Lantuejoul","year":"1984","journal-title":"Pattern Recognit."},{"issue":"No. 3","key":"10.1016\/0022-0000(89)90045-7_BIB8","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"},{"year":"1985","series-title":"Computational Geometry","author":"Preparata","key":"10.1016\/0022-0000(89)90045-7_BIB9"},{"article-title":"Computing the Geodesic Center of a Simple Polygon","year":"1986","author":"Pollack","key":"10.1016\/0022-0000(89)90045-7_BIB10"},{"year":"1986","series-title":"Computing geodesic properties of polygons","author":"Toussaint","key":"10.1016\/0022-0000(89)90045-7_BIB11"},{"key":"10.1016\/0022-0000(89)90045-7_BIB12","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1137\/0217010","article-title":"An O(n log log n) time algorithm for triangulating simple polygons","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:0022000089900457?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900457?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:55:12Z","timestamp":1550307312000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000089900457"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["0022000089900457"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(89)90045-7","relation":{},"ISSN":["0022-0000"],"issn-type":[{"type":"print","value":"0022-0000"}],"subject":[],"published":{"date-parts":[[1989,10]]}}}