{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T15:59:24Z","timestamp":1726415964242},"reference-count":14,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":["Pattern Recognition"],"published-print":{"date-parts":[[1985,1]]},"DOI":"10.1016\/0031-3203(85)90023-8","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:41:01Z","timestamp":1056998461000},"page":"327-332","source":"Crossref","is-referenced-by-count":16,"title":["Relative neighborhood graphs in the Li-metric"],"prefix":"10.1016","volume":"18","author":[{"given":"D.T.","family":"Lee","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0031-3203(85)90023-8_BIB1","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1145\/2402.322386","article-title":"The relative neighborhood graph, with an application to minimum spanning trees","volume":"30","author":"Supowit","year":"1983","journal-title":"J. Ass. comput. Mach."},{"key":"10.1016\/0031-3203(85)90023-8_BIB2","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","article-title":"The relative neighborhood graph of a finite planar set","volume":"12","author":"Toussaint","year":"1980","journal-title":"Pattern Recognition"},{"key":"10.1016\/0031-3203(85)90023-8_BIB3","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0167-8655(83)90070-3","article-title":"Some properties of the planar Euclidean relative neighborhood graph","volume":"1","author":"Urquhart","year":"1983","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/0031-3203(85)90023-8_BIB4","first-page":"1324","article-title":"Pattern recognition and geometrical complexity","author":"Toussaint","year":"1980"},{"key":"10.1016\/0031-3203(85)90023-8_BIB5","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0031-3203(82)90070-X","article-title":"Computing the relative neighborhood graph in the L1 and L metrics","volume":"15","author":"O'Rourke","year":"1982","journal-title":"Pattern Recognition"},{"key":"10.1016\/0031-3203(85)90023-8_BIB6","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1145\/356789.356797","article-title":"Data structures for range searching","volume":"11","author":"Bentley","year":"1979","journal-title":"Comput. Surv."},{"key":"10.1016\/0031-3203(85)90023-8_BIB7","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF00263991","article-title":"Efficient worst-case data structures for range searching","volume":"13","author":"Bentley","year":"1980","journal-title":"Acta inf."},{"key":"10.1016\/0031-3203(85)90023-8_BIB8","first-page":"209","article-title":"A new data structure for dynamic range queries","volume":"15","author":"Lueker","year":"1982"},{"key":"10.1016\/0031-3203(85)90023-8_BIB9","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1137\/0214019","article-title":"New data structures for orthogonal queries","volume":"14","author":"Willard","year":"1985","journal-title":"SIAM. J. Comput."},{"key":"10.1016\/0031-3203(85)90023-8_BIB10","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1147\/rd.236.0696","article-title":"An elementary proof of nonexistence of isometries between Lp and Lq","volume":"23","author":"Coppersmith","year":"1979","journal-title":"IBM J. Res. Dev."},{"key":"10.1016\/0031-3203(85)90023-8_BIB11","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1137\/0209017","article-title":"Voronoi diagrams in L1 (L) metrics with 2-dimensional storage applications","volume":"9","author":"Lee","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0031-3203(85)90023-8_BIB12","first-page":"151","article-title":"Closest point problems","author":"Shamos","year":"1975"},{"key":"10.1016\/0031-3203(85)90023-8_BIB13","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF00977785","article-title":"Two algorithms for constructing Delaunay triangulations","volume":"9","author":"Lee","year":"1980","journal-title":"Int. J. Comput. Inf. Sci."},{"key":"10.1016\/0031-3203(85)90023-8_BIB14","first-page":"87","article-title":"Convex hulls of finite sets of points in two and three dimensions","volume":"20","author":"Preparata","year":"1977","journal-title":"Commun. Ass. comput. Mach."}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0031320385900238?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0031320385900238?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T10:21:26Z","timestamp":1552904486000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0031320385900238"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,1]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1985,1]]}},"alternative-id":["0031320385900238"],"URL":"https:\/\/doi.org\/10.1016\/0031-3203(85)90023-8","relation":{},"ISSN":["0031-3203"],"issn-type":[{"type":"print","value":"0031-3203"}],"subject":[],"published":{"date-parts":[[1985,1]]}}}