{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:06:30Z","timestamp":1760439990754},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,6,1]],"date-time":"1996-06-01T00:00:00Z","timestamp":833587200000},"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":6255,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1996,6]]},"DOI":"10.1016\/0925-7721(95)00026-7","type":"journal-article","created":{"date-parts":[[2003,4,24]],"date-time":"2003-04-24T18:53:11Z","timestamp":1051210391000},"page":"169-194","source":"Crossref","is-referenced-by-count":7,"title":["An optimal algorithm for the rectilinear link center of a rectilinear polygon"],"prefix":"10.1016","volume":"6","author":[{"given":"Bengt J.","family":"Nilsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Schuierer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(95)00026-7_BIB1","series-title":"Proc. 2nd Workshop on Algorithms and Data Structures","first-page":"261","article-title":"Geometric searching and link distance","volume":"519","author":"Das","year":"1991"},{"issue":"1","key":"10.1016\/0925-7721(95)00026-7_BIB2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0925-7721(91)90010-C","article-title":"On rectilinear link distance","volume":"1","author":"de Berg","year":"1991","journal-title":"Computational Geometry: Theory and Applications"},{"key":"10.1016\/0925-7721(95)00026-7_BIB3","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02293040","article-title":"An O(nlogn) algorithm for computing the link center of a simple polygon","volume":"8","author":"Djidjev","year":"1992","journal-title":"Discrete and Computational Geometry"},{"key":"10.1016\/0925-7721(95)00026-7_BIB4","series-title":"Proc. 3rd Canadian Conference on Computational Geometry","first-page":"162","article-title":"Finding smallest paths in rectilinear polygons on a hypercube multiprocessor","author":"Ferreira","year":"1991"},{"key":"10.1016\/0925-7721(95)00026-7_BIB5","series-title":"Proc. 5th ACM Symposium on Computational Geometry","first-page":"69","article-title":"An efficient algorithm for link-distance problems","author":"Ke","year":"1989"},{"key":"10.1016\/0925-7721(95)00026-7_BIB6","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02187913","article-title":"Computing the link center of a simple polygon","volume":"3","author":"Lenhart","year":"1988","journal-title":"Discrete and Computational Geometry"},{"key":"10.1016\/0925-7721(95)00026-7_BIB7","series-title":"Proc. 7th IEEE International Parallel Processing Symposium","article-title":"Parallel algorithms for rectilinear link distance problems","author":"Lingas","year":"1993"},{"key":"10.1016\/0925-7721(95)00026-7_BIB8","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1109\/43.144850","article-title":"Smallest paths in simple rectilinear polygons","volume":"11","author":"McDonalds","year":"1992","journal-title":"IEEE Transactions on Computer Aided Design"},{"key":"10.1016\/0925-7721(95)00026-7_BIB9","series-title":"Computational Geometry\u2014Methods, Algorithms, and Applications","first-page":"203","article-title":"Computing the rectilinear link diameter of a polygon","volume":"553","author":"Nilsson","year":"1991"},{"key":"10.1016\/0925-7721(95)00026-7_BIB10","article-title":"Minimum link paths in polygons and related problems","author":"Suri","year":"1987"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000267?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000267?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T23:24:48Z","timestamp":1555197888000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925772195000267"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,6]]}},"alternative-id":["0925772195000267"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(95)00026-7","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}