Abstract
In this paper, we study the problem of implementing standard data structures on a hypercube multiprocessor. We present a technique for efficiently executing multiple independant search processes on a class of graphs called ordered h-level graphs. We show how this technique can be utilized to implement a segment tree on a hypercube, thereby obtaining O(log2n) time algorithms for solving the next element search problem, the trapezoidal decomposition problem, the triangulation problem, and the (multiple) planar point location problem.
Research partially supported by the Natural Sciences and Engineering Research Council of Canada under Grant A9173.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M.J. Atallah, R. Cole, and M.T. Goodrich, "Cascading divide-and-conquer: a technique for designing parallel algorithms", Technical Report CSD-TR-665, Deparetment of Computer Science, Purdue University, 1987.
A. Aggarwal, B. Chazelle, L. Guibas, C. O'Dunlaing, and C. Yap, "Parallel computational geometry", Algorithmica 3:3, 1988, pp. 293–327.
K.E. Batcher, "Sorting networks and their applications", in Proc. AFIPS Spring Joint Computer Conference, 1968, pp. 307–314.
J.L. Bentley and D. Wood, "An optimal worst case algorithm for reporting intersections of rectangles", IEEE Transactions on Computers 29:7, 1980, pp. 571–576.
N. Dadoun and D.G. Kirkpatrick, "Parallel processing for efficient subdivision search", in Proc. ACM Symp. on Computational Geometry, 1987, pp. 205–214.
M.T. Goodrich, "Efficient parallel techniques for computational geometry", Ph.D. thesis, Department of Computer Science, Purdue University, 1987.
C-S. Jeong and D.T. Lee, "Parallel geometric algorithms on mesh-connected computers", in Proc. Fall Joint Computer Conf., 1987.
K. Mehlhorn, "Data structures and algorithms 3: multi-dimensional searching and computational geometry", Springer Verlag, 1984.
D. Nassimi, S. Sahni, "Data broadcasting in SIMD computers", IEEE Trans. on Computers 30:2, 1981, pp. 101–106.
F.P. Preparata and M.I. Shamos, "Computational geometry — an introduction", Springer Verlag, 1985.
R.E. Tarjan and C.J. Van Wyk, "An O(n log log n) time algorithm for triangulating a simple polygon", SIAM Journal of Computing 17, 1988, 143–178.
C.-K. Yap, "Parallel triangulation of a polygon in two calls to the trapezoidal map", Algorithmica 3:2, 1988, pp. 279–288.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dehne, F., Rau-Chaplin, A. (1990). Implementing data structures on a hypercube multiprocessor, and applications in parallel computational geometry. In: Nagl, M. (eds) Graph-Theoretic Concepts in Computer Science. WG 1989. Lecture Notes in Computer Science, vol 411. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52292-1_23
Download citation
DOI: https://doi.org/10.1007/3-540-52292-1_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52292-8
Online ISBN: 978-3-540-46950-6
eBook Packages: Springer Book Archive