{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T20:36:35Z","timestamp":1760819795610},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1990,6]]},"DOI":"10.1007\/bf01840383","type":"journal-article","created":{"date-parts":[[2005,6,28]],"date-time":"2005-06-28T22:41:35Z","timestamp":1119998495000},"page":"155-177","source":"Crossref","is-referenced-by-count":32,"title":["Parallel geometric algorithms on a mesh-connected computer"],"prefix":"10.1007","volume":"5","author":[{"given":"C. S.","family":"Jeong","sequence":"first","affiliation":[]},{"given":"D. T.","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01840383_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, A., Chazelle, B., Guibas, L., \u00d3'D\u00fanlaing, C., and Yap, C., Parallel computational geometry,Proc. 26th IEEE Symposium on Foundations of Computer Science, 1985, 468\u2013477.","DOI":"10.1109\/SFCS.1985.42"},{"key":"BF01840383_CR2","series-title":"Computer Science Tech. Report CSD-TR-563","volume-title":"Efficient plane sweeping in parallel","author":"M. J. Atallah","year":"1986","unstructured":"Atallah, M. J., and Goodrich, M. T., Efficient plane sweeping in parallel, Computer Science Tech. Report CSD-TR-563, Purdue University, Lafayette, IN, March 1986."},{"key":"BF01840383_CR3","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1016\/0743-7315(86)90011-0","volume":"3","author":"M. J. Atallah","year":"1986","unstructured":"Atallah, M. J., and Goodrich, M. T., Efficient parallel solutions to some geometric problems,J. Parallel Dislrib. Comput.,3, 1986, 492\u2013507.","journal-title":"J. Parallel Dislrib. Comput."},{"key":"BF01840383_CR4","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1145\/828.322449","volume":"31","author":"M. J. Atallah","year":"1984","unstructured":"Atallah, M. J., and Kosaraju, S. R., Graph problems on a mesh-connected processor array,J. Assoc. Comput. Mach.,31, 1984, 649\u2013667.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01840383_CR5","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0020-0190(79)90074-7","volume":"9","author":"K. Q. Brown","year":"1979","unstructured":"Brown, K. Q., Voronoi diagrams from convex hulls,Inform. Process. Lett.,9, 1979, 223\u2013328.","journal-title":"Inform. Process. Lett."},{"key":"BF01840383_CR6","doi-asserted-by":"crossref","unstructured":"Chazelle, B., Intersecting is easier than sorting,Proc. 16th ACM Symp. Theory of Computing, 1984, 125\u2013134.","DOI":"10.1145\/800057.808674"},{"key":"BF01840383_CR7","volume-title":"Ph.D dissertation","author":"A. L. Chow","year":"1980","unstructured":"Chow, A. L., Parallel algorithms for geometric problems, Ph.D dissertation, Dept. of Computer Science, University of Illinois, Urbana, IL, 1980."},{"key":"BF01840383_CR8","first-page":"254","volume":"32","author":"D. S. Hirschberg","year":"1983","unstructured":"Hirschberg, D. S., and Kumar, M., An efficient implementation of Batcher's odd-even merge algorithm and its application in parallel sorting schemes,IEEE Trans. Comput.,32, 1983, 254\u2013264.","journal-title":"IEEE Trans. Comput."},{"key":"BF01840383_CR9","series-title":"Tech. Report 87-02-FC-01","volume-title":"Parallel geometric algorithms on a mesh connected computer","author":"C. S. Jeong","year":"1987","unstructured":"Jeong, C. S., and Lee, D. T., Parallel geometric algorithms on a mesh connected computer, Tech. Report 87-02-FC-01 (revised), Dept. EE\/CS, Northwestern University, Evanston, IL, 1987."},{"key":"BF01840383_CR10","unstructured":"Jeong, C. S., and Lee, D. T., Parallel convex hull algorithms in 2- and 3-dimensions on mesh-connected computers,Proc. Int. Conf. on Parallel Processing for Computer Vision and Display, 1988, Leeds, UK."},{"key":"BF01840383_CR11","series-title":"Tech. Report 80-11-FC-04","volume-title":"Farthest neighbor Voronoi diagrams and applications","author":"D. T. Lee","year":"1980","unstructured":"Lee, D. T., Farthest neighbor Voronoi diagrams and applications, Tech. Report 80-11-FC-04, Dept. EE\/CS, Northwestern University, Evanston, IL, 1980."},{"key":"BF01840383_CR12","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/322217.322219","volume":"27","author":"D. T. Lee","year":"1980","unstructured":"Lee, D. T., Two-dimensional Voronoi diagrams in theL p -metric,J. Assoc. Comput. Mech.,27, 1980, 604\u2013618.","journal-title":"J. Assoc. Comput. Mech."},{"key":"BF01840383_CR13","unstructured":"Lu, M., Construction of the Voronoi diagram on a mesh-connected computer,Proc. 1986 Int. Conf. on Parallel Processing, 1986, 806\u2013811."},{"key":"BF01840383_CR14","unstructured":"Miller, R., and Stout, Q. F., Computational geometry on a mesh-connected computer,Proc. 1984 Int. Conf. on Parallel Processing, 1984, 66\u201373."},{"key":"BF01840383_CR15","series-title":"Tech. Report 86-18","volume-title":"Mesh computer algorithms for computational geometry","author":"R. Miller","year":"1986","unstructured":"Miller, R., and Stout, Q. F., Mesh computer algorithms for computational geometry, Tech. Report 86-18, Dept. of Computer Science, State University of New York at Buffalo, NY, 1986."},{"key":"BF01840383_CR16","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TC.1979.1675216","volume":"28","author":"D. Nassimi","year":"1979","unstructured":"Nassimi, D., and Sahni, S., Bitonic sort on a mesh-connected computer,IEEE Trans. Comput.,28, 1979, 2\u20137.","journal-title":"IEEE Trans. Comput."},{"key":"BF01840383_CR17","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1137\/0209058","volume":"9","author":"D. Nassimi","year":"1980","unstructured":"Nassimi, D., and Sahni, S., Finding connected components and connected ones on a mesh-connected parallel computer,SIAM J. Comput.,9, 1980, 744\u2013757.","journal-title":"SIAM J. Comput."},{"key":"BF01840383_CR18","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/TC.1981.6312172","volume":"30","author":"D. Nassimi","year":"1981","unstructured":"Nassimi, D., and Sahni, S., Data broadcasting in SIMD computers,IEEE Trans. Comput.,30, 1981, 101\u2013106.","journal-title":"IEEE Trans. Comput."},{"key":"BF01840383_CR19","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1145\/322169.322172","volume":"27","author":"D. Nassimi","year":"1980","unstructured":"Nassimi, D., and Sahni, S., An optimal routing algorithm for mesh-connected parallel computer,J. Assoc. Comput. Mach.,27, 1980, 6\u201329.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01840383_CR20","doi-asserted-by":"crossref","unstructured":"Shamos, M. I., and Howy, D., Closest point problems,Proc. 16th Symp. on Foundations of Computer Science, 1975, 152\u2013162.","DOI":"10.1109\/SFCS.1975.8"},{"key":"BF01840383_CR21","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1145\/359461.359481","volume":"20","author":"C. D. Thompson","year":"1977","unstructured":"Thompson, C. D., and Kung, H. T., Sorting on a mesh-connected parallel computer,Comm. ACM,20, 1977, 263\u2013271.","journal-title":"Comm. ACM"},{"key":"BF01840383_CR22","unstructured":"Yap, C. K., Private communication."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840383.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01840383\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840383","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T01:38:50Z","timestamp":1586309930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01840383"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":22,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["BF01840383"],"URL":"https:\/\/doi.org\/10.1007\/bf01840383","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}