Scalable parallel computational geometry for coarse grained multicomputers

International Journal of Computational Geometry and Applications

Volumn 6, Issue 3, 1996, Pages 379-400

  Dehne, Frank ^a   Fabri, Andreas ^b   Rau Chaplin, Andrew ^a,c  

^a CARLETON UNIVERSITY   (Canada)

^b INRIA   (France)

^c DALHOUSIE UNIVERSITY   (Canada)

Author keywords

Computational geometry; Parallel algorithms; Scalability

Indexed keywords

EID: 0030496241     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195996000241     Document Type: Article

References (19)

1. Grand Challenges: High Performance Computing and Communications. The FY 1992 U.S. Research and Development Program. A Report by the Committee on Physical, Mathematical, and Engineering Sciences. Federal Council for Science, Engineering, and Technology. To Supplement the U.S. President's Fiscal Year 1992 Budget.
2. M. J. Atallah and J.-J. Tsay. On the parallel-decomposability of geometric problems. Proc. 5th Annu. ACM Symposium on Computational Geometry, pp. 104-113, 1989.
3. J.-J. Tsay, Ph.D. Thesis, Purdue University.
4. M.T. Goodrich, J.J. Tsay, D.E. Vengroff, and J.S. Vitter. External-memory computational geometry. Proc. 34th IEEE Symposium on Foundations of Computer Science, pp. 714-723, 1993.
5. J.M. Marberg and E. Gafni. Sorting in constant number of row and column phases on a mesh. Proc. Allerton Conference on Communication, Control and Computing, pp. 603-612, 1986.
6. K.E. Batcher. Sorting networks and their applications. Proc. AFIPS Spring Joint Computer Conference, pp. 307-314, 1968.
7. R. Cypher and C.G. Plaxton. Deterministic sorting in nearly logarithmic time on the hypercube and related computers. Proc. ACM Symposium on .Theory of Computing, pp. 193-203, 1990.
8. J.H. Reif and L.G. Valiant. A Logarithmic Time Sort for Linear Size Networks. Journal of the ACM, Vol. 34, 1, pp. 60-76, 1987.
9. D.P. Bertsekas and J.N. Tsitsiklis. Parallel and Distributed Computation: Numerical Methods. Prentice Hall, Englewood Cliffs, NJ, 1989.
10. R. I. Greenberg and C. E. Leiserson. Randomized routing on fat-trees. Advances in Computing Research, 5, pp. 345-374, 1989.
11. F.T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, San Mateo, CA, 1992.
12. J. van Leeuwen and D. Wood. The measure problem for rectangular ranges in d-space. Journal of Algorithms, 2, pp. 282-300, 1981.
13. F.P. Preparata and M.I. Shamos. Computational Geometry: an Introduction. Springer-Verlag, New York, NY, 1985.
14. J. Hershberger. Finding the upper envelope of n line segments in O(n log n) time. Information Processing Letters 33, pp. 169-174, 1989.
15. F. Dehne and A. Rau-Chaplin. Implementing data structures on a hypercube multiprocessor and applications in parallel computational geometry. Journal of Parallel and Distributed Computing, Vol. 8, No. 4, pp. 367-375, 1990.
16. M.J. Atallah, F. Dehne, R. Miller, A. Rau-Chaplin, and J.-J. Tsay Multisearch techniques for implementing data structures on a mesh-connected computer. Proc. ACM Symposium on Parallel Algorithms and Architectures, pp. 204-214, 1991.
17. J.L. Bentley. Algorithms for Klee's rectangle problems. Carnegie-Mellon Univ., Penn., Dept. of Comp. Sci. Unpublished notes, 1977.
18. F. Dehne and J.-R. Sack. Translation separability of sets of polygons. The Visual Computer 3, pp. 227-235, 1987.
19. A. Tridgell and R.P. Brent. An implementation of a general-purpose parallel sorting algorithm. CS Laboratory, Australian National University. Technical Report TR-CS-93-01, 1993.