Parallelizing an algorithm for visibility on polyhedral terrain

International Journal of Computational Geometry and Applications

Volumn 7, Issue 1-2, 1997, Pages 75-84

  Ansel Teng, Y ^a,d   Mount, David ^b   Puppo, Enrico ^c   Davis, Larry S ^a  

^a UNIVERSITY OF MARYLAND   (United States)

^b Consiglio Nazionale delle Ricerche ^*  (United States)

^c CNR   (Italy)

^d CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

CREW PRAM; Parallel algorithms; Profile tree; Terrain visibility

Indexed keywords

EID: 3142583799     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/s0218195997000065     Document Type: Article

References (8)

1. M. J. Atallah, R. Cole, and M. T. Goodrich, "Cascading divide-and-conquer: A technique for designing parallel algorithms", SIAM J. Comput., 18 (1989) 499-532.
2. M.J. Atallah, S.E. Hambrusch, and L.E. TeWinkel, "Topological numbering of features on a mesh", Algorithmica, 6 (1991) 762-769.
3. M.J. Atallah, "Parallel techniques for computational geometry", Proc. IEEE, 80 (1992) 1435-1448.
4. S. Chandran, Merging in parallel computational geometry, PhD thesis (University of Maryland, College Park, 1989) , also published as Technical Report CAR-TR-468 (Center for Automation Research, College Park, 1989).
5. S. Chandran, Merging in parallel computational geometry, PhD thesis (University of Maryland, College Park, 1989) , also published as Technical Report CAR-TR-468 (Center for Automation Research, College Park, 1989).
6. R. Cole, "Parallel merge sort, SIAM J. Comput., 17(4) (1988) 770-785.
7. R. Cole and M. Sharir, "Visibility problems for polyhedral terrains", Journal of Symbolic Computation, 7 (1989) 11-30.
8. H. Edelsbrunner, "An acyclicity theorem for cell complexes in d-dimensions", Combinatorica, 10 (1990) 251-260.