Skip to main content
SpringerLink
Log in

A survey of parallel computational geometry algorithms

  • Invited Papers
  • Conference paper
  • First Online:
Parcella '88 (Parcella 1988)

Part of the book series: Lecture Notes in Computer Science ((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.

Research supported by the Natural Sciences and Engineering Research Council of Canada.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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–477

    Google Scholar 

  2. Akl, S., "A constant-time parallel algorithm for computing convex hulls", BIT 22, 1982, pp. 130–134

    Google Scholar 

  3. Akl, S., "Optimal parallel algorithms for computing convex hulls and for sorting", Computing 33,1 11, 1984, pp. 1–11

    Google Scholar 

  4. 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–417

    Google Scholar 

  5. 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–225

    Google Scholar 

  6. 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–767

    Google Scholar 

  7. 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–85

    Google Scholar 

  8. 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–142

    Google Scholar 

  9. Boxer, L., R. Miller, "Parallel dynamic computational geometry", Tech. Rep. 87-11, Dept. of Computer Science, SUNY at Buffalo, Buffalo, NY, Aug. 1987

    Google Scholar 

  10. Chazelle, B. M., "Computational geometry on a systolic chip", IEEE Trans. on Computers, Vol. C-33, No. 9, Sept. 1984, pp.774–785

    Google Scholar 

  11. 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–147

    Google Scholar 

  12. Chow, A., "Parallel algorithms for geometric problems", PhD. thesis, Dept. of Computer Science, Univ. of Illinois, Urbana-Champaign, 1980

    Google Scholar 

  13. Chazelle, B. M., L. M. Monier, "A model of computation for VLSI with related complexity results", Proc. 13th ACM Symp. on Theory of Comp., 1981

    Google Scholar 

  14. Dadoun, N., D. G. Kirkpatrick, "Parallel processing for efficient subdivision search", Proc. Third ACM SIGGRAPH Symposium on Computational Geometry, Waterloo, 1987, pp. 205–214

    Google Scholar 

  15. 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–59

    Google Scholar 

  16. 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–524

    Google Scholar 

  17. 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 1986

    MathSciNet  Google Scholar 

  18. Dehne, F., "Computational geometry and VLSI", 1987 CompEuro Conference, Hamburg, FRG, May 11–15, 1987, pp. 870–875

    Google Scholar 

  19. 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–180

    Google Scholar 

  20. 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–661

    Google Scholar 

  21. 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, 1988

    Google Scholar 

  22. 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, 1987

    Google Scholar 

  23. Dyer, C. R., "A fast parallel algorithm for the closest pair problem", Info. Proc. Let. 11:1, 1980, pp. 49–52

    Google Scholar 

  24. 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, 1986

    Google Scholar 

  25. Goodrich, M., "Finding the convex hull of a sorted point set in parallel", Info. Proc. Let. 26, 1987/88, pp. 173–179

    Google Scholar 

  26. Hassenklover, A.-L. "Visibility for binary images on a mesh-connected computer", Master's thesis, School of Computer Science, Carleton University, April 1988

    Google Scholar 

  27. Kirkpatrick, D. G., "Optimal search in planar subdivisions", SIAM Journal of Computing 12:1, 1983, pp. 28–35

    Google Scholar 

  28. Jeong, C. S. and D. T. Lee, "Parallel geometric algorithms on mesh-connected computers", Proc. IEEE Fall Joint Computer Conference, 1987

    Google Scholar 

  29. 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, 1987

    Google Scholar 

  30. Keil, J. M. and J.-R. Sack, "Minimum decomposition of polygonal objects", in Computational Geometry, ed. G.T. Toussaint, North Holland, Amsterdam, The Netherlands, 1985

    Google Scholar 

  31. 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–273

    Google Scholar 

  32. 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–521

    Google Scholar 

  33. Lee, D.T. and F. P. Preparata, "Computational geometry — a survey", IEEE Trans. on Computers, Vol. C-33, No. 12, Dec. 1984, pp. 1072–1101

    Google Scholar 

  34. 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. 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–811

    Google Scholar 

  36. 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. 1985

    Google Scholar 

  37. 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–307

    Google Scholar 

  38. 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–411

    Google Scholar 

  39. Mead, C. A. and L. A. Conway, "Introduction to VLSI Systems", Addison-Wesley, Reading, MA, 1980

    Google Scholar 

  40. 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–640

    Google Scholar 

  41. Miller, R. and Q. F. Stout, "Computational geometry on a mesh-connected computer", Proc. Int.l Conf. on Parallel Processing, 1984, pp. 66–73

    Google Scholar 

  42. 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–228

    Google Scholar 

  43. Miller, R. and Q. F. Stout, "Mesh computer algorithms for computational geometry", Tech. Rept. 86-18, Department of Computer Science, Univ. of Buffalo, 1986

    Google Scholar 

  44. 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–285

    Google Scholar 

  45. 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–372

    Google Scholar 

  46. Preparata, F. P. and M. I. Shamos, "Computational Geometry, An Introduction", Springer Verlag Berlin, Heidelberg, New York, Tokyo 1985

    Google Scholar 

  47. 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–147

    Google Scholar 

  48. Reif, J. and S. Sen, "Optimal randomized parallel algorithms for computational geometry", Proc. Int'l Conf. Parallel Processing, 1987, pp. 270–277

    Google Scholar 

  49. Shamos, M. I., D. Hoey, "Closest point problems", Proc. 16th Symp. on Foundations of Computer Science, 1975, pp. 152–162

    Google Scholar 

  50. Stout, Q. F., "Pyramid computer solutions for the closest pair problem", J. Algorithms, No. 6, 1985, pp. 200–212

    Google Scholar 

  51. Stojmenovic, I. "Parallel computational geometry", Tech. Rept. CS-87-176, Computer Science, Washington State University, 1987

    Google Scholar 

  52. Thompson, C. D. and H. T. Kung, "Sorting on a mesh-connected parallel computer", C. ACM, Vol. 20, No. 4, April 1977, pp. 263–271

    Google Scholar 

  53. Ullman, J. D., "Computational Aspects of VLSI", Principles of Computer Science Series, Computer Science Press, 1984

    Google Scholar 

  54. Wagener, H., "Parallel computational geometry using polygonal order", PhD. thesis Technical University of Berlin, FRG, 1985

    Google Scholar 

  55. 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–60

    MathSciNet  Google Scholar 

  56. 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–195

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Carleton University, K1S 5B6, Ottawa, Ontario, Canada

    Frank Dehne & Jörg-Rüdiger Sack

Authors
  1. Frank Dehne
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jörg-Rüdiger Sack
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gottfried Wolf Tamáas Legendi Udo Schendel

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dehne, F., Sack, JR. (1989). A survey of parallel computational geometry algorithms. In: Wolf, G., Legendi, T., Schendel, U. (eds) Parcella '88. Parcella 1988. Lecture Notes in Computer Science, vol 342. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50647-0_104

Download citation

  • DOI: https://doi.org/10.1007/3-540-50647-0_104

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50647-8

  • Online ISBN: 978-3-540-46062-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation