Mesh Computer Algorithms for Computational Geometry

IEEE Transactions on Computers

Volumn 38, Issue 3, 1989, Pages 321-340

  Miller, Russ ^a   Stout, Quentin F ^b  

^a UNIVERSITY AT BUFFALO   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Area; computational geometry; convexity; intersection; mesh computer; parallel algorithms; planar point data; proximity

Indexed keywords

MATHEMATICAL TECHNIQUES--GEOMETRY;

COMPUTATIONAL GEOMETRY; CONVEX FIGURES; HYPERPLANES; MESH COMPUTER; PARALLEL ALGORITHMS;

COMPUTER PROGRAMMING;

EID: 0024629058     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.21120     Document Type: Article

References (44)

1. A. Aggarwal, B. Chazelle, L. Guibas, C. O'Dunlaing, and C. Yap, “Parallel computational geometry,” in Proc. 1985 Symp. Foundations Comput. Sci., pp. 468–477.
2. S. Akl, “Parallel algorithms for convex hulls,” Dep. Comput. Sci., Queens Univ., Kingston Ont., Canada, 1983.
3. M.J. Atallah and M.T. Goodrich, “Efficient parallel solutions to some geometric problems,' J. Parallel Disthbut. Comput., vol. 3, pp. 492–507, 1986.
4. M.J. Atallah and S.R. Kosaraju, “Graph problems on a meshconnected processor array,” J. ACM, vol. 31, pp. 649–667, 1984.
5. M.J. Atallah and S.E. Hambrusch, “Solving tree problems on a meshconnected processor array,” in Proc. 26th Symp. Foundations Comput. Sci., 1985, pp. 222–231.
6. D. Avis, “On the complexity of finding the convex hull of a set of points,” Tech. Rep. FOCS 79.2, School of Comput. Sci., McGill Univ., 1979.
7. G.H. Barnes, R.M. Brown, M. Kato, D.J. Kuck, D.L. Slotnick, and R.A. Stokes, “The ILLIAC IV Computer,” IEEE Trans. Comput., vol. C-17, pp. 746–757, 1968.
8. K.E. Batcher, “Design of a massively parallel processor,” IEEE Trans. Comput., vol. 29, pp. 836–840, 1981.
9. J.L. Bentley, B.W. Weide, and A.C. Yao, “Optimal expected-time algorithms for closest point problems,” in Proc. Allerton Conf., 1978.
10. J.L. Bentley and T.A. Ottman, “Algorithms for counting and reporting geometric intersections,” IEEE Trans. Comput., vol. 28, pp. 643–647, 1979.
11. J.L. Bentley, “Multidimensional divide-and-conquer,” Commun. ACM, vol. 23, pp. 214–229, 1980.
12. B. Chazelle, “Computational geometry on a systolic chip,” IEEE Trans. Comput., vol. C-33, pp. 774–785, 1984.
13. A. Chow, “A parallel algorithm for determining convex hulls of sets of points in two dimensions,” in Proc. 19th Allerton Conf. Commun., Contr., Comput., 1981, pp. 214–233.
14. F. Dehne, “O(n1/2) algorithms for the maximal elements and ECDF searching problem on a meshconnected parallel computer,” Inform. Proc. Lett., vol. 22, pp. 303–306, 1986.
15. M.L.B. Duff and D.M. Watson, “The cellular logic array image processor,” Comput. J., vol. 20, pp. 68–72, 1977.
16. C.R. Dyer and A. Rosenfeld, “Parallel image processing by memory augmented cellular automata,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-3, pp. 29–41, 1981.
17. H. Freeman and R. Shapira, “Determining the minimal-area encasing rectangle for an arbitrary closed curve,” Commun. ACM, vol. 18, pp. 409–413, 1975.
18. S.I. Gass, Linear Programming. New York: McGraw-Hill, 1969.
19. F.C.A. Groen, P.W. Verbeek, N. d. Jong, and J.W. Klumper, “The smallest box around a package,” Tech. Rep. Instit. Appl. Phy., Delft Univ. of Technology.
20. K. Hwang and K-s. Fu, “Integrated computer architectures for image processing and database management,” IEEE Computer, vol. 15, pp. 51–60, 1982.
21. C.S. Jeong and D.T. Lee, “Parallel geometric algorithms on a mesh connected computer,” Tech. Rep. 87–02-FC-01 (revised), Dep. EECS, Noithwestern Univ.
22. R.J. Lipton and R.E. Tarjan, “Applications of a planar separator theorem,” in Proc. 18th Annu. IEEE Symp. Foundations Comput. Sci., 1977, pp. 162–170.
23. M. Lu, “Constructing the Voronoi diagram on a meshconnected computer,” in Proc. 1985 Int. Conf. Parallel Processing, pp. 806–811.
24. M. Lu and P. Varman, “Solving geometric proximity problems on meshconnected computers,” in Proc. 1985 Workshop Comput. Architecture Pattern Anal. Image Database Management, pp. 248–255.
25. E.M. McCreight, “Priority search trees,” Tech. Rep. Xerox PARCL CSL-81–5, 1981.
26. C.A. Mead and L. Conway, Introduction to VLSI Systems. Reading, MA: Addision-Wesley, 1979.
27. R. Miller and Q.F. Stout, “Computational geometry on a meshconnected computer,” in Proc. 1984 Int. Conf Parallel Processing, pp. 66–73.
28. R. Miller, “Geometric algorithms for digitized pictures on a meshconnected computer,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-7, pp. 216–228, 1985.
29. R. Miller, “Varying diameter and problem size in meshconnected computers,” in Proc. 1985 Int. Conf. Parallel Processing, pp. 697–699.
30. R. Miller, Parallel Algorithms for Regular Architectures. Cambridge, MA: MIT Press, to be published.
31. D. Nassimi and S. Sahni, “Data broadcasting in SIMD computers,” IEEE Trans. Comput., vol. C-30, pp. 101–107, 1981.
32. D. Nath, S.N. Maheshwari, and P.C.P. Bhatt, “Parallel algorithms for the convex hull in two dimensions,” in Proc. Conf. Anal. Problem Classes Programming Parallel Comput., 1981, pp. 358–372.
33. J. O'Rourke, C.-B. Chen, T. Olson, and D. Naddor, “A new linear algorithm for intersecting convex polygons,” Comput. Graph. Image Processing, vol. 19, pp. 384–391, 1982.
34. F.P. Preparata and D.T. Lee, “Computational geometry-A survey,” IEEE Trans. Comput., C-33, pp. 1072–1100, 1984.
35. F.P. Preparata and M.I. Shamos, Computational Geometry. New York: Springer-Verlag, 1985.
36. J. Reif and Q.F. Stout, “Optimal component labeling algorithms for mesh computers and VLSI,” to be published.
37. M.I. Shamos, “Computational geometry,” Ph.D. dissertation, Yale Univ., 1978.
38. M.I. Shamos and D. Hoey, “Geometric intersection problems,” in Proc. Seventh Annu. IEEE Symp. Foundations Comput. Sci., 1975, pp. 151–162.
39. Q.F. Stout, “Broadcasting in meshconnected computers,” in Proc. 1982 Conf. Inform. Sci. Sys., Princeton Univ., pp. 85–90.
40. Q.F. Stout, “Topological matching,” in Proc. 15th ACM Symp. Theory of Computing, 1983, pp. 24–31.
41. Q.F. Stout, Tree-based graph algorithms for some parallel computers,” in Proc. 1985 Int. Conf Parallel Processing, pp. 727–730.
42. C.D. Thompson and H.T. Kung, “Sorting on a meshconnected parallel computer,” Commun. ACM, vol. 20, pp. 263–271, 1977.
43. G.T. Toussaint, “Pattern recognition and geometrical complexity,” in Proc. 5th Int. Conf. Pattern Recognition, 1980, pp. 1324–1347.
44. A. Yao, “Alower bound to finding convex hulls,” Dep. Comput. Sci., Stanford Univ., 1979.