{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T13:53:27Z","timestamp":1648907607562},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":["Image and Vision Computing"],"published-print":{"date-parts":[[1997,1]]},"DOI":"10.1016\/s0262-8856(96)01111-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:19:26Z","timestamp":1027621166000},"page":"35-45","source":"Crossref","is-referenced-by-count":3,"title":["An efficient algorithm for the largest empty figure problem based on a 2D cellular automaton architecture"],"prefix":"10.1016","volume":"15","author":[{"given":"P.","family":"Tzionas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Thanailakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ph.","family":"Tsalides","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0262-8856(96)01111-0_BIB1","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/116873.116880","article-title":"Voronoi Diagrams \u2014 a survey of a fundamental geometric data structure","volume":"23","author":"Aurenhammer","year":"1991","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/S0262-8856(96)01111-0_BIB2","series-title":"Proc. 16th Annual IEEE Sympoisium on FOCS","first-page":"151","article-title":"Closest-point problems","author":"Shamos","year":"1975"},{"key":"10.1016\/S0262-8856(96)01111-0_BIB3","series-title":"Proc. 1st Annual ACM Symposium on Computational Geometry","first-page":"235","article-title":"Voronoi diagrams based on Convex Distance Functions","author":"Chew","year":"1985"},{"key":"10.1016\/S0262-8856(96)01111-0_BIB4","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/0215022","article-title":"Computing the largest empty rectangle","volume":"15","author":"Chazelle","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0262-8856(96)01111-0_BIB5","series-title":"Proc. 3rd Annual ACM Symposium on Computational Geometry","first-page":"278","article-title":"Fast algorithms for computing the largest empty rectangle","author":"Aggarwal","year":"1987"},{"key":"10.1016\/S0262-8856(96)01111-0_BIB6","series-title":"Proc. 6th Annual ACM Symposium on Computational Geometry","first-page":"225","article-title":"Maximum location of convex objects in a polygon and related dynamic Voronoi diagrams","author":"Aonuma","year":"1990"},{"issue":"4","key":"10.1016\/S0262-8856(96)01111-0_BIB7","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0020-0190(84)90116-9","article-title":"A fast Voronoi diagram algorithm with quarternary tree bucketing","volume":"18","author":"Ohya","year":"1984","journal-title":"Inform. Processing Lett."},{"key":"10.1016\/S0262-8856(96)01111-0_BIB8","article-title":"Computational geometry algorithms","volume":"Vol. 4","author":"Asano","year":"1986"},{"key":"10.1016\/S0262-8856(96)01111-0_BIB9","series-title":"Spatial Tesselations: Concepts and Applications of Voronoi Diagrams","author":"Okabe","year":"1992"},{"key":"10.1016\/S0262-8856(96)01111-0_BIB10","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/S0262-8856(96)01111-0_BIB11","first-page":"281","article-title":"Voronoi diagrams based on general metrics in the plane","author":"Klein","year":"1988","journal-title":"Springer LNCS 294"},{"key":"10.1016\/S0262-8856(96)01111-0_BIB12","series-title":"Automata Theory: An Engineering Approach","author":"Aleksander","year":"1975"},{"key":"10.1016\/S0262-8856(96)01111-0_BIB13","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1103\/RevModPhys.55.601","article-title":"Statistical mechanics of cellular automata","volume":"55","author":"Wolfram","year":"1983","journal-title":"Rev. Mod. Phys."},{"key":"10.1016\/S0262-8856(96)01111-0_BIB14","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1109\/TC.1986.1676709","article-title":"Group properties of cellular automata and VLSI applications","volume":"C35","author":"Pries","year":"1986","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/S0262-8856(96)01111-0_BIB15","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1007\/BF01010423","article-title":"Two dimensional cellular automata","volume":"38","author":"Packard","year":"1985","journal-title":"J. Stat. Physics"},{"key":"10.1016\/S0262-8856(96)01111-0_BIB16","first-page":"367","article-title":"Attractors, basin structures and information processing in cellular automata","volume":"vol. 1","author":"Kaneko","year":"1986"},{"issue":"10","key":"10.1016\/S0262-8856(96)01111-0_BIB17","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1109\/TSMC.1976.4309418","article-title":"A technique to identify nearest neighbors","volume":"SMC-6","author":"Yunck","year":"1976","journal-title":"IEEE Trans. Systems, Man, and Cybernetics"},{"key":"10.1016\/S0262-8856(96)01111-0_BIB18","series-title":"Proc. IEEE Int. Conference on Robotics and Automation","first-page":"1732","article-title":"Path-planning using a Jacobian based free space generation algorithm","author":"Paden","year":"1989"},{"issue":"3","key":"10.1016\/S0262-8856(96)01111-0_BIB19","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1145\/136035.136037","article-title":"Gross motion planning 3- a survey","volume":"24","author":"Hwang","year":"1992","journal-title":"ACM Computing Surveys"},{"issue":"7","key":"10.1016\/S0262-8856(96)01111-0_BIB20","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/12.237718","article-title":"Numerical accuracy and hardware tradeoffs for CORDIC arithmetic for special-purpose processors","volume":"42","author":"Kota","year":"1993","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/S0262-8856(96)01111-0_BIB21","doi-asserted-by":"crossref","unstructured":"P. Tzionas, Ph. Tsalides and A. Thanailakis, A parallel skeletonization algorithm based on 2-dimensional cellular automata and its VLSI implementation, J. Real-Time Imaging (in press).","DOI":"10.1006\/rtim.1995.1011"}],"container-title":["Image and Vision Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0262885696011110?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0262885696011110?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T23:26:40Z","timestamp":1556062000000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0262885696011110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["S0262885696011110"],"URL":"https:\/\/doi.org\/10.1016\/s0262-8856(96)01111-0","relation":{},"ISSN":["0262-8856"],"issn-type":[{"value":"0262-8856","type":"print"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}