{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:47:10Z","timestamp":1743025630157,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540674429"},{"type":"electronic","value":"9783540455912"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45591-4_24","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T05:18:03Z","timestamp":1195017483000},"page":"178-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Computing Distance Maps Efficiently Using An Optical Bus"],"prefix":"10.1007","author":[{"given":"Yi","family":"Pan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yamin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keqin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Si-Qing","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,5,25]]},"reference":[{"issue":"4","key":"24_CR1","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1142\/S0129626492000477","volume":"2","author":"T. Bossomaier","year":"1992","unstructured":"T. Bossomaier, N. Isidoro, and A. Loeff, \u201cData parallel computation of Euclidean distance transforms,\u201d Parallel Processing Letters, vol. 2, no. 4, pp. 331\u2013339, 1992.","journal-title":"Parallel Processing Letters"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0020-0190(94)00062-X","volume":"51","author":"L. Chen","year":"1994","unstructured":"L. Chen and H. Y. H. Chuang, \u201cA fast algorithm for Euclidean distance maps of a 2-D binary image,\u201d Information Processing Letters, vol. 51, pp. 25\u201329, 1994.","journal-title":"Information Processing Letters"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1016\/0167-8191(94)00103-H","volume":"21","author":"L. Chen","year":"1995","unstructured":"L. Chen and H. Y. H. Chuang, \u201cAn efficient algorithm for complete Euclidean distance transform on mesh-connected SIMD,\u201d Parallel Computing, vol. 21, pp. 841\u2013852, 1995.","journal-title":"Parallel Computing"},{"issue":"12","key":"24_CR4","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/MC.1987.1663446","volume":"20","author":"D. Chiarulli","year":"1987","unstructured":"D. Chiarulli, R. Melhem, and S. Levitan, \u201cUsing Coincident Optical Pulses for Parallel Memory Addressing,\u201d IEEE Computer, vol. 20, no. 12, pp. 48\u201358, 1987.","journal-title":"IEEE Computer"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(92)90197-4","volume":"43","author":"M.N. Kolountzakis","year":"1992","unstructured":"M.N. Kolountzakis and K.N. Kutulakos, \u201cFast computation of Euclidean distance maps for binary images,\u201d Information Processing Letters, vol. 43, pp. 181\u2013184, 1992.","journal-title":"Information Processing Letters"},{"issue":"4","key":"24_CR6","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1093\/comjnl\/32.4.362","volume":"32","author":"R. Melhem","year":"1989","unstructured":"R. Melhem, D. Chiarulli, and S. Levitan, \u201cSpace Multiplexing of Waveguides in Optically Interconnected Multiprocessor Systems,\u201d The Computer Journal, vol. 32, no. 4, pp. 362\u2013369, 1989.","journal-title":"The Computer Journal"},{"issue":"3\/4","key":"24_CR7","first-page":"237","volume":"106","author":"Y. Pan","year":"1998","unstructured":"Yi Pan and Keqin Li, \u201cLinear array with a reconfigurable pipelined bus system: concepts and applications,\u201d Special Issue on \u201cParallel and Distributed Processing\u201d of Information Sciences, vol. 106, no. 3\/4, pp. 237\u2013258, May 1998. (Also appeared in International conference on Parallel and Distributed Processing Techniques and Applications, Sunnyvale, CA, August 9\u201311, 1996, 1431\u20131442)","journal-title":"Special Issue on \u201cParallel and Distributed Processing\u201d of Information Sciences"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/01495739808947358","volume":"13","author":"Y. Pan","year":"1998","unstructured":"Y. Pan, K. Li, and S.Q. Zheng, \u201cFast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus system,\u201d Parallel Algorithms and Applications, vol. 13, pp. 1\u201325, 1998.","journal-title":"Parallel Algorithms and Applications"},{"issue":"11","key":"24_CR9","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1109\/71.642947","volume":"8","author":"S. Rajasekaran","year":"1997","unstructured":"S. Rajasekaran and S. Sahni, \u201cSorting, selection and routing on the arrays with reconfigurable optical buses,\u201d IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 11, pp. 1123\u20131132, Nov. 1997.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"J. L. Trahan, A. G. Bourgeois, Y. Pan, and R. Vaidyanathan, \u201cOptimally scaling permutation routing on reconfigurable linear arrays with optical buses,\u201d Proc. of the Second Merged IEEE Symposium IPPS\/SPDP\u2019 99, San Juan, Puerto Rico, pp. 233\u2013237, April 12\u201316, 1999.","DOI":"10.1109\/IPPS.1999.760468"},{"key":"24_CR11","unstructured":"H. Yamada, \u201cComplete Euclidean distance transformation by parallel operation,\u201d Proc. 7th International Conference on Pattern Recognition, pp. 69\u201371, 1984."}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45591-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T09:22:59Z","timestamp":1737537779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45591-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540674429","9783540455912"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45591-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"25 May 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}