Abstract
This paper gives hypercube algorithms for some simple problems involving geometric properties of sets of points. The properties considered emphasize aspects of convexity and domination. Efficient algorithms are given for both fine- and medium-grain hypercube computers, including a discussion of implementation, running times and results on an Intel iPSC hypercube, as well as theoretical results. For both serial and parallel computers, sorting plays an important role in geometric algorithms for determining simple properties, often being the dominant component of the running time. Since the time required to sort data on a hypercube computer is still not fully understood, the running times of some of our algorithms for unsorted data are not completely determined. For both the fine- and medium-grain models, we show that faster expected-case running time algorithms are possible for point sets generated randomly. Our algorithms are developed for sets of planar points, with several of them extending to sets of points in spaces of higher dimension.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Aggarwal, B. Chazelle, L. Guibas, C. O'Dunlaing, and C. Yap, Parallel computational geometry,Algorithmica (1988), 293–327.
M. J. Atallah and M. T. Goodrich, Efficient parallel solutions to geometric problems,J. Parallel Distrib. Comput. 3 (1986), 492–507.
K. E. Batcher, Sorting networks and their applications,Proc. AFIPS Spring Joint Computer Conf. (1968), pp. 307–314.
J. L. Bentley, Multidimensional divide-and-conquer,Comm. ACM 23 (1980), 214–229.
J. L. Bentley, H. T. Kung, M. Schkolnick, and C. D. Thompson, On the average number of maxima in a set of vectors,J. Assoc. Comput. Mach. 25 (1978), 536–543.
R. E. Cypher and J. L. C. Sanz, Data reduction and fast routing: a strategy for efficient algorithms for parallel message-passing computers,Algorithmica, this issue, 77–89.
R. E. Cypher and J. L. C. Sanz, Optimal sorting on feasible parallel computers, in preparation.
H. Freeman and R. Shapira, Determining the minimal-area encasing rectangle for an arbitrary closed curve,Comm. ACM 18 (1975), 409–413.
D. E. Knuth,The Art of Computer Programming, Vol. 1, Addison-Wesley, Reading, MA, 1968.
R. Miller and S. E. Miller, Image processing on hypercube multiprocessors,Proc. SPIE 939, 156–166.
R. Miller and Q. F. Stout, Efficient parallel convex hull algorithms,IEEE Trans. Comput. 37(12) (1988), 1605–1619.
R. Miller and Q. F. Stout, Mesh computer algorithms for computational geometry,IEEE Trans. Comput. 38(3) (1989), 321–340.
R. Miller and Q. F. Stout,Parallel Algorithms for Regular Architectures, MIT Press, Cambridge, MA, 1989.
D. Nassimi and S. Sahni, Parallel permutation and sorting algorithms and a new general interconnection network,J. Assoc. Comput. Mach. 29 (1982), 642–667.
C. G. Plaxton, Load balancing, selection and sorting on the hypercube,Proc. 1st ACM Symp. on Parallel Algorithms and Architecture (1989), to appear.
F. P. Preparata and M. I. Shamos,Computational Geometry, Springer-Verlag, New York, 1985.
J. H. Reif and L. G. Valiant, A logarithm sort for linear size networks,J. Assoc. Comput. Mach. 34 (1987) 60–76.
A. Renyi and R. Sulanke, Uber die konvexe Hulle von n zufallig gewahlten Punkten,Z. Wahrsch. Verw. Gebiete 2 (1963), 75–84.
R. Sedgewick,Algorithms, Addison-Wesley, Reading, MA, 1983.
I. Stojmenovic, Personal communication.
Q. F. Stout, Constant-time geometry on PRAMs,Proc. 1988 Internat. Conf. on Parallel Processing, vol. III, pp. 104–107.
B. Wagar, Hyperquicksort: a fast sorting algorithm for hypercubes, inHypercube Multiprocessors, SIAM, Philadelphia, PA, 1987, pp. 292–299.
Author information
Authors and Affiliations
Additional information
Communicated by Alok Aggarwal.
The research of E. Cohen, R. Miller, and E. M. Sarraf was partially supported by National Science Foundation Grant ASC-8705104. R. Miller was also partially supported by National Science Foundation Grants DCR-8608640 and IRI-8800514. Q. F. Stout's research was partially supported by National Science Foundation Grant DCR-85-07851, and an Incentives for Excellence Grant from the Digital Equipment Corporation.
Rights and permissions
About this article
Cite this article
Cohen, E., Miller, R., Sarraf, E.M. et al. Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers. Algorithmica 7, 51–75 (1992). https://doi.org/10.1007/BF01758751
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01758751