{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:07Z","timestamp":1725663307815},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540515425"},{"type":"electronic","value":"9783540482376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51542-9_38","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:07:22Z","timestamp":1330204042000},"page":"460-471","source":"Crossref","is-referenced-by-count":0,"title":["An efficient algorithm for finding all maximal square blocks in a matrix"],"prefix":"10.1007","author":[{"given":"Heinz","family":"Breu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"38_CR1","first-page":"362","volume-title":"Models for the Perception of Speech and Visual Form","author":"H. Blum","year":"1967","unstructured":"H. Blum, \u201cA transformation for extracting new descriptors of shape\u201d, in W. Wathen-Dunn, Ed., Models for the Perception of Speech and Visual Form, pp. 362\u2013280, MIT Press, Cambridge, Mass. 1967."},{"key":"38_CR2","unstructured":"A. Rosenfeld and A.C. Kak, Digital Picture Processing, Academic Press, 1982."},{"issue":"1","key":"38_CR3","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/TPAMI.1982.4767198","volume":"4","author":"T. Wakayama","year":"1982","unstructured":"T. Wakayama, \u201cA core-line tracing algorithm based on maximal square moving\u201d, IEEE Transactions on Pattern Analysis and Machine Intelligence, 4(1), pp.68\u201374, 1982.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"L.J. Guibas, Editor, \u201cProblems\u201d, Journal of Algorithms, 3, pp. 362\u2013380, 1982.","DOI":"10.1016\/0196-6774(82)90031-1"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"D. G. Kirkpatrick, \u201cEfficient computation of continuous skeletons\u201d, Proc. 20th Symposium on the Foundations of Computer Science, pp. 18\u201327, October 1979.","DOI":"10.1109\/SFCS.1979.15"},{"issue":"4","key":"38_CR6","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1109\/TPAMI.1982.4767267","volume":"4","author":"D. T. Lee","year":"1982","unstructured":"D.T. Lee, \u201cMedial axis transformation of a planar shape\u201d, IEEE Transactions on Pattern Analysis and Machine Intelligence, 4(4), pp.363\u2013369, 1982.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"38_CR7","unstructured":"H. Breu, \u201cAn efficient digital medial axis transform under the L \u221e metric\u201d, Hewlett Packard Labs Technical Report, in press, 1989."},{"issue":"2","key":"38_CR8","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"R. E. Tarjan","year":"1985","unstructured":"R.E. Tarjan, \u201cAmortized computational complexity\u201d, SIAM J. Alg. Disc. Meth., 6(2), pp. 306\u2013318, April 1985.","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"38_CR9","unstructured":"N. Ahuja and W. Hoff, \u201cAugmented medial axis transform\u201d, Seventh International Conference on Pattern Recognition, pp. 336\u2013338, 1984."},{"key":"38_CR10","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/0734-189X(86)90049-6","volume":"34","author":"A. Wu","year":"1982","unstructured":"A. Wu, S. Bhaskar, and A. Rosenfeld, \u201cComputation of geometric properties from the medial axis transform in O(n log n) time\u201d, Computer Vision, Graphics, and Image Processing, 34, pp. 76\u201392, 1982.","journal-title":"Computer Vision, Graphics, and Image Processing"},{"key":"38_CR11","first-page":"232","volume-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"M. Garey and D. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, page 232, W.H. Freeman and Company, San Francisco, 1979."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51542-9_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:21:55Z","timestamp":1605648115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51542-9_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540515425","9783540482376"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-51542-9_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}