Abstract
This paper is concerned with parallel algorithms for determining the Convex Hull of N points on a plane, for a Shared Memory SIMD Computer. First, simple algorithms with read conflicts are described. It is then shown that the same bounds can be achieved with somewhat more complicated algorithms without read conflicts. The bounds achieved are: 0(N/K log N + log K .log N) for K processors, K ≤ N, which is optimal for the range 1 ≤ K ≤ N/log N, and 0(K log N) for N1+1/K processors, 1 ≤ K ≤ log N. These bounds are the same as those for parallel sorting algorithms, and any further improvement in their efficiency will imply the existence of better sorting algorithms than currently known.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Andrew, A.M. ‘Another efficient algorithm for Convex Hulls in two dimensions', Inf. Proc. Letters 9(1979) pp. 216–219.
Batcher, K.E., ‘Sorting Networks and their applications', Proc. AFIPS SJCC, vol. 32, 1968, pp. 307–314.
Freeman, H., and Shapira, R. ‘Determining the minimum area incasing rectangle for an arbitrary closed curve, CACM 18, 7 (July 1975), pp. 409–413.
Gavril, F. ‘Adaptive Merging by Parallel Disjoint Comparisons', presented at the 1975 Conference on Information Sciences and Systems.
Hirschberg, D.S. ‘Fast parallel sorting schemes', CACM 21, 8 (Aug. 1978), pp. 657–661.
Munro, I., and Paterson, M. ‘Optimal algorithms for parallel polynomial evaluation', J. Comp. Sys. Sci. 7(1973), pp. 183–198.
Nassimi, D. and Sahni, S. ‘Data Broadcasting in SIMD computers', Tech. Rep., University of Minnesota, June 1979.
Preparata, F.P. ‘New Parallel Sorting Schemes', IEEE Trans. Comp., C-27 (July 1978) pp. 669–673.
Preparata, F.P. and Hong, S.J. ‘Convex Hulls of Finite Sets of Points in Two and Three Dimensions', CACM 20, 2(Feb. 1977), pp. 87–93.
Preparata, F.P. ‘An Optinal Real-Time Algorithm for Planar Convex Hulls', CACM 22, 7 (July 1979), pp. 402–405.
Savage, C.D. ‘Parallel algorithms for graph theoretic problems', Ph. D. Thesis, University of Illinois, Urbana, Aug. 1977.
Shamos, M.I., ‘Geometric Complexity', Proc. 7th Annual ACM Symp. on Theory of Comp., May 1975, pp. 224–233.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nath, D., Maheshwari, S.N., Bhatt, P.C.P. (1981). Parallel algorithms for the convex hull problem in two dimensions. In: Brauer, W., et al. Conpar 81. CONPAR 1981. Lecture Notes in Computer Science, vol 111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0105130
Download citation
DOI: https://doi.org/10.1007/BFb0105130
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10827-6
Online ISBN: 978-3-540-38715-2
eBook Packages: Springer Book Archive