{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T15:41:04Z","timestamp":1780674064899,"version":"3.54.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1983,11,1]],"date-time":"1983-11-01T00:00:00Z","timestamp":436492800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1983,11]]},"DOI":"10.1016\/0020-0190(83)90045-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"219-223","source":"Crossref","is-referenced-by-count":29,"title":["On computing all north-east nearest neighbors in the L1 metric"],"prefix":"10.1016","volume":"17","author":[{"given":"Leo J.","family":"Guibas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jorge","family":"Stolfi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(83)90045-5_BIB1","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1137\/0205051","article-title":"Finding minimum spanning trees","volume":"5","author":"Cheriton","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(83)90045-5_BIB2","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/322123.322124","article-title":"An O(n log n) algorithm for rectilinear minimal spanning trees","volume":"26","author":"Hwang","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(83)90045-5_BIB3","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","article-title":"On the shortest spanning subtree of a graph and the travelling salesman problem","volume":"7","author":"Kruskal","year":"1956","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0020-0190(83)90045-5_BIB4","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/322217.322219","article-title":"Two-dimensional Voronoi diagrams in the Lp metric","volume":"27","author":"Lee","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(83)90045-5_BIB5","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1137\/0209017","article-title":"Voronoi diagrams in L1 (L\u221e) metrics with 2-dimensional storage applications","volume":"9","author":"Lee","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(83)90045-5_BIB6","article-title":"Computational geometry","author":"Shamos","year":"1977"},{"key":"10.1016\/0020-0190(83)90045-5_BIB7","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0211059","article-title":"On constructing minimum spanning trees in k-dimensional spaces and related problems","volume":"11","author":"Yao","year":"1982","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083900455?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083900455?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:56:53Z","timestamp":1555088213000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019083900455"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,11]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1983,11]]}},"alternative-id":["0020019083900455"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(83)90045-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1983,11]]}}}