{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:50:58Z","timestamp":1773481858299,"version":"3.50.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"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":8143,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1991,4]]},"DOI":"10.1016\/0166-218x(91)90069-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"181-191","source":"Crossref","is-referenced-by-count":9,"title":["Constructing the relative neighborhood graph in 3-dimensional Euclidean space"],"prefix":"10.1016","volume":"31","author":[{"given":"Jerzy W.","family":"Jaromczyk","sequence":"first","affiliation":[]},{"given":"Miros\u0142aw","family":"Kowaluk","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(91)90069-9_BIB1","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0196-6774(88)90035-1","article-title":"Improved algorithms for discs and balls using power diagrams","volume":"9","author":"Aurenhammer","year":"1988","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(91)90069-9_BIB2","series-title":"Tech. Rept. SOCS-86.21","article-title":"Repeated distances in space","author":"Avis","year":"1986"},{"key":"10.1016\/0166-218X(91)90069-9_BIB3","series-title":"Extremal Graph Theory","author":"Bollobas","year":"1978"},{"key":"10.1016\/0166-218X(91)90069-9_BIB4","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02187721","article-title":"Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs","volume":"4","author":"Chung","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0166-218X(91)90069-9_BIB5","first-page":"568","article-title":"Combinatorial complexity bounds for arrangements of curves and surfaces","author":"Clarkson","year":"1989","journal-title":"Proceedings 29th Annual Symposium on Foundations of Computer Science"},{"key":"10.1016\/0166-218X(91)90069-9_BIB6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02187681","article-title":"Voronoi diagrams and arrangements","volume":"1","author":"Edelsbrunner","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0166-218X(91)90069-9_BIB7","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0031-3203(85)90040-8","article-title":"The relative neighborhood graph for mixed feature variables","volume":"18","author":"Ichino","year":"1985","journal-title":"Pattern Recognition"},{"key":"10.1016\/0166-218X(91)90069-9_BIB8","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1137\/0214006","article-title":"Voronoi Diagram in the Laguerre geometry and its applications","volume":"14","author":"Imai","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(91)90069-9_BIB9","series-title":"Proceedings 3rd Annual Symposium on Computational Geometry","first-page":"233","article-title":"A note on relative neighborhood graphs","author":"Jaromczyk","year":"1987"},{"key":"10.1016\/0166-218X(91)90069-9_BIB10","unstructured":"J.W. Jaromczyk, M. Kowaluk and F. Yao, an optimal algorithm for constructing \u03b2-skeletons in Lp metric, SIAM J. Comput., to appear."},{"key":"10.1016\/0166-218X(91)90069-9_BIB11","series-title":"Rept. A46","article-title":"Bucketing and filtering in computational geometry","author":"Katajainen","year":"1987"},{"key":"10.1016\/0166-218X(91)90069-9_BIB12","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02187683","article-title":"On the union of Jordan Region and collision-free translational motion amidst polygonal obstacles","volume":"1","author":"Kedem","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0166-218X(91)90069-9_BIB13","series-title":"Computational Geometry","first-page":"217","article-title":"A framework for computational morphology","author":"Kirpatrick","year":"1985"},{"key":"10.1016\/0166-218X(91)90069-9_BIB14","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1111\/j.1538-4632.1969.tb00615.x","article-title":"Regionalization: theory and alternative algorithms","volume":"1","author":"Lankford","year":"1969","journal-title":"Geogr. Anal."},{"key":"10.1016\/0166-218X(91)90069-9_BIB15","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0031-3203(85)90023-8","article-title":"Relative neighborhood graphs in the L1-metric","volume":"18","author":"Lee","year":"1985","journal-title":"Pattern Recognition"},{"key":"10.1016\/0166-218X(91)90069-9_BIB16","first-page":"45","article-title":"Computing the relative neighborhood graph in the L1 and L\u221e metrics","volume":"8","author":"O'Rourke","year":"1982","journal-title":"Pattern Recognition"},{"key":"10.1016\/0166-218X(91)90069-9_BIB17","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\/0166-218X(91)90069-9_BIB18","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\/0166-218X(91)90069-9_BIB19","first-page":"1","author":"Toussaint","year":"1980","journal-title":"Pattern recognition and geometric complexity"},{"key":"10.1016\/0166-218X(91)90069-9_BIB20","first-page":"721","article-title":"On constructing minimum spanning trees in k-dimensional spaces and related problems","volume":"11","author":"Yao","year":"1982","journal-title":"SIAM J. Discrete Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X91900699?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X91900699?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:58:33Z","timestamp":1555135113000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X91900699"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["0166218X91900699"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(91)90069-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,4]]}}}