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

Volumn 9, Issue 12, 1998, Pages 1167-1179

  Hayashi, Tatsuya ^a,b   Nakano, Koji ^a,b   Olariu, Stephan ^a,c  

^a IEEE   (United States)

^b NAGOYA INSTITUTE OF TECHNOLOGY   (Japan)

^c ECS Building   (United States)

Author keywords

Convex hulls; Image processing; Mobile computing; Morphology; Pattern recognition; Reconfigurable meshes

Indexed keywords

CELLULAR NEURAL NETWORKS; IMAGE PROCESSING; PATTERN RECOGNITION; ROBOTICS;

CONVEX-HULL-BASED ALGORITHMS;

ALGORITHMS;

EID: 0032309886     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.737694     Document Type: Article

References (31)

1. S.G. Akl and K.A. Lyons, Parallel Computational Geometry. Englewood Cliffs, N.J.: Prentice Hall, 1993.
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. D.H. Ballard and C.M. Brown, Computer Vision. Englewood Cliffs, N.J.: Prentice Hall, 1982.
4. Y. Ben-Asher, D. Peleg, R. Ramaswani, and A. Schuster, "The Power of Reconfiguration," J. Parallel and Distributed Computing, vol. 13, pp. 139-153, 1991.
5. V. Bokka, H. Gurla, S. Olariu, and J.L. Schwing, "Constant-Time Convexity Problems on Reconfigurable Meshes," J. Parallel and Distributed Computing, vol. 27, pp. 86-99, 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 Mesh-Connected Arrays," Proc. Int'l Conf. Parallel Processing, vol. III, pp. 147-150, 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 Non-Polygonal World," Information Processing Letters, vol. 25, pp. 41-50, 1987.
10. H. Li and M. Maresca, "Polymorphic-Torus Network," IEEE Trans. Computers, vol. 38, pp. 1,345-1,351, 1989.
11. R. Lin and S. Olariu, "Reconfigurable Buses with Shift Switching - Concepts and Applications," IEEE Trans. Parallel and Distributed Systems, vol. 6, pp. 93-102, 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. 465-476, 1994.
13. T. Lozano-Perez, "Spatial Planning: A Configurational Space Approach," IEEE Trans. Computers, vol. 32, pp. 108-119, 1983.
14. M. Maresca, "Polymorphic Processor Arrays," IEEE Trans. Parallel and Distributed Systems, vol. 4, pp. 490-506, 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. 282-289, St. Charles, Ill., 1993.
16. R. Miller, V.K. Prasanna, D. Reisis, and Q.F. Stout, "Parallel Computations on Reconfigurable Meshes," IEEE Trans. Computers, vol. 42, pp. 678-692, 1993.
17. R. Miller and Q.F. Stout, "Efficient Parallel Convex Hull Algorithms," IEEE Trans. Computers, vol. 37, pp. 1,605-1,618, 1988.
18. K. Nakano, "A Bibliography of Published Papers on Dynamically Reconfigurable Architectures," Parallel Processing Letters, vol. 5, pp. 111-124, 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. 243-250, 1996.
20. K. Nakano and S. Olariu, "An Efficient Algorithm for Row Minima Computations in Basic Reconfigurable Meshes," IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 6, pp. 561-569, June 1998.
21. The conference version of this paper appeared in Proc. Int'l Conf. Parallel Processing, vol. II, pp. 54-61, 1996.
22. S. Olariu, J.L. Schwing, and J. Zhang, "Time-Optimal Convex Hull Algorithms on Enhanced Meshes," BIT, vol. 33, pp. 396-410, 1993.
23. 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. 447-455, 1993.
24. S. Olariu, J.L. Schwing, and J. Zhang, "Fundamental Algorithms on Reconfigurable Meshes," Proc. 29th Allerton Conf. Comm., Control, and Computing, pp. 811-820, 1991.
25. F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction. Berlin: Springer-Verlag, 1985.
26. T.S. Rappaport, Wireless Communications. Prentice Hall, 1996.
27. J. Rothstein, "Bus Automata, Brains, and Mental Models," IEEE Trans. Systems, Man, and Cybernetics, vol. 18, pp. 522-531, 1988.
28. 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.
29. Computational Geometry, G.T. Toussaint ed. North-Holland, Amsterdam: Elsevier Science Publishers, 1985.
30. G.T. Toussaint, "Movable Separability of Sets," Computational Geometry. North-Holland, Amsterdam: Elsevier Science Publishers, 1985.
31. 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. 251-282, 1989.