Preview
Unable to display preview. Download preview PDF.
References
A. Aggarwal, B. Chazelle, L. Guibas, C. Ó'Dúnlaing, and C. K. Yap. Parallel Computational Geometry. Algorithmica, 3:293–327, 1988.
N. Amato, M. Goodrich, and E. Ramos. Parallel Algorithms for Higher-Dimensional Convex Hulls. In Proc. of the 35th Annual IEEE Symposium on Foundations of Computer Science, pages 683–694, October 1994.
N. M. Amato and F. P. Preparata. An NC1 Parallel 3D Convex Hull Algorithm. In Proc. 9th ACM Symp. on Computational Geometry, 1993.
M. J. Atallah, R. Cole, and M. T. Goodrich. Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms. SIAM J. Comput., 18(3):499–532, June 1989.
M. J. Atallah and M. T. Goodrich. Deterministic parallel computational geometry. In J. H. Reif, editor, Synthesis of Parallel Algorithms, pages 497–536. Morgan Kaufmann Publishers Inc., 1993.
K. Q. Brown. Geometric transforms for fast geometric algorithms. PhD thesis, Carnegie-Mellon University, Pittsburgh, PA, 1980.
A. Chow. Parallel Algorithms for Geometric Problems. PhD thesis, University of Illinois at Urbana-Champaign, 1980.
K. L. Clarkson and P. W. Shor. Applications of Random Sampling in Computational Geometry, II. Discrete Comput. Geom., 4:387–421, 1989.
R. Cole and M. T. Goodrich. Optimal Parallel Algorithms for Polygon and Pointset Problems. Algorithmica, 7:3–23, 1992.
M. T. Goodrich. Geometric Partitioning Made Easier, Even in Parallel. In Proc. 9th ACM Symp. on Computational Geometry, 1993.
M. T. Goodrich, C. Ó'Dúnlaing, and C. K. Yap. Constructing the Voronoi Diagram of a Set of Line Segments in Parallel. In Lecture Notes in Computer Science: 382, Algorithms and Data Structures, WADS, pages 12–23. Springer-Verlag, 1989.
D. Haussler and E. Welzl. ⊂e-nets and Simplex Range Queries. Discrete and Computational Geometry, 2:127–152, 1987.
C. Levcopoulos, J. Katajainen, and A. Lingas. An Optimal Expected-time Parallel Algorithm for Voronoi Diagrams. In Proc. of the First Scandinavian Workshop on Algorithm Theory, volume 318 of Lecture Notes in Computer Science, pages 190–198. Springer-Verlag, 1988.
J. Matousek. Cutting hyperplane arrangements. Discrete Comput. Geom., 6:385–406, 1991.
J. Matoušek. Reporting points in halfspaces. Comput. Geom Theory Appl., 2(3):169–186, 1992.
K. Mulmuley. A Fast Planar Partition Algorithm. In Proc. 20th IEEE Symp. on the Foundations of Computer Science, pages 580–589, 1988.
S. Rajasekaran and S. Ramaswami. Optimal parallel randomized algorithms for the voronoi diagram of line segments in the plane and related problems. In Proc. of the 10th Annual ACM Symp. on Computational Geometry, pages 57–66, Stony Brook, New York, June 1994. Full paper submitted to Algorithmica.
S. Rajasekaran and S. Sen. Random sampling techniques and parallel algorithm design. In J. H. Reif, editor, Synthesis of Parallel Algorithms, pages 411–451. Morgan Kaufmann Publishers Inc., 1993.
E. Ramos. Construction of 1-d lower envelopes and applications. In Proc. of the 13th Annual ACM Symp. on Computational Geometry, pages 57–66, Nice, France, June 1997.
J. H. Reif and S. Sen. Optimal Parallel Randomized Algorithms for Three Dimensional Convex Hulls and Related Problems. SIAM J. Comput., 21(3):466–485, 1992.
J. H. Reif and S. Sen. Optimal Randomized Parallel Algorithms for Computational Geometry. Algorithmica, 7:91–117, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ramaswami, S. (1998). Parallel randomized techniques for some fundamental geometric problems: A survey. In: Rolim, J. (eds) Parallel and Distributed Processing. IPPS 1998. Lecture Notes in Computer Science, vol 1388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64359-1_714
Download citation
DOI: https://doi.org/10.1007/3-540-64359-1_714
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64359-3
Online ISBN: 978-3-540-69756-5
eBook Packages: Springer Book Archive