Parallel Geometric Algorithms in Coarse-Grain Network Models

[1]  An optimal parallel algorithm for the visibility of a simple polygon from a point , 1991, JACM.

[2]  Leslie G. Valiant,et al.  General Purpose Parallel Architectures , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[3]  Xiaotie Deng,et al.  A randomized parallel 3D convex hull algorithm for coarse grained multicomputers , 1995, SPAA '95.

[4]  Jyh-Jong Tsay.  Parallel algorithms for geometric problems on networks of processors , 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.

[5]  Andrew Rau-Chaplin,et al.  Scalable parallel computational geometry for coarse grained multicomputers , 1996, Int. J. Comput. Geom. Appl..

[6]  Michael T. Goodrich,et al.  Communication-efficient parallel sorting (preliminary version) , 1996, STOC '96.

[7]  Claire Mathieu,et al.  Scalable and architecture independent parallel geometric algorithms with high probability optimal time , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

[8]  Michael T. Goodrich,et al.  Randomized fully-scalable BSP techniques for multi-searching and convex hull construction , 1997, SODA '97.

[9]  John Hershberger,et al.  Finding the Upper Envelope of n Line Segments in O(n log n) Time , 1989, Inf. Process. Lett..

[10]  Xiaotie Deng.  A Convex Hull Algorithm on Coarse-Grained Multiprocessors , 1994, ISAAC.

[11]  Afonso Ferreira,et al.  Scalable 2d convex hull and triangulation algorithms for coarse grained multicomputers , 1995, Proceedings.Seventh IEEE Symposium on Parallel and Distributed Processing.

[12]  Xiaotie Deng,et al.  A 2-D parallel convex hull algorithm with optimal communication phases , 1997, Proceedings 11th International Parallel Processing Symposium.

[13]  J. O'Rourke.  Art gallery theorems and algorithms , 1987 .

[14]  M. Atallah,et al.  An optimal parallel for the visibility of a simple polygon from a point , 1991 .

[15]  Mikhail J. Atallah,et al.  Optimal Parallel Hypercube Algorithms for Polygon Problems , 1995, IEEE Trans. Computers.

[16]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[17]  Xiaotie Deng,et al.  Good algorithm design style for multiprocessors , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

[18]  D. T. Lee,et al.  Visibility of a simple polygon , 1983, Comput. Vis. Graph. Image Process..

[19]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[20]  Xiaotie Deng,et al.  A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers , 1997, Theory of Computing Systems.

[21]  Silvio Salza,et al.  A Parallel Algorithm for the Visibility Problem from a Point , 1990, J. Parallel Distributed Comput..

[22]  Michael T. Goodrich,et al.  Communication-Efficient Parallel Sorting , 1999, SIAM J. Comput..