{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T21:58:17Z","timestamp":1780091897951,"version":"3.54.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1016\/s0167-739x(02)00033-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:22:16Z","timestamp":1027578136000},"page":"681-692","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":32,"title":["Crystal Voronoi diagram and its applications"],"prefix":"10.1016","volume":"18","author":[{"given":"Kei","family":"Kobayashi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kokichi","family":"Sugihara","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-739X(02)00033-X_BIB1","doi-asserted-by":"crossref","unstructured":"B.F. Schaudt, R.L. Drysdale, Multiplicatively weighted crystal-growth Voronoi diagram, in: Proceedings of the Seventh Annual Symposium on Computational Geometry, North Conway, June 1991, pp. 214\u2013223.","DOI":"10.1145\/109648.109672"},{"issue":"3","key":"10.1016\/S0167-739X(02)00033-X_BIB2","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/116873.116880","article-title":"Voronoi diagrams\u2014a survey of a fundamental geometric data structure","volume":"23","author":"Aurenhammer","year":"1991","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/S0167-739X(02)00033-X_BIB3","unstructured":"A. Okabe, B. Boots, K. Sugihara, Spatial Tessellations\u2014Concepts and Applications of Voronoi Diagrams, Wiley, Chichester, UK, 1992."},{"issue":"2","key":"10.1016\/S0167-739X(02)00033-X_BIB4","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1137\/S0036144598347059","article-title":"Fast marching methods","volume":"41","author":"Sethian","year":"1999","journal-title":"SIAM Rev."},{"key":"10.1016\/S0167-739X(02)00033-X_BIB5","unstructured":"J.A. Sethian, Level Set Methods and First Marching Methods, 2nd Edition, Cambridge University Press, Cambridge, 1999."},{"key":"10.1016\/S0167-739X(02)00033-X_BIB6","unstructured":"C.A. Wang, P.Y. Tsin, Finding constrained and weighted Voronoi diagrams in the plane, in: Proceedings of the Second Canadian Conference in Computational Geometry, Ottawa, August 1990, pp. 200\u2013203."},{"key":"10.1016\/S0167-739X(02)00033-X_BIB7","unstructured":"D. Pedoe, Geometry\u2014A Comprehensive Course, Cambridge University Press, London, 1970."},{"key":"10.1016\/S0167-739X(02)00033-X_BIB8","doi-asserted-by":"crossref","unstructured":"M. Berger, B. Gostiaux, Differential Geometry\u2014Manifolds, Curves, and Surfaces, Springer, New York, 1988.","DOI":"10.1007\/978-1-4612-1033-7"},{"key":"10.1016\/S0167-739X(02)00033-X_BIB9","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1145\/321356.321357","article-title":"Sequential operations in digital picture processing","volume":"13","author":"Rosenfeld","year":"1966","journal-title":"J. ACM"},{"key":"10.1016\/S0167-739X(02)00033-X_BIB10","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(92)90197-4","article-title":"Fast computation of the Euclidean distance maps for binary images","volume":"43","author":"Kolountzalcis","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0167-739X(02)00033-X_BIB11","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0020-0190(94)00062-X","article-title":"A fast algorithm for Euclidean distance maps of a 2D binary image","volume":"51","author":"Chen","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0167-739X(02)00033-X_BIB12","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1109\/34.391389","article-title":"Linear time Euclidean distance transform algorithms","volume":"17","author":"Breu","year":"1995","journal-title":"IEEE Trans. Pattern Anal. Mach. Intel."},{"key":"10.1016\/S0167-739X(02)00033-X_BIB13","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0020-0190(96)00049-X","article-title":"A unified linear-time algorithm for computing distance maps","volume":"58","author":"Hirata","year":"1996","journal-title":"Inform. Process. Lett."}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X0200033X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X0200033X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T03:31:00Z","timestamp":1759116660000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X0200033X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0167739X0200033X"],"URL":"https:\/\/doi.org\/10.1016\/s0167-739x(02)00033-x","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Crystal Voronoi diagram and its applications","name":"articletitle","label":"Article Title"},{"value":"Future Generation Computer Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0167-739X(02)00033-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}