{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:12Z","timestamp":1725663312817},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540515425"},{"type":"electronic","value":"9783540482376"}],"license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"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":[[1989]]},"DOI":"10.1007\/3-540-51542-9_43","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:07:46Z","timestamp":1330204066000},"page":"517-528","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal hypercube algorithms for labeled images"],"prefix":"10.1007","author":[{"given":"Russ","family":"Miller","sequence":"first","affiliation":[]},{"given":"Quentin F.","family":"Stout","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"43_CR1","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01762120","volume":"3","author":"A. Aggarwal","year":"1988","unstructured":"A. Aggarwal, B. Chazelle, L. Guibas, C. O'Dunlaing, and C. Yap, \u201cParallel computational geometry\u201d, Algorithmica 3 (1988), pp. 293\u2013327.","journal-title":"Algorithmica"},{"key":"43_CR2","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1016\/0743-7315(86)90011-0","volume":"3","author":"M. J. Atallah","year":"1986","unstructured":"M.J. Atallah and M.T. Goodrich, \u201cEfficient parallel solutions to some geometric problems\u201d, J. Parallel and Distrib. Comput. 3 (1986), pp. 492\u2013507.","journal-title":"J. Parallel and Distrib. Comput."},{"key":"43_CR3","first-page":"307","volume":"32","author":"K. E. Batcher","year":"1968","unstructured":"K.E. Batcher, \u201cSorting networks and their applications\u201d, Proc. AFIPS Spring Joint Comput. Conf. 32 (1968), pp. 307\u2013314.","journal-title":"Proc. AFIPS Spring Joint Comput. Conf."},{"key":"43_CR4","unstructured":"G. Blelloch, \u201cScans as primitive parallel operations\u201d Proc. 1987 Int'l. Conf. Parallel Proc., pp. 355\u2013362."},{"key":"43_CR5","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(85)90008-X","volume":"30","author":"A. Borodin","year":"1985","unstructured":"A. Borodin and J.E. Hopcroft, \u201cRouting, merging and sorting on parallel models of computation\u201d, J. Comp. and Sys. Sci. 30 (1985), pp. 130\u2013145.","journal-title":"J. Comp. and Sys. Sci."},{"key":"43_CR6","unstructured":"R. Cypher and J.L.C. Sanz, \u201cData reduction and fast routing: a strategy for efficient algorithms for message-passing parallel computers\u201d, Algorithmica, to appear."},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"R. Cypher, J.L.C. Sanz, and L. Snyder, \u201cHypercube and shuffle-exchange algorithms for image component labeling\u201d, Proc. Comp. Arch. Pat. Anal. and Mach. Intel. '87, pp. 5\u201310.","DOI":"10.1016\/0196-6774(89)90028-X"},{"key":"43_CR8","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1109\/34.21794","volume":"11","author":"R. Cypher","year":"1989","unstructured":"R. Cypher, J.L.C. Sanz, and L. Snyder, \u201cEREW PRAM and Mesh Connected computer algorithms for image component labeling\u201d, IEEE Trans. Pat. Anal. and Machine Intel., 11 (1989), pp. 258\u2013262.","journal-title":"IEEE Trans. Pat. Anal. and Machine Intel."},{"key":"43_CR9","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1145\/360881.360919","volume":"18","author":"H. Freeman","year":"1975","unstructured":"H. Freeman and R. Shapira, \u201cDetermining the minimal-area encasing rectangle for an arbitrary closed curve\u201d, Comm. ACM 18 (1975), pp. 409\u2013413.","journal-title":"Comm. ACM"},{"key":"43_CR10","unstructured":"A.E. Kayaalp and R. Jain, \u201cParallel implementation of an algorithm for three-dimensional reconstruction of integrated circuit pattern topography using the scanning electron microscope stereo technique on the NCUBE\u201d, Hypercube Multiprocessors 1987, pp. 438\u2013444."},{"key":"43_CR11","unstructured":"C.P. Kruskal, L. Rudolf, and M. Snir, The power of parallel prefix, Proc. 1985 Intl. Conf. Parallel Proc., pp. 180\u2013185."},{"key":"43_CR12","unstructured":"W. Lim, A. Agrawal, and L. Nekludova, \u201cA fast parallel algorithm for labeling connected components in image arrays\u201d, Tech. report NA86-2, Thinking Machines Corp., 1986."},{"key":"43_CR13","doi-asserted-by":"crossref","unstructured":"R. Miller and Q.F. Stout, \u201cSome graph and image processing algorithms for the hypercube\u201d, Hypercube Multiprocessors 1987, pp. 418\u2013425.","DOI":"10.1117\/12.947060"},{"key":"43_CR14","doi-asserted-by":"crossref","first-page":"1605","DOI":"10.1109\/12.9737","volume":"37","author":"R. Miller","year":"1988","unstructured":"R. Miller and Q.F. Stout, \u201cEfficient parallel convex hull algorithms\u201d, IEEE Trans. Computers 37 (1988), pp. 1605\u20131618.","journal-title":"IEEE Trans. Computers"},{"key":"43_CR15","unstructured":"R. Miller and Q.F. Stout, Parallel Algorithms for Regular Architectures, The MIT Press, 1989."},{"key":"43_CR16","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0743-7315(87)90009-8","volume":"4","author":"T. N. Mudge","year":"1987","unstructured":"T.N. Mudge and T.S. Abdel-Rahman, \u201cVision algorithms for hypercube machines\u201d, J. Parallel and Distrib. Comp. 4 (1987), pp. 79\u201394.","journal-title":"J. Parallel and Distrib. Comp."},{"key":"43_CR17","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1145\/322326.322329","volume":"29","author":"D. Nassimi","year":"1982","unstructured":"D. Nassimi and S. Sahni, \u201cParallel permutations and sorting algorithms and a new generalized connection network\u201d, J. ACM 29 (1982), pp. 642\u2013667.","journal-title":"J. ACM"},{"key":"43_CR18","doi-asserted-by":"crossref","unstructured":"F.P. Preparata, and M.I. Shamos, Computational Geometry, Springer-Verlag, 1985.","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"43_CR19","unstructured":"S. Ranka and S. Sahni, \u201cImage template matching on SIMD hypercube multicomputers\u201d, Proc. 1988 Intl. Conf. Parallel Proc., pp. 84\u201391."},{"key":"43_CR20","volume-title":"Combinatorial Algorithms","author":"E. M. Reingold","year":"1977","unstructured":"E.M. Reingold, J. Nievergelt, and N. Deo, Combinatorial Algorithms, Prentice Hall, New York, 1977."},{"key":"43_CR21","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","volume":"3","author":"Y. Shiloach","year":"1982","unstructured":"Y. Shiloach and U. Vishkin, \u201cAn O(logn) parallel connectivity algorithm\u201d, J. Algorithms 3 (1982), pp. 57\u201367.","journal-title":"J. Algorithms"},{"key":"43_CR22","doi-asserted-by":"crossref","unstructured":"Q.F. Stout, \u201cHypercubes and pyramids\u201d, Pyramidal Systems for Computer Vision, V.Cantoni and S. Levialdi, eds., Springer-Verlag, 1986, pp. 75\u201389.","DOI":"10.1007\/978-3-642-82940-6_5"},{"key":"43_CR23","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1137\/0204030","volume":"4","author":"L. G. Valiant","year":"1975","unstructured":"L.G. Valiant, \u201cParallelism in comparison problems\u201d, SIAM J. Comput. 4 (1975), pp. 151\u2013162.","journal-title":"SIAM J. Comput."},{"key":"43_CR24","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1137\/0211027","volume":"11","author":"L. G. Valiant","year":"1982","unstructured":"L.G. Valiant, \u201cA scheme for fast parallel communication\u201d, SIAM J. Comput. 11 (1982), pp. 350\u2013361.","journal-title":"SIAM J. Comput."},{"key":"43_CR25","unstructured":"K. Voss and R. Klette, \u201cOn the maximum number of edges of convex digital polygons included into a square\u201d, Friedrich-Schiller-Universitat Jena, Forschungsergegnisse, no. N\/82\/6."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51542-9_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T02:57:07Z","timestamp":1640919427000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51542-9_43"}},"subtitle":["Preliminary version"],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540515425","9783540482376"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-51542-9_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]},"assertion":[{"value":"26 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}