{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:46Z","timestamp":1742617186503,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540581840"},{"type":"electronic","value":"9783540484776"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58184-7_96","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:28:02Z","timestamp":1330270082000},"page":"134-145","source":"Crossref","is-referenced-by-count":3,"title":["Time-optimal nearest-neighbor computations on enhanced meshes"],"prefix":"10.1007","author":[{"given":"Stephan","family":"Olariu","sequence":"first","affiliation":[]},{"given":"Ivan","family":"Stojmenovi\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/TC.1986.1676658","volume":"C-35","author":"A. Aggarwal","year":"1986","unstructured":"A. Aggarwal, Optimal bounds for finding maximum on array of processots with k global buses, IEEE Transactions on Computers, C-35 (1986) 62\u201364.","journal-title":"IEEE Transactions on Computers"},{"key":"12_CR2","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1016\/0196-6774(86)90028-3","volume":"7","author":"A. Aggarwal","year":"1986","unstructured":"A. Aggarwal and R. C. Melville, Fast computation of the modality of polygons, Journal of Algorithms, 7 (1986) 369\u2013381.","journal-title":"Journal of Algorithms"},{"key":"12_CR3","volume-title":"Highly parallel computing","author":"G. S. Almasi","year":"1994","unstructured":"G. S. Almasi and A. Gottlieb, Highly parallel computing, Second Edition, Benjamin\/Cummings, Redwood City, California, 1994.","edition":"Second Edition"},{"key":"12_CR4","volume-title":"Computer Vision","author":"D. H. Ballard","year":"1982","unstructured":"D. H. Ballard and C. M. Brown, Computer Vision, Prentice-Hall, Englewood Cliffs, New Jersey, 1982."},{"key":"12_CR5","unstructured":"D. Bhagavathi, P. J. Looges, S. Olariu, J. L. Schwing, and J. Zhang, A fast selection algorithm on meshes with multiple broadcasting, Proc. International Conference on Parallel Processing, 1992, St-Charles, Illinois, III-10\u201317."},{"key":"12_CR6","unstructured":"D. Bhagavathi, S. Olariu, W. Shen, and L. Wilson, A Time-optimal multiple search algorithm on enhanced meshes, with applications, Proc. Fourth Canadian Computational Geometry Conference, St-Johns, August 1992, 359\u2013364."},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1142\/S0129626492000386","volume":"2","author":"D. Bhagavathi","year":"1992","unstructured":"D. Bhagavathi, S. Olariu, J. L. Schwing, W. Shen, L. Wilson, and J. Zhang, Convexity problems on meshes with multiple broadcasting, Parallel Processing Letters, 2 (1992) 249\u2013256.","journal-title":"Parallel Processing Letters"},{"key":"12_CR8","first-page":"561","volume":"694","author":"D. Bhagavathi","year":"1993","unstructured":"D. Bhagavathi, S. Olariu, W. Shen, and L. Wilson, A unifying look at semigroup computations on meshes with multiple broadcasting, Proc. PARLE'93, Munich, Germany, June 1993, LNCS 694, 561\u2013570.","journal-title":"LNCS"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"D. Bhagavathi, V. Bokka, H. Gurla, S. Olariu, I. Stojmenovi\u0107, J. Schwing, and J. Zhang, Time-optimal solution to visibility-related problems on meshes with multiple broadcasting, Proc. of ASAP'93, Venice, Italy, October 1993, 226\u2013237.","DOI":"10.1109\/ASAP.1993.397147"},{"key":"12_CR10","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1109\/TC.1984.1676405","volume":"C-33","author":"S. H. Bokhari","year":"1984","unstructured":"S. H. Bokhari, Finding maximum on an array processor with a global bus, IEEE Transactions on Computers C-33 (1984) 133\u2013139.","journal-title":"IEEE Transactions on Computers"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF01758749","volume":"7","author":"R. Cole","year":"1992","unstructured":"R. Cole and M. T. Goodrich, Optimal parallel algorithms for point-set and polygon problems, Algorithmica, 7 (1992), 3\u201323.","journal-title":"Algorithmica"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1137\/0215006","volume":"15","author":"S. A. Cook","year":"1986","unstructured":"S. A. Cook, C. Dwork, and R. Reischuk, Upper and lower time bounds for parallel random access machines without simultaneous writes, SIAM Journal on Computing, 15 (1986) 87\u201397.","journal-title":"SIAM Journal on Computing"},{"key":"12_CR13","volume-title":"Pattern Classification and Scene Analysis","author":"R. O. Duda","year":"1973","unstructured":"R. O. Duda and P. E. Hart, Pattern Classification and Scene Analysis, Wiley and Sons, New York, 1973."},{"key":"12_CR14","volume-title":"An introduction to parallel algorithms","author":"J. J\u00e1J\u00e1","year":"1992","unstructured":"J. J\u00e1J\u00e1, An introduction to parallel algorithms, Addison-Wesley, Reading, MA, 1992."},{"key":"12_CR15","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0743-7315(87)90003-7","volume":"2","author":"V. P. Kumar","year":"1987","unstructured":"V. P. Kumar and C. S. Raghavendra, Array processor with multiple broadcasting, Journal of Parallel and Distributed Computing, 2, (1987) 173\u2013190.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1109\/34.42857","volume":"11","author":"V. P. Kumar","year":"1989","unstructured":"V. P. Kumar and D. I. Reisis, Image computations on meshes with multiple broadcast, IEEE Transactions on Pattern Analysis and Machine Intelligence, 11, (1989) 1194\u20131201.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1109\/12.29479","volume":"C-38","author":"H. Li","year":"1989","unstructured":"H. Li and M. Maresca, Polymorphic-torus network, IEEE Transactions on Computers, C-38, (1989) 1345\u20131351.","journal-title":"IEEE Transactions on Computers"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1142\/S0129626493000095","volume":"3","author":"R. Lin","year":"1993","unstructured":"R. Lin, S. Olariu, J. L. Schwing, and J. Zhang, Simulating enhanced meshes, with applications, Parallel Processing Letters, 3 (1993) 59\u201370.","journal-title":"Parallel Processing Letters"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/0743-7315(89)90022-1","volume":"7","author":"M. Maresca","year":"1989","unstructured":"M. Maresca and H. Li, Connection autonomy and SIMD computers: a VLSI implementation, Journal of Parallel and Distributed Computing, 7, (1989) 302\u2013320.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0020-0190(89)90081-1","volume":"7","author":"S. Olariu","year":"1989","unstructured":"S. Olariu, A simple linear-time algorithm for computing the RNG and MST of unimodal polygons, Information Processing Letters 7, (1989), 243\u2013247.","journal-title":"Information Processing Letters"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0020-0190(88)90226-8","volume":"29","author":"S. Olariu","year":"1988","unstructured":"S. Olariu, On the unimodality of convex polygons, Information Processing Letters, 29 (1988) 289\u2013292.","journal-title":"Information Processing Letters"},{"key":"12_CR22","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0898-1221(92)90154-A","volume":"24","author":"S. Olariu","year":"1992","unstructured":"S. Olariu, The morphology of convex polygons, Computers and Mathematics, with Applications, 24, (1992), 59\u201368.","journal-title":"Computers and Mathematics, with Applications"},{"key":"12_CR23","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/BF01990523","volume":"33","author":"S. Olariu","year":"1993","unstructured":"S. Olariu, J. L. Schwing, and J. Zhang, Optimal convex hull algorithms on enhanced meshes, BIT 33 (1993), 396\u2013410.","journal-title":"BIT"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"S. Olariu and I. Stojmenovi\u0107, Time-optimal proximity problems on meshes with multiple broadcasting, Proc. International Parallel Processing Symposium, Cancun, Mexico, 1994, to appear.","DOI":"10.1109\/IPPS.1994.288314"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"D. Parkinson, D. J. Hunt, and K. S. MacQueen, The AMT DAP 500, 33rd IEEE Comp. Soc. International Conf., 1988, 196\u2013199.","DOI":"10.1109\/CMPCON.1988.4858"},{"key":"12_CR26","volume-title":"Computational Geometry \u2014 An Introduction","author":"F. P. Preparata","year":"1988","unstructured":"F. P. Preparata and M. I. Shamos, Computational Geometry \u2014 An Introduction, Springer-Verlag, Berlin, 1988."},{"key":"12_CR27","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1145\/2402.322386","volume":"30","author":"K. J. Supowit","year":"1983","unstructured":"K. J. Supowit, the relative neighborhood graph with an application to minimum spanning trees, J. ACM 30 (1983) 428\u2013448.","journal-title":"J. ACM"},{"key":"12_CR28","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"12","author":"G. T. Toussaint","year":"1980","unstructured":"G. T. Toussaint, The relative neighborhood graph of a finite planar set, Pattern Recognition 12 (1980) 261\u2013268.","journal-title":"Pattern Recognition"},{"key":"12_CR29","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/BF00979872","volume":"13","author":"G. T. Toussaint","year":"1984","unstructured":"G. T. Toussaint, Complexity, convexity and unimodality, International J. Comput. Information Sciences 13, (1984), 197\u2013217.","journal-title":"International J. Comput. Information Sciences"},{"key":"12_CR30","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1016\/0898-1221(83)90139-6","volume":"9","author":"G. T. Toussaint","year":"1983","unstructured":"G. T. Toussaint, The symmetric all-furthest neighbor problem, Computers and Mathematics with Applications, 9 (1983), 747\u2013754.","journal-title":"Computers and Mathematics with Applications"}],"container-title":["Lecture Notes in Computer Science","PARLE'94 Parallel Architectures and Languages Europe"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58184-7_96.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:22:35Z","timestamp":1742595755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58184-7_96"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540581840","9783540484776"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-58184-7_96","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}