Scaleable Parallel Algorithms for Lower Envelopes with Applications

Journal of Parallel and Distributed Computing

Volumn 53, Issue 2, 1998, Pages 91-118

  Boxer, Laurence ^a,b   Miller, Russ ^b   Rau Chaplin, Andrew ^c  

^a NIAGARA UNIVERSITY   (United States)

^b UNIVERSITY AT BUFFALO   (United States)

^c DALHOUSIE UNIVERSITY   (Canada)

Author keywords

Parallel algorithms; computational geometry; scaleable algorithms; coarse grained multicomputer; lower envelope.

Indexed keywords

EID: 0038856861     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1998.1478     Document Type: Article

References (24)

1. Agarwal P. K. Intersection and Decomposition Algorithms for Planar Arrangements. 1991;Cambridge Univ. Press, Cambridge.
2. Agarwal P. K., Sharir M., Shor P. Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences. J. of Combin. Theory Ser. A. 52:1989;228-274.
3. Akl S. G., Lyons K. A. Parallel Computational Geometry. 1993;Prentice-Hall, New York.
4. Atallah M. J. Some dynamic computational geometry problems. Comput. Math. Appl. 11:1985;1171-1181.
5. Boxer L., Miller R. Parallel dynamic computational geometry. J. of New Generation Comput. Systems. 2:1989;227-246.
6. Boxer L., Miller L. Dynamic computational geometry on meshes and hypercubes. J. of Supercomputing. 3:1989;161-191.
7. Boxer L., Miller R. Common intersections of polygons. Inform. Process. Lett. 33:1990;249-254.
8. Boxer L., Miller R., Rau-Chaplin A. SUNY at Buffalo Department of Computer Science Technical Report. 1996.
9. L. Boxer, R. Miller, A. Rau-Chaplin, Some scaleable parallel algorithms for geometric problems, Proc. IASTED Conf. on Parallel and Distributed Computing and Systems, 1996, 426, 430.
10. D. Culler, R. Karp, D. Patterson, A. Sahay, K. E. Schauser, E. Santos, R. Subramonian, T. von Eicken, LogP: Towards a realistic model of parallel computation, Proc. 4th ACM SIGPLAN Symp. on Principles of Parallel Programming, 1993.
11. Davenport H., Schinzel A. A combinatorial problem connected with differential equations. Amer. J. Math. 87:1965;684-694.
12. F. Dehne, A. Fabri, A. Rau-Chaplin, Scalable parallel geometric algorithms for multicomputers, Proc. 9th ACM Symp. on Computational Geometry, 1993, 298, 307.
13. F. Dehne, X. Deng, P. Dymond, A. Fabri, A. Khokhar, A randomized parallel 3D convex hull algorithm for coarse grained multicomputers, Proc. 7th ACM Symp. on Parallel Algorithms and Architectures, 1995, 27, 33.
14. X. Deng, P. Dymond, Efficient routing and messages bounds for optimal parallel algorithms, Proc. International Parallel Processing Symp, 1995, 556, 562.
15. A. Ferreira, A. Rau-Chaplin, S. Ubeda, Scalable 2d convex hull and triangulation algorithms for coarse grained multicomputers, Proc. 7th IEEE Symp. on Parallel and Distributed Processing, 1995.
16. Hambrusch S., Khokhar A. Purdue University Computer Sciences Technical Report. 1993.
17. Hart S., Sharir M. Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes. Combinatorica. 6:1986;151-177.
18. Hershberger J. Finding the upper envelope ofnOnn. Inform. Process. Lett. 33:1989;169-174.
19. Miller R., Stout Q. F. Parallel Algorithms for Regular Architectures: Meshes and Pyramids. 1996;MIT Press, Cambridge.
20. Nadler S. B. Jr. Hyperspaces of Sets. 1978;Marcel Dekker, New York.
21. Reichling M. On the detection of a common intersection ofk. Inform. Process. Lett. 29:1988;25-29.
22. Röte G. Computing the minimum Hausdorff distance between two point sets on a line under translation. Inform. Process. Lett. 38:1991;123-127.
23. Valiant L. G. A bridging-model for parallel computation. Comm. ACM. 33:1990;103-111.
24. Wiernik A., Sharir M. Planar realization of nonlinear Davenport-Schinzel sequences by segments. Discrete Comput. Geom. 3:1988;15-47.