Author:
Chin Fancis,Lee Derz Tsai,Wang Cao An
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Aggarwal A., Chazelle B., Guibas L., O’Dunlaing C., and Yap C., (1988), ‘Parallel Computational Geometry’, Algorithmica, 3, pp.293–327.
2. Aggarwal A., Guibas L., Saxe J., and Shor P., (1989), ‘A linear time algorithm for computing the Voronoi diagram of a convex polygon’, Disc. and Comp. Geometry 4, pp.591–604.
3. Amato N. and Preparata F., (1993) ‘An NC1 Parallel 3D convex hull algorithm’, proceedings of 10th ACM symposium on Computational Geometry, pp.289–297.
4. Amato N., Goodrich M., and Ramos E., (1994), ‘Parallel algorithms for higher dimensional convex hulls’, Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci., pp.683–694.
5. Atallah M., Cole R., and Goodrich M., (1989), ‘Cascading Divide-and-Conquer: A technique for Designing Parallel Algorithms’ SIAM J. Computing, Vol.18, No.3, pp.499–532.