Advertisement

A survey of parallel computational geometry algorithms

  • Frank Dehne
  • Jörg-Rüdiger Sack
Invited Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 342)

Abstract

We survey computational geometry algorithms developed for various models of parallel computation including the PRAM, hypercube, mesh-of-processors, linear processor array, mesh of trees, and pyramid.

Keywords

Convex Hull Parallel Algorithm Voronoi Diagram Computational Geometry Neighbor Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ACGDY85]
    Aggarwal, A., B. Chazelle, L. Guibas, C. O. Dunlaing, and C. Yap, "Parallel computational geometry", Proc. IEEE Symp. on Found. of Computer Science, Portland, Oregon, Oct. 1985, pp. 468–477Google Scholar
  2. [A82]
    Akl, S., "A constant-time parallel algorithm for computing convex hulls", BIT 22, 1982, pp. 130–134Google Scholar
  3. [A84]
    Akl, S., "Optimal parallel algorithms for computing convex hulls and for sorting", Computing 33,1 11, 1984, pp. 1–11Google Scholar
  4. [AG85]
    Atallah, M. J. and M. T. Goodrich, "Efficient parallel solutions to geometric problems", Proc. 1985 Int'l Conference on Parallel Processing, Aug. 20–23, 1985, pp. 411–417Google Scholar
  5. [AG86a]
    Atallah, M. J. and M. T. Goodrich, "Efficient plane sweeping in parallel (Preliminary Version)", Proc. Second ACM SIGGRAPH Symposium on Computational Geometry, Yorktown Heights, NY, June 2–4, 1986, pp. 216–225Google Scholar
  6. [AG86b]
    Atallah, M. J. and M. T. Goodrich, "Parallel algorithms for some functions of two convex polygons", Proc. 24th Allerton Conference on Comm., Control and Comput., Monticello, Ill., Oct. 1–3, 1986, pp.758–767Google Scholar
  7. [AU87]
    Asano, T. and H. Umeo, "Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region", Proc. Int'l Workshop on Parallel Algorithms and Architectures, Suhi, GDR, May 25–30, 1987, pp.77–85Google Scholar
  8. [AE86]
    Avis, D. and H. ElGindy, "Triangulating simplicial points set in space: extended abstract", Proc. ACM Symp. on Computational Geometry, York Town Heights, 1986, pp. 133–142Google Scholar
  9. [BM87]
    Boxer, L., R. Miller, "Parallel dynamic computational geometry", Tech. Rep. 87-11, Dept. of Computer Science, SUNY at Buffalo, Buffalo, NY, Aug. 1987Google Scholar
  10. [C84]
    Chazelle, B. M., "Computational geometry on a systolic chip", IEEE Trans. on Computers, Vol. C-33, No. 9, Sept. 1984, pp.774–785Google Scholar
  11. [CCL87]
    Chen, G.H., M.-S. Chern, and R.C.T. Lee, "A new systolic architecture for convex hull and half-plane intersection problems", BIT 27, 1987, pp. 141–147Google Scholar
  12. [C81]
    Chow, A., "Parallel algorithms for geometric problems", PhD. thesis, Dept. of Computer Science, Univ. of Illinois, Urbana-Champaign, 1980Google Scholar
  13. [CM81]
    Chazelle, B. M., L. M. Monier, "A model of computation for VLSI with related complexity results", Proc. 13th ACM Symp. on Theory of Comp., 1981Google Scholar
  14. [DK87]
    Dadoun, N., D. G. Kirkpatrick, "Parallel processing for efficient subdivision search", Proc. Third ACM SIGGRAPH Symposium on Computational Geometry, Waterloo, 1987, pp. 205–214Google Scholar
  15. [D85b]
    Dehne, F., "Solving geometric problems on mesh-connected and one-dimensional processor arrays", Proc. 11th Int'l Workshop on Graph-theoretic Concepts in Computer Science (WG'85), June 18–21, 1985, Schloß Schwanberg, Würzburg, W.-Germany, Trauner Verlag 1985, pp. 43–59Google Scholar
  16. [D85c]
    Dehne, F., "A one dimensional systolic array for the largest empty rectangle problem", Proc. 23rd Annual Allerton Conference on Comm., Control and Comput., Monticello, Ill., Oct. 2–4, 1985, pp. 518–524Google Scholar
  17. [D86b]
    Dehne, F., "O(n1/2) Algorithms for the maximal elements and ECDF searching problem on a mesh-connected parallel computer", Info. Proc. Let. 22, 1986, pp. 303–306, May 1986MathSciNetGoogle Scholar
  18. [D87a]
    Dehne, F., "Computational geometry and VLSI", 1987 CompEuro Conference, Hamburg, FRG, May 11–15, 1987, pp. 870–875Google Scholar
  19. [DHSS87]
    Dehne, F., A.-L. Hassenclover, J.-R. Sack, and N. Santoro, "Parallel visibility on a meshconnected parallel computer", Int. Conference on Parallel Processing and Applications, L'Aquila, Italy, September 23–25, 1987, pp. 173–180Google Scholar
  20. [DS87c]
    Dehne, F. and I. Stojmenovic, "An optimal parallel solution to the ECDF searching problem for higher dimensions on a mesh-of-processors", Proc. 25th Annual Allerton Conference on Comm., Control and Comput., Monticello, Ill., Sept.30–Oct.2, 1987, pp. 660–661Google Scholar
  21. [DP88]
    Dehne, F. and Q. T. Pham, "Visibility algorithms for binary images on the hypercube and perfect-shuffle computer", to appear in Proc. IFIP Working Conference on Parallel Processing, Pisa, Italy, April 25–27, 1988Google Scholar
  22. [DSS87]
    Dehne, F., J.-R. Sack, and N. Santoro, "Computing on a systolic screen: hulls, contours and applications", Conference on Parallel Architectures and Languages Europe, Eindhoven, The Netherlands, June 15–19, 1987Google Scholar
  23. [D80]
    Dyer, C. R., "A fast parallel algorithm for the closest pair problem", Info. Proc. Let. 11:1, 1980, pp. 49–52Google Scholar
  24. [E86]
    ElGindy, H., "A parallel algorithm for triangulating simplicial point sets in space with optimal speed-up", Proc. 24th Annual Allerton Conference on Comm., Control and Comput., Monticello, Ill., Oct. 1–3, 1986Google Scholar
  25. [G87]
    Goodrich, M., "Finding the convex hull of a sorted point set in parallel", Info. Proc. Let. 26, 1987/88, pp. 173–179Google Scholar
  26. [H88]
    Hassenklover, A.-L. "Visibility for binary images on a mesh-connected computer", Master's thesis, School of Computer Science, Carleton University, April 1988Google Scholar
  27. [Ki83]
    Kirkpatrick, D. G., "Optimal search in planar subdivisions", SIAM Journal of Computing 12:1, 1983, pp. 28–35Google Scholar
  28. [JL87a]
    Jeong, C. S. and D. T. Lee, "Parallel geometric algorithms on mesh-connected computers", Proc. IEEE Fall Joint Computer Conference, 1987Google Scholar
  29. [JL87b]
    Jeong, C. S. and D. T. Lee, "Parallel geometric algorithms on mesh-connected computers", Tech. Rep. 87-02-FC-01 (Revised), Technological Inst., Northwestern Univ., Evanston, Ill, 1987Google Scholar
  30. [KS85]
    Keil, J. M. and J.-R. Sack, "Minimum decomposition of polygonal objects", in Computational Geometry, ed. G.T. Toussaint, North Holland, Amsterdam, The Netherlands, 1985Google Scholar
  31. [KE86]
    Kumar, V. and M. Eshaghian, "Parallel geometric algorithms for digitized pictures on mesh of trees", Proc. 1986 Int'l Conference on Parallel Processing, St. Charles, Ill., Aug. 19–22, 1986, pp. 270–273Google Scholar
  32. [KY85]
    Kozen, D. and C.K. Yap, "Algebraic cell decomposition in NC", Proc. IEEE Symp. on Found. of Computer Science, Portland, Oregon, Oct. 1985, pp. 515–521Google Scholar
  33. [LP84]
    Lee, D.T. and F. P. Preparata, "Computational geometry — a survey", IEEE Trans. on Computers, Vol. C-33, No. 12, Dec. 1984, pp. 1072–1101Google Scholar
  34. [LP86]
    Lodi, E. and L. Pagli, "A VLSI solution to the vertical segment visibility problem", IEEE Trans. on Computers, Vol. C-35, No. 10, Oct. 1986, pp. 923–928.Google Scholar
  35. [Lu86]
    Lu, M. "Constructing the Voronoi diagram on a mesh-connected computer", Proc. 1986 Int'l Conference on Parallel Processing, St. Charles, Ill., Aug. 19–22, 1986, pp. 806–811Google Scholar
  36. [LV85]
    Lu, M. and P. Varman, "Solving geometric proximity problems on mesh-connected computers", Proc. 1985 IEEE Computer Society Workshop on Computer Architecture for Pattern Analysis and Image Database Management, pp.249–255, Nov. 1985Google Scholar
  37. [LV86]
    Lu, M. and P. Varman, "Mesh-connected computer algorithms for rectangle intersection problems", Proc. 1986 Int'l Conference on Parallel Processing, St. Charles, Ill., Aug. 19–22, 1986, pp. 301–307Google Scholar
  38. [M86]
    Merks, E., "An optimal parallel algorithm for triangulating a set of points in the plane", Int'l Journal on Parallel Programming, Vol. 15, No. 5, 1986, pp. 399–411Google Scholar
  39. [MC80]
    Mead, C. A. and L. A. Conway, "Introduction to VLSI Systems", Addison-Wesley, Reading, MA, 1980Google Scholar
  40. [MM87]
    Miller, R. and S. E. Miller, "Using the hypercube to determine geometric properties of digitized pictures", Proc. Int'l Conf. Parallel Processing, 1987, pp. 638–640Google Scholar
  41. [MS84]
    Miller, R. and Q. F. Stout, "Computational geometry on a mesh-connected computer", Proc. Int.l Conf. on Parallel Processing, 1984, pp. 66–73Google Scholar
  42. [MS85]
    Miller, R. and Q. F. Stout, "Geometric algorithms for digitized pictures on a mesh-connected computer", IEEE Trans. on Pattern Analysis and Machine Intelligence, Vol. PAMI-7, No. 2, March 1985, pp 216–228Google Scholar
  43. [MS86]
    Miller, R. and Q. F. Stout, "Mesh computer algorithms for computational geometry", Tech. Rept. 86-18, Department of Computer Science, Univ. of Buffalo, 1986Google Scholar
  44. [MS87]
    Miller, R. and Q. F. Stout, "Mesh computer algorithms for line segments and simple polygons", Proc. Int.l Conf. on Parallel Processing, Aug. 1987, pp. 282–285Google Scholar
  45. [NMB81]
    Nath, D., S. N. Maheshwari, and P.C. P. Bhatt, "Parallel algorithms for convex hull determination in two dimensions", Conf. Analysis Problem Classes and Programming for Parallel Computing, 1981, pp. 358–372Google Scholar
  46. [PS85]
    Preparata, F. P. and M. I. Shamos, "Computational Geometry, An Introduction", Springer Verlag Berlin, Heidelberg, New York, Tokyo 1985Google Scholar
  47. [PV79]
    Preparata, F. P. and J. E. Vuillemin, "The cube-connected cycles: a versatile network for parallel computation", Proc. 20th IEEE Symp. on Found. of Comp. Sci., 1979, pp. 140–147Google Scholar
  48. [RS87]
    Reif, J. and S. Sen, "Optimal randomized parallel algorithms for computational geometry", Proc. Int'l Conf. Parallel Processing, 1987, pp. 270–277Google Scholar
  49. [SH75]
    Shamos, M. I., D. Hoey, "Closest point problems", Proc. 16th Symp. on Foundations of Computer Science, 1975, pp. 152–162Google Scholar
  50. [St85]
    Stout, Q. F., "Pyramid computer solutions for the closest pair problem", J. Algorithms, No. 6, 1985, pp. 200–212Google Scholar
  51. [S87b]
    Stojmenovic, I. "Parallel computational geometry", Tech. Rept. CS-87-176, Computer Science, Washington State University, 1987Google Scholar
  52. [TK77]
    Thompson, C. D. and H. T. Kung, "Sorting on a mesh-connected parallel computer", C. ACM, Vol. 20, No. 4, April 1977, pp. 263–271Google Scholar
  53. [UL84]
    Ullman, J. D., "Computational Aspects of VLSI", Principles of Computer Science Series, Computer Science Press, 1984Google Scholar
  54. [W85]
    Wagener, H., "Parallel computational geometry using polygonal order", PhD. thesis Technical University of Berlin, FRG, 1985Google Scholar
  55. [WT87]
    Wang, C. A. and Y. H. Tsin, "An O(log n) time parallel algorithm for triangulating a set of points in the plane, IPL 25, 1987, pp. 55–60MathSciNetGoogle Scholar
  56. [Y87]
    Yap, C.K., "What can be parallelized in computational geometry", Proc. International Workshop on Parallel Algorithms and Architectures, Suhl, GDR, May 25–30, 1987, pp. 184–195Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Frank Dehne
    • 1
  • Jörg-Rüdiger Sack
    • 1
  1. 1.School of Computer ScienceCarleton UniversityOttawaCanada

Personalised recommendations