This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Square Meshes Are Not Optimal for Convex Hull Computation
June 1996 (vol. 7 no. 6)
pp. 545-554

Abstract—Recently it has been noticed that for semigroup computations and for selection rectangular meshes with multiple broadcasting yield faster algorithms than their square counterparts. The contribution of this paper is to provide yet another example of a fundamental problem for which this phenomenon occurs. Specifically, we show that the problem of computing the convex hull of a set of n sorted points in the plane can be solved in ${\rm O}(n^{{\textstyle{1 \over 8}}}\, {\rm log}^{{\textstyle{3 \over 4}}}\,n)$ time on a rectangular mesh with multiple broadcasting of size

$$n^{{\textstyle{3 \over 8}}}\,{\rm log}^{{\textstyle{1 \over 4}}}\,n\times {\textstyle{{n^{{ \textstyle{5 \over 8}}}} \over {{\rm log}^{{\textstyle{1 \over 4}}}\,n}}}.$$

The fastest previously-known algorithms on a square mesh of size $\sqrt n\times \sqrt n$ run in ${\rm O}(n^{{\textstyle{1 \over 6}}})$ time in case the n points are pixels in a binary image, and in ${\rm O}(n^{{\textstyle{1 \over 6}}}\,{\rm log}^{{\textstyle{2 \over 3}}}\,n).$ time for sorted points in the plane.

[1] A. Aggarwal, "Optimal Bounds for Finding Maximum on Array of Processors with k Global Buses," IEEE Trans. Computers, vol. 35, pp. 62-64, 1986.
[2] M.J. Atallah and M.T. Goodrich, "Parallel Algorithms for Some Functions of Two Convex Polygons," Algorithmica, vol. 3, pp. 535-548, 1988.
[3] S.G. Akl and K.A. Lyons, Parallel Computational Geometry, Prentice Hall, Englewood Cliffs, N.J., 1993.
[4] D.H. Ballard and C.M. Brown, Computer Vision, Prentice Hall, Upper Saddle River, N.J., 1982.
[5] A. Bar-Noy and D. Peleg, "Square Meshes Are Not Always Optimal," IEEE Trans. Computers, vol. 40, pp. 196-204, 1991
[6] K.E. Batcher, "Design of Massively Parallel Processor," IEEE Trans. Computers, vol. 29, pp. 836-840, 1980.
[7] D. Bhagavathi, H. Gurla, S. Olariu, J.L. Schwing, and I. Stojmenovic, "Time-Optimal Visibility-Related Algorithms on Meshes with Multiple Broadcasting," IEEE Trans. Parallel and Distributed Systems, vol. 6, pp. 687-703, 1995.
[8] D. Bhagavathi, H. Gurla, R. Lin, S. Olariu, J.L. Schwing, and J. Zhang, "Time-and VLSI-Optimal Sorting on Meshes with Multiple Broadcasting," Proc. Int'l Conf. Parallel Processing, vol. III, pp. 196-201,St. Charles, Ill., Aug. 1993.
[9] D. Bhagavathi, P.J. Looges, S. Olariu, J.L. Schwing, and J. Zhang, "A Fast Selection Algorithm on Meshes with Multiple Broadcasting," IEEE Trans. Parallel and Distributed Systems, vol. 5, pp. 772-778, 1994.
[10] D. Bhagavathi, S. Olariu, W. Shen, and L. Wilson, "A Time-Optimal Multiple Search Algorithm on Enhanced Meshes, with Applications," J. Parallel and Distributed Computing, vol. 22, pp. 113-120, 1994.
[11] D. Bhagavathi, S. Olariu, J.L. Schwing, and J. Zhang, "Convex Polygon Problems on Meshes with Multiple Broadcasting," Parallel Processing Letters, vol. 2, pp. 249-256, 1992.
[12] D. Bhagavathi, S. Olariu, J.L. Schwing, W. Shen, L. Wilson, and J. Zhang, "Convexity Problems on Meshes with Multiple Broadcasting," J. Parallel and Distributed Computing, vol. 27, pp. 142-156, 1995.
[13] D. Bhagavathi, S. Olariu, W. Shen, and L. Wilson, "A Unifying Look at Semigroup Computations on Meshes with Multiple Broadcasting," Proc. Parallel Architectures and Languages Europe, LNCS 694, pp. 561-569,München, Germany, June 1993.
[14] S.H. Bokhari, "Finding Maximum on an Array Processor with a Global Bus," IEEE Trans. Computers, vol. 33, pp. 133-139, 1984.
[15] V. Bokka, H. Gurla, S. Olariu, and J.L. Schwing, "A Time- and VLSI-Optimal Convex Hull Algorithm for Meshes with Multiple Broadcasting," Proc. Fifth Symp. Frontiers of Massively Parallel Computation, pp. 506-513,Fairfax, Va., Feb. 1995.
[16] R. Cahn, R. Poulsen, and G. Toussaint, "Segmentation of Cervical Cell Images," J. Histochemistry and Cytochemistry, vol. 25, pp. 681-688, 1977.
[17] B. Chazelle, "Computational Geometry on the Systolic Chip," IEEE Trans. Computers, vol. 33, pp. 774-785, 1984.
[18] Y.C. Chen, W.T. Chen, G.H. Chen, and J.P. Sheu, "Designing Efficient Parallel Algorithms on Mesh Connected Computers with Multiple Broadcasting," IEEE Trans. Parallel and Distributed Systems, vol. 1, pp. 241-246, 1990.
[19] Y.C. Chen, W.T. Chen, and G.H. Chen, "Two-Variable Linear Programming on Mesh Connected Computers with Multiple Broadcasting," Proc. Int'l Conf. Parallel Processing, vol. III, pp. 270-273,St. Charles, Ill., 1990.
[20] R.O. Duda and P.E. Hart, Pattern Classification and Scene Analysis.New York: Wiley and Sons, 1973.
[21] H. Freeman and G. Pieroni eds., Computer Architecture for Spatially Distributed Data.Berlin-Heidelberg: Springer-Verlag, 1985.
[22] H. Gurla, "Leftmost One Computation on Meshes with Row Broadcasting," Information Processing Letters, vol. 47, pp. 261-266, 1993.
[23] J.A. Holey and O. Ibarra, "Iterative Algorithms for Planar Convex Hull on Mesh-Connected Arrays," Proc. Int'l Conf. Parallel Processing, vol. III, pp. 147-150,St. Charles, Ill., Aug. 1990.
[24] V.K. Prasanna Kumar, and C.S. Raghavendra,“Array processor with multiple broadcasting,” J. of Parallel and Distributed Computing, vol. 4, pp. 173-190, 1987.
[25] V. Prasanna-Kumar and D.I. Reisis, "Image Computations on Meshes with Multiple Broadcast," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, pp. 1,194-1,201, 1989.
[26] J.-P. Laumond, "Obstacle Growing in a Non-Polygonal World," Information Processing Letters, vol. 25, pp. 41-50, 1987.
[27] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[28] H. Li and M. Maresca,“Polymorphic-torus network,” IEEE Trans. on Computers, vol. 38, no. 9, pp. 1345-1351, Sept. 1989.
[29] R. Lin, S. Olariu, and J.L. Schwing, "An Efficient VLSI Architecture for Digital Geometry," Proc. IEEE Conf. Application-Specific Array Processors, pp. 392-403, Aug. 1994.
[30] T. Lozano-Perez, "Spatial Planning: A Configurational Space Approach," IEEE Trans. Computers, vol. 32, pp. 108-119, 1983
[31] M. Maresca, "Polymorphic Processor Arrays," IEEE Trans. Parallel and Distributed Systems, vol. 4, pp. 490-506, 1993.
[32] M. Maresca and H. Li,“Connection autonomy in SIMD computers: a VLSI implementation,”J. Parallel Distribut. Comput., vol. 7, pp. 302–320, 1989.
[33] R. Miller and Q.F. Stout,“Efficient parallel convex hull algorithms,” IEEE Trans. Computers, vol. 37, no. 12, pp. 1,605-1,618, 1988.
[34] R. Miller and Q.F. Stout, "Mesh Computer Algorithms for Computational Geometry," IEEE Transactions on Computers, vol. 38, no. 3, pp. 321-340, Mar. 1989.
[35] D. Nassimi and S. Sahni, "Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer," SIAM J. Computing, vol. 9, pp. 744-757, 1980.
[36] S. Olariu, J.L. Schwing, and J. Zhang, "Optimal Convex Hull Algorithms on Enhanced Meshes," BIT, vol. 33, pp. 396-410, 1993.
[37] S. Olariu and I. Stojmenovic, "Time-Optimal Proximity Algorithms on Meshes with Multiple Broadcasting," Proc. Eighth Int'l Parallel Processing Symp., pp. 94-101,Cancun, Mexico, Apr. 1994.
[38] D. Parkinson, D.J. Hunt, and K.S. MacQueen, "The AMT DAP 500," Proc. 33rd IEEE CS Int'l Conf., pp. 196-199 1988.
[39] F.P. Preparata and M.I. Shamos, Computational Geometry. Springer-Verlag, 1985.
[40] G.T. Toussaint ed., Computational Geometry. North-Holland, Amsterdam: Elsevier Science, 1985.
[41] G.T. Toussaint, "Movable Separability of Sets," Computational Geometry, G.T. Toussaint, ed. North-Holland, Amsterdam: Elsevier Science, 1985.
[42] J. Ullman, Computational Aspects of VLSI.Potomac, Md.: Computer Science Press, 1984.

Index Terms:
Convex hulls, meshes with broadcasting, parallel algorithms, pattern recognition, image processing, computational geometry.
Citation:
Dharmavani Bhagavathi, Himabindu Gurla, Stephan Olariu, James L. Schwing, Jingyuan Zhang, "Square Meshes Are Not Optimal for Convex Hull Computation," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 6, pp. 545-554, June 1996, doi:10.1109/71.506693
Usage of this product signifies your acceptance of the Terms of Use.