
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
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. 545554, June, 1996.  
BibTex  x  
@article{ 10.1109/71.506693, author = {Dharmavani Bhagavathi and Himabindu Gurla and Stephan Olariu and James L. Schwing and Jingyuan Zhang}, title = {Square Meshes Are Not Optimal for Convex Hull Computation}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {7}, number = {6}, issn = {10459219}, year = {1996}, pages = {545554}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.506693}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Square Meshes Are Not Optimal for Convex Hull Computation IS  6 SN  10459219 SP545 EP554 EPD  545554 A1  Dharmavani Bhagavathi, A1  Himabindu Gurla, A1  Stephan Olariu, A1  James L. Schwing, A1  Jingyuan Zhang, PY  1996 KW  Convex hulls KW  meshes with broadcasting KW  parallel algorithms KW  pattern recognition KW  image processing KW  computational geometry. VL  7 JA  IEEE Transactions on Parallel and Distributed Systems ER   
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
The fastest previouslyknown algorithms on a square mesh of size
[1] A. Aggarwal, "Optimal Bounds for Finding Maximum on Array of Processors with k Global Buses," IEEE Trans. Computers, vol. 35, pp. 6264, 1986.
[2] M.J. Atallah and M.T. Goodrich, "Parallel Algorithms for Some Functions of Two Convex Polygons," Algorithmica, vol. 3, pp. 535548, 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. BarNoy and D. Peleg, "Square Meshes Are Not Always Optimal," IEEE Trans. Computers, vol. 40, pp. 196204, 1991
[6] K.E. Batcher, "Design of Massively Parallel Processor," IEEE Trans. Computers, vol. 29, pp. 836840, 1980.
[7] D. Bhagavathi, H. Gurla, S. Olariu, J.L. Schwing, and I. Stojmenovic, "TimeOptimal VisibilityRelated Algorithms on Meshes with Multiple Broadcasting," IEEE Trans. Parallel and Distributed Systems, vol. 6, pp. 687703, 1995.
[8] D. Bhagavathi, H. Gurla, R. Lin, S. Olariu, J.L. Schwing, and J. Zhang, "Timeand VLSIOptimal Sorting on Meshes with Multiple Broadcasting," Proc. Int'l Conf. Parallel Processing, vol. III, pp. 196201,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. 772778, 1994.
[10] D. Bhagavathi, S. Olariu, W. Shen, and L. Wilson, "A TimeOptimal Multiple Search Algorithm on Enhanced Meshes, with Applications," J. Parallel and Distributed Computing, vol. 22, pp. 113120, 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. 249256, 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. 142156, 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. 561569,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. 133139, 1984.
[15] V. Bokka, H. Gurla, S. Olariu, and J.L. Schwing, "A Time and VLSIOptimal Convex Hull Algorithm for Meshes with Multiple Broadcasting," Proc. Fifth Symp. Frontiers of Massively Parallel Computation, pp. 506513,Fairfax, Va., Feb. 1995.
[16] R. Cahn, R. Poulsen, and G. Toussaint, "Segmentation of Cervical Cell Images," J. Histochemistry and Cytochemistry, vol. 25, pp. 681688, 1977.
[17] B. Chazelle, "Computational Geometry on the Systolic Chip," IEEE Trans. Computers, vol. 33, pp. 774785, 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. 241246, 1990.
[19] Y.C. Chen, W.T. Chen, and G.H. Chen, "TwoVariable Linear Programming on Mesh Connected Computers with Multiple Broadcasting," Proc. Int'l Conf. Parallel Processing, vol. III, pp. 270273,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.BerlinHeidelberg: SpringerVerlag, 1985.
[22] H. Gurla, "Leftmost One Computation on Meshes with Row Broadcasting," Information Processing Letters, vol. 47, pp. 261266, 1993.
[23] J.A. Holey and O. Ibarra, "Iterative Algorithms for Planar Convex Hull on MeshConnected Arrays," Proc. Int'l Conf. Parallel Processing, vol. III, pp. 147150,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. 173190, 1987.
[25] V. PrasannaKumar and D.I. Reisis, "Image Computations on Meshes with Multiple Broadcast," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, pp. 1,1941,201, 1989.
[26] J.P. Laumond, "Obstacle Growing in a NonPolygonal World," Information Processing Letters, vol. 25, pp. 4150, 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,“Polymorphictorus network,” IEEE Trans. on Computers, vol. 38, no. 9, pp. 13451351, Sept. 1989.
[29] R. Lin, S. Olariu, and J.L. Schwing, "An Efficient VLSI Architecture for Digital Geometry," Proc. IEEE Conf. ApplicationSpecific Array Processors, pp. 392403, Aug. 1994.
[30] T. LozanoPerez, "Spatial Planning: A Configurational Space Approach," IEEE Trans. Computers, vol. 32, pp. 108119, 1983
[31] M. Maresca, "Polymorphic Processor Arrays," IEEE Trans. Parallel and Distributed Systems, vol. 4, pp. 490506, 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,6051,618, 1988.
[34] R. Miller and Q.F. Stout, "Mesh Computer Algorithms for Computational Geometry," IEEE Transactions on Computers, vol. 38, no. 3, pp. 321340, Mar. 1989.
[35] D. Nassimi and S. Sahni, "Finding Connected Components and Connected Ones on a MeshConnected Parallel Computer," SIAM J. Computing, vol. 9, pp. 744757, 1980.
[36] S. Olariu, J.L. Schwing, and J. Zhang, "Optimal Convex Hull Algorithms on Enhanced Meshes," BIT, vol. 33, pp. 396410, 1993.
[37] S. Olariu and I. Stojmenovic, "TimeOptimal Proximity Algorithms on Meshes with Multiple Broadcasting," Proc. Eighth Int'l Parallel Processing Symp., pp. 94101,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. 196199 1988.
[39] F.P. Preparata and M.I. Shamos, Computational Geometry. SpringerVerlag, 1985.
[40] G.T. Toussaint ed., Computational Geometry. NorthHolland, Amsterdam: Elsevier Science, 1985.
[41] G.T. Toussaint, "Movable Separability of Sets," Computational Geometry, G.T. Toussaint, ed. NorthHolland, Amsterdam: Elsevier Science, 1985.
[42] J. Ullman, Computational Aspects of VLSI.Potomac, Md.: Computer Science Press, 1984.