{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T09:38:20Z","timestamp":1648719500733},"reference-count":18,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"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":[[2001,11]]},"DOI":"10.1016\/s0031-3203(00)00144-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:12:57Z","timestamp":1027631577000},"page":"2163-2172","source":"Crossref","is-referenced-by-count":2,"title":["Fast algorithms for computing \u03b2-skeletons and their relatives"],"prefix":"10.1016","volume":"34","author":[{"given":"S.V.","family":"Rao","sequence":"first","affiliation":[]},{"given":"Asish","family":"Mukhopadhyay","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0031-3203(00)00144-8_BIB1","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\/S0031-3203(00)00144-8_BIB2","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. ACM"},{"key":"10.1016\/S0031-3203(00)00144-8_BIB3","doi-asserted-by":"crossref","unstructured":"J.W. Jaromczyk, M. Kowaluk, A note on relative neighborhood graphs, Proceedings of 6th ACM Symposium on Computational Geometry, 1987, pp. 233\u2013241.","DOI":"10.1145\/41958.41983"},{"key":"10.1016\/S0031-3203(00)00144-8_BIB4","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02239166","article-title":"On constructing relative neighborhood graphs in euclidean k-dimensional spaces","volume":"46","author":"Su","year":"1991","journal-title":"Computing"},{"key":"10.1016\/S0031-3203(00)00144-8_BIB5","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0166-218X(91)90069-9","article-title":"Constructing relative neighborhood graph in 3-dimensional euclidean space","volume":"31","author":"Jaromczyk","year":"1991","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0031-3203(00)00144-8_BIB6","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0925-7721(94)90018-3","article-title":"A linear-time construction of the relative neighborhood graph from the delaunay triangulation","volume":"4","author":"Lingas","year":"1994","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/S0031-3203(00)00144-8_BIB7","unstructured":"J.W. Jaromczyk, M. Kowaluk, F. Yao, An optimal algorithm for constructing \u03b2-skeletons in the lp metric, SIAM J. Comput., to be published."},{"key":"10.1016\/S0031-3203(00)00144-8_BIB8","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0165-1684(89)90031-5","article-title":"Graphs and mathematical morphology","volume":"16","author":"Vincent","year":"1989","journal-title":"Signal Processing"},{"key":"10.1016\/S0031-3203(00)00144-8_BIB9","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0925-7721(92)90003-B","article-title":"The \u03b3-neighborhood graph","volume":"4","author":"Veltkamp","year":"1992","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/S0031-3203(00)00144-8_BIB10","doi-asserted-by":"crossref","unstructured":"J.W. Jaromczyk, G.T. Toussaint, Relative neighborhood graphs and their relatives, Proceedings of IEEE, 1992, pp. 1502\u20131517.","DOI":"10.1109\/5.163414"},{"key":"10.1016\/S0031-3203(00)00144-8_BIB11","series-title":"Computational Geometry","first-page":"217","article-title":"A framework for computational morphology","author":"Kirkpatrick","year":"1985"},{"key":"10.1016\/S0031-3203(00)00144-8_BIB12","unstructured":"S.V. Rao, A. Mukhopadhyay, Output-sensitive algorithm for computing \u03b2-skeleton, 10th Canadian Conference on Computational Geometry (CCCG \u201998), McGill University, Canada, August 1998."},{"key":"10.1016\/S0031-3203(00)00144-8_BIB13","first-page":"133","article-title":"A note on euclidean near neighbor searching in the plane","volume":"8","author":"Bentely","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0031-3203(00)00144-8_BIB14","series-title":"Computational Geometry","author":"Preparata","year":"1985"},{"key":"10.1016\/S0031-3203(00)00144-8_BIB15","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0031-3203(91)90065-D","article-title":"Computing the k-relative neighborhood graphs in euclidean plane","volume":"24","author":"Su","year":"1991","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0031-3203(00)00144-8_BIB16","doi-asserted-by":"crossref","unstructured":"T.H. Su, R.Ch. Chang, The k-gabriel graphs and their applications, Proceedings of International Symposium SIGAL \u201990, 1990, pp. 66\u201375.","DOI":"10.1007\/3-540-52921-7_56"},{"key":"10.1016\/S0031-3203(00)00144-8_BIB17","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01758842","article-title":"Solving the euclidean bottleneck matching problem by k-relative neighborhood graph","volume":"8","author":"Chang","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S0031-3203(00)00144-8_BIB18","doi-asserted-by":"crossref","unstructured":"A. Mirzaian, Minimum weight euclidean matching and weighted relative neighborhood graphs, Proceedings of 3rd Workshop Algorithms Data Struct., Lecture Notes in Computer Science, Vol. 709, Springer, Berlin, 1993, pp. 506\u2013517.","DOI":"10.1007\/3-540-57155-8_275"}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320300001448?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320300001448?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T15:58:02Z","timestamp":1555775882000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0031320300001448"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":18,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["S0031320300001448"],"URL":"https:\/\/doi.org\/10.1016\/s0031-3203(00)00144-8","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}