Abstract
In this paper we propose time-optimal convex hull algorithms for two classes of enhanced meshes. Our first algorithm computes the convex hull of an arbitrary set ofn points in the plane inO (logn) time on a mesh with multiple broadcasting of sizen×n. The second algorithm shows that the same problem can be solved inO (1) time on a reconfigurable mesh of sizen×n. Both algorithms achieve time lower bounds for their respective model of computation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles and news from researchers in related subjects, suggested using machine learning.References
A. Aggarwal,Optimal bounds for finding maximum on array of processors with k global buses, IEEE Trans. on Computers, C-35, 1986, 62–64.
M. Atallah and S. R. Kosaraju,Graph problems on a mesh-connected processor array, Journal of the ACM, 31, (1984), 649–667.
S. H. Bokhari,Finding maximum on an array processor with a global bus, IEEE Trans. on Computers vol. C-33, no. 2, Feb. 1984. 433–139.
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–97.
V. K. P. Kumar and D. I. Reisis,Image computation on meshes with multiple broadcast, IEEE Trans. on Pattern Analysis and Machine Intelligence, vol 11, no. 11, 1989, 1194–1201.
F. Thomson Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann Publishers, San Mateo, California, 1992.
H. Li and M. Maresca,Polymorphic-torus network, IEEE Transactions on Computers vol. C-38, no. 9, (1989) 1345–1351.
R. Lin, S. Olariu, J. L. Schwing, and J. Zhang,Sorting in O(1) time on a reconfigurable mesh of size N × N, Parallel Computing: From Theory to Sound Practice, Proceedings of EWPC'92, Plenary Address, IOS Press, 1992, 16–27.
R. Lin, S. Olariu, J. L. Schwing, and J. Zhang,Simulating enhanced meshes, with applications, Parallel Processing Letters, to appear.
M. Maresca and H. Li,Connection autonomy and SIMD computers: a VLSI implementation, Journal of Parallel and Distributed Computing, vol. 7 (1989) 302–320.
R. Miller, V. K. P. Kumar, D. Reisis, and Q. F. Stout,Meshes with reconfigurable buses, Proceedings of the Fifth MIT Conference on Advanced Research in VLSI, (1988) 163–178.
D. Nassimi and S. Sahni,Finding connected components and connected ones on a mesh-connected parallel computer, SIAM Journal on Computing, 9 (1980), 744–757.
S. Olariu, J. L. Schwing, and J. Zhang,Fundamental data movement for reconfigurable meshes, Proc. International Phoenix Conference on Computers and Communications, Scottsdale, Arizona, 1992, 472–479.
V. P. Kumar and C. S. Raghavendra,Array processor with multiple broadcasting, Journal of Parallel and Distributed Processing, 4, (1987) 173–190.
D. Parkinson, D. J. Hunt, and K. S. MacQueen,The AMT DAP 500, Proc. 3-rd IEEE Comp. Soc. International Conf., Feb. 1988, 196–199.
F. P. Preparata and M. I. Shamos,Computational Geometry, An Introduction, Springer-Verlag, New York, Berlin, 1988.
J. Rothstein,Bus automata, brains, and mental models, IEEE Trans. on Systems Man Cybernetics 18, (1988).
H. S. Stone,High-Performance Computer Architecture, Second, Edition, Addison-Wesley, Reading, MA, 1990.
Author information
Authors and Affiliations
Additional information
This work was supported by NASA under grant NCCI-99.
Additional support by the National Science Foundation under grant CCR-8909996 is gratefully acknowledged.
Rights and permissions
About this article
Cite this article
Olariu, S., Schwing, J.L. & Zhang, J. Optimal convex hull algorithms on enhanced meshes. BIT 33, 396–410 (1993). https://doi.org/10.1007/BF01990523
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01990523