{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T13:09:56Z","timestamp":1723900196570},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1007\/bf02239166","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T17:25:23Z","timestamp":1131989123000},"page":"121-130","source":"Crossref","is-referenced-by-count":8,"title":["On constructing the relative neighborhood graphs in EuclideanK-dimensional spaces"],"prefix":"10.1007","volume":"46","author":[{"given":"Tung-Hsin","family":"Su","sequence":"first","affiliation":[]},{"given":"Ruei-Chuan","family":"Chang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02239166_CR1","unstructured":"Brown, K. Q.: Geometric transforms for fast geometric algorithms. Ph.D. Thesis, Department of Computer Science, Carnegie Mellon University, Dec. 1979."},{"key":"BF02239166_CR2","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0019-9958(85)80045-0","volume":"65","author":"B. Chazelle","year":"1985","unstructured":"Chazelle, B.: How to search in history. Information and Control65, 77\u201399 (1985).","journal-title":"Information and Control"},{"key":"BF02239166_CR3","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0205015","volume":"5","author":"D. Dobkin","year":"1976","unstructured":"Dobkin, D., Lipton, R. J.: Multidimensional search problems. SIAM Journal on Computing5, 181\u2013186 (1976).","journal-title":"SIAM Journal on Computing"},{"key":"BF02239166_CR4","unstructured":"Dodge, C. W.: Euclidean geometry and transformations. Addison-Wesley 1972."},{"key":"BF02239166_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in combinatorial geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"Edelsbrunner, H.: Algorithms in combinatorial geometry. Heidelberg: Springer 1987."},{"key":"BF02239166_CR6","doi-asserted-by":"crossref","unstructured":"Gabow, H. N., Bentley, J. L., Tarjan, R. E.: Scaling and related techniques for geometry problems. Proceedings of 16th Annual ACM Symposium on Theory of Computing, 1984, pp. 134\u2013143.","DOI":"10.1145\/800057.808675"},{"key":"BF02239166_CR7","doi-asserted-by":"crossref","unstructured":"Jaromczyk, J. W., Kowaluk, M.: A note on relative neighborhood graphs. Proceedings of 3th ACM Symposium on Computational Geometry, 1987, pp. 233\u2013241.","DOI":"10.1145\/41958.41983"},{"key":"BF02239166_CR8","unstructured":"Jaromczyk, J. W., Kowaluk, M.: Constructing the relative neighborhood graphs in 3-dimensional Euclidean space, 1989, unpublished manuscript."},{"key":"BF02239166_CR9","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02247943","volume":"40","author":"K. Katajainen","year":"1988","unstructured":"Katajainen, K.: The region approach for computing relative neighbourhood graphs in theL p metric. Computing40, 147\u2013161 (1988).","journal-title":"Computing"},{"key":"BF02239166_CR10","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0031-3203(86)90012-9","volume":"19","author":"J. Katajainen","year":"1986","unstructured":"Katajainen, J., Nevalainen, O.: Computing relative neighbourhood graphs in the planes. Pattern Recognition19, 221\u2013228 (1986).","journal-title":"Pattern Recognition"},{"key":"BF02239166_CR11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0020-0190(87)90225-0","volume":"25","author":"J. Katajainen","year":"1987","unstructured":"Katajainen, J., Nevalainen, O., Teuhola, J.: A linear expected-time algorithm for computing planar relative neighbourhood graphs. Information Processing Letters25, 77\u201386 (1987).","journal-title":"Information Processing Letters"},{"key":"BF02239166_CR12","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF00977785","volume":"9","author":"D. T. Lee","year":"1980","unstructured":"Lee, D. T., Schacter, B. J.: Two algorithms for constructing a Delaunay triangulation. International Journal of Computer and Information Sciences9, 219\u2013227 (1980).","journal-title":"Journal of Computer and Information Sciences"},{"key":"BF02239166_CR13","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1111\/j.1538-4632.1980.tb00031.x","volume":"12","author":"D. M. Matula","year":"1980","unstructured":"Matula, D. M., Sokal, R. R.: Properties of variation research and the clustering of points in the plane. Geographical Analysis12, 205\u2013222 (1980).","journal-title":"Geographical Analysis"},{"key":"BF02239166_CR14","unstructured":"Shamos, M. I.: Computational geometry. Ph.D. Theses, Department of Computer Science, Yale University, 1978."},{"key":"BF02239166_CR15","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1145\/2402.322386","volume":"30","author":"K. J. Supowit","year":"1983","unstructured":"Supowit, K. J.: The relative neighborhood graph with an application to minimum spanning trees. Journal of Association for Computing Machinery30, 428\u2013448 (1983).","journal-title":"Journal of Association for Computing Machinery"},{"key":"BF02239166_CR16","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"12","author":"G. T. Toussaint","year":"1980","unstructured":"Toussaint, G. T.: The relative neighbourhood graph of a finite planar set. Pattern Recognition12, 261\u2013268 (1980).","journal-title":"Pattern Recognition"},{"key":"BF02239166_CR17","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0211059","volume":"11","author":"A. C. Yao","year":"1982","unstructured":"Yao, A. C.: On constructing minimum spanning trees ink-dimensional spaces and related problems. SIAM Journal on Computing11, 721\u2013736 (1982).","journal-title":"SIAM Journal on Computing"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02239166.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02239166\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02239166","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T17:13:03Z","timestamp":1557940383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02239166"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["BF02239166"],"URL":"https:\/\/doi.org\/10.1007\/bf02239166","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}