
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Tatsuya Hayashi, Koji Nakano, Stephan Olariu, "An O((log log n)2) Time Algorithm to Compute the Convex Hull of Sorted Points on Reconfigurable Meshes," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 12, pp. 11671179, December, 1998.  
BibTex  x  
@article{ 10.1109/71.737694, author = {Tatsuya Hayashi and Koji Nakano and Stephan Olariu}, title = {An O((log log n)2) Time Algorithm to Compute the Convex Hull of Sorted Points on Reconfigurable Meshes}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {9}, number = {12}, issn = {10459219}, year = {1998}, pages = {11671179}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.737694}, 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  An O((log log n)2) Time Algorithm to Compute the Convex Hull of Sorted Points on Reconfigurable Meshes IS  12 SN  10459219 SP1167 EP1179 EPD  11671179 A1  Tatsuya Hayashi, A1  Koji Nakano, A1  Stephan Olariu, PY  1998 KW  Convex hulls KW  reconfigurable meshes KW  pattern recognition KW  morphology KW  image processing KW  mobile computing. VL  9 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—The problem of computing the convex hull of a set of
[1] S.G. Akl and K.A. Lyons, Parallel Computational Geometry, Prentice Hall, Englewood Cliffs, N.J., 1993.
[2] M.J. Atallah and M.T. Goodrich, "Parallel Algorithms for Some Functions of Two Convex Polygons," Algorithmica, vol. 3, pp. 535548, 1988.
[3] D.H. Ballard and C.M. Brown, Computer Vision, Prentice Hall, Upper Saddle River, N.J., 1982.
[4] Y. BenAsher,D. Peleg,R. Ramaswami,, and A. Schuster,“The power of reconfiguration,” J. of Parallel and Distributed Computing, vol. 13, no. 2, pp. 139153, Oct. 1991.
[5] V. Bokka, H. Gurla, S. Olariu, and J.L. Schwing, "Constant Time Convexity Problems on Dense Reconfigurable Meshes," J. Parallel and Distributed Computing, vol. 27, pp. 8699, 1995.
[6] R.O. Duda and P.E. Hart, Pattern Classification and Scene Analysis.New York: Wiley and Sons, 1973.
[7] 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.
[8] J. Jang, M. Nigam, V.K. Prasanna, and S. Sahni, “Constant Time Algorithms for Computational Geometry on the Reconfigurable Mesh,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 1, pp. 1–12, Jan. 1997.
[9] J.P. Laumond, "Obstacle Growing in a NonPolygonal World," Information Processing Letters, vol. 25, pp. 4150, 1987.
[10] H. Li and M. Maresca,“Polymorphictorus network,” IEEE Trans. on Computers, vol. 38, no. 9, pp. 13451351, Sept. 1989.
[11] R. Lin and S. Olariu, "Reconfigurable Buses with Shift Switching: Concepts and Applications," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 1, pp. 93102, Jan. 1995.
[12] R. Lin, S. Olariu, J.L. Schwing, and J. Zhang, "Computing on Reconfigurable Buses—A New Computational Paradigm," Parallel Processing Letters, vol. 4, pp. 465476, 1994.
[13] T. LozanoPerez, "Spatial Planning: A Configurational Space Approach," IEEE Trans. Computers, vol. 32, pp. 108119, 1983.
[14] M. Maresca, "Polymorphic Processor Arrays," IEEE Trans. Parallel and Distributed Systems, vol. 4, pp. 490506, 1993.
[15] M. Maresca, H. Li, and P. Baglietto, "Hardware Support for Fast Reconfigurability in Processor Arrays," Proc. Int'l Conf. Parallel Processing, vol. I, pp. 282289,St. Charles, Ill., 1993.
[16] R. Miller,V.K. Prasanna Kumar,D.I. Reisis, and Q.F. Stout,“Parallel computations on reconfigurable meshes,” IEEE Trans. on Computers, pp. 678692, June 1993.
[17] R. Miller and Q.F. Stout,“Efficient parallel convex hull algorithms,” IEEE Trans. Computers, vol. 37, no. 12, pp. 1,6051,618, 1988.
[18] K. Nakano, "A Bibliography of Published Papers on Dynamically Reconfigurable Architectures," Parallel Processing Letters, vol. 5, pp. 111124, 1995.
[19] K. Nakano, "Computing the Convex Hull of a Sorted Set of Points on a Reconfigurable Mesh," Parallel Algorithms and Applications, vol. 8, pp. 243250, 1996.
[20] K. Nakano and S. Olariu, “An Efficient Algorithm for Row Minima Computations on Basic Recofigurable Meshes,” IEEE Trans. Parallel and Distributed Systems, vol. 9, pp. 561569, 1998.
[21] S. Olariu, J.L. Schwing, and J. Zhang, "TimeOptimal Convex Hull Algorithms on Enhanced Meshes," BIT, vol. 33, pp. 396410, 1993.
[22] S. Olariu, J.L. Schwing, and J. Zhang, "Fast Component Labeling and Convex Hull Computation on Reconfigurable Meshes," Image and Vision Computing J., vol. 11, pp. 447455, 1993.
[23] S. Olariu, J.L. Schwing, and J. Zhang, "Fundamental Algorithms on Reconfigurable Meshes," Proc. 29th Allerton Conf. Comm., Control, and Computing, pp. 811820, 1991.
[24] F.P. Preparata and M.I. Shamos, Computational Geometry. SpringerVerlag, 1985.
[25] T.S. Rappaport, Wireless Communications: Principles&Practice. Prentice Hall, 1996.
[26] J. Rothstein,“Bus Automata, Brains, and Mental Models,” IEEE Trans. on Systems, Man, and Cybernetics, vol. 18, no. 4, pp. 522531, Apr. 1988.
[27] D.B. Shu and J.G. Nash, "The Gated Interconnection Network for Dynamic Programming," Concurrent Computations, S.K. Tewsburg et al., eds., Plenum Publishing, 1988.
[28] Computational Geometry, G.T. Toussaint ed. NorthHolland, Amsterdam: Elsevier Science Publishers, 1985.
[29] G.T. Toussaint, "Movable Separability of Sets," Computational Geometry. NorthHolland, Amsterdam: Elsevier Science Publishers, 1985.
[30] C.C. Weems, S.P. Levitan, A.R. Hanson, E.M. Riseman, J.G. Nash, and D.B. Sheu, "The Image Understanding Architecture," Int'l J. Computer Vision, vol. 2, pp. 251282, 1989.