A note on determining the 3-dimensional convex hull of a set of points on a mesh of processors

Preliminary version
  • Frank Dehne
  • Jörg-R. Sack
  • Ivan Stojmenović
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 318)


This paper discusses the construction of the 3-dimensional convex hull for a set of n points stored on a √n × √n mesh of processors. Lu has shown that this problem can be solved in √n log n time if all points are located on a sphere. Here, we solve, in the same time-complexity, the 3-dimensional convex hull problem for arbitrary point sets. Furthermore, we observe a time/space trade off: if each processor is allocated O(log n) space then √n time is sufficient to determine the 3-dimensional convex hull.


Convex Hull Voronoi Diagram Tangent Plane Computational Geometry Storage Structure 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [ACGDY85]
    A. Aggarwal, B. Chazelle, L. Guibas, C. O. Dunlaing, and C. Yap, "Parallel computational geometry", Proc. IEEE Symp. on Found. of Computer Science, Portland, Oregon, Oct. 1985Google Scholar
  2. [AH86]
    M. Atallah, S. Hambrusch, "Solving tree problems on a mesh-connected processor array", Information and Control, Vol. 69, Nos. 1–3, 1986.Google Scholar
  3. [B79]
    K. Q. Brown, "Voronoi diagrams from convex hulls", Information Processing Letters, Vol.9, 1979, pp. 223–228.Google Scholar
  4. [DK87]
    N. Dadoun, D. G. Kirkpatrick, "Parallel construction of subdivision hierarchies", Proc. of the 3rd ACM Conference on Computational Geometry, 1987, pp. 205–214Google Scholar
  5. [DS88]
    F. Dehne, J.-R. Sack, "A survey of parallel computational geometry algorithms", Tech. Rept. School of Computer Science, Carleton University, Ottawa, Canada, 1988, to be presented at Parcella '88, Berlin, GDR, October 1988Google Scholar
  6. [K83]
    D. G. Kirkpatrick, "Optimal search in planar subdivisions", SIAM Journal of Computing 12,1, 1983, pp. 28–35.Google Scholar
  7. [JL87]
    C. S. Jeong, D. T. Lee, "Parallel geometric algorithms on mesh-connected computers", FJCC, 1987.Google Scholar
  8. [Lu87]
    M. Lu, "Constructing the Voronoi diagram on a mesh-connected computer", Proc. of the 1986 IEEE Conference on Parallel Processing, St. Charles, III., 1986, pp. 806–811.Google Scholar
  9. [MS84]
    R. Miller, Q. F. Stout, "Computational geometry on a mesh-connected computer", Proc. Int. Conf. on Parallel Processing, 1984.Google Scholar
  10. [MS86]
    R. Miller, Q. F. Stout, "Mesh computer algorithms for computational geometry", Technical Report 86-18, Department of Computer Science, University of Buffalo, 1986.Google Scholar
  11. [MS88]
    R. Miller, Q. F. Stout, "Parallel Algorithms for Regular Structures", MIT Press, to appear.Google Scholar
  12. [PH77]
    F. P. Preparata, S. J. Hong, "Convex hulls of sets of points in two and three dimensions", Comm. ACM 20, 1977, pp. 87–93.Google Scholar
  13. [PS85]
    F. P. Preparata, M. I. Shamos, "Computational Geometry: An Introduction", Springer Verlag, New York, Berlin, Heidelberg, Tokyo, 1985Google Scholar
  14. [TK77]
    C. D. Thompson, H. T. Kung, "Sorting on a mesh-connected parallel computer", Comm. ACM 20, 1977, pp. 263–271.Google Scholar
  15. [UL84]
    J. D. Ullman, "Computational aspects of VLSI", Principles of Computer Science Series, Computer Science Press, 1984.Google Scholar
  16. [Y87]
    C. K. Yap, "What can be parallelized in computational geometry"? International Workshop on Parallel Algorithms and Architectures, Suhl, GDR, 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Frank Dehne
    • 1
  • Jörg-R. Sack
    • 1
  • Ivan Stojmenović
    • 2
  1. 1.School of Computer ScienceCarleton UniversityOttawaCanada
  2. 2.Institute of MathematicsUniversity of Novi SadNovi SadYugoslavia

Personalised recommendations