Skip to main content
SpringerLink
Log in

Parallel randomized techniques for some fundamental geometric problems: A survey

  • Workshop on Randomized Parallel Computing Panos Pardalos, University of Florida, Gainesville Sanguthevar Rajasekaran, University of Florida, Gainesville
  • Conference paper
  • First Online:
Parallel and Distributed Processing (IPPS 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1388))

Included in the following conference series:

  • 69 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Aggarwal, B. Chazelle, L. Guibas, C. Ó'Dúnlaing, and C. K. Yap. Parallel Computational Geometry. Algorithmica, 3:293–327, 1988.

    Article  Google Scholar 

  2. 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.

    Google Scholar 

  3. N. M. Amato and F. P. Preparata. An NC1 Parallel 3D Convex Hull Algorithm. In Proc. 9th ACM Symp. on Computational Geometry, 1993.

    Google Scholar 

  4. 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.

    Article  Google Scholar 

  5. 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.

    Google Scholar 

  6. K. Q. Brown. Geometric transforms for fast geometric algorithms. PhD thesis, Carnegie-Mellon University, Pittsburgh, PA, 1980.

    Google Scholar 

  7. A. Chow. Parallel Algorithms for Geometric Problems. PhD thesis, University of Illinois at Urbana-Champaign, 1980.

    Google Scholar 

  8. K. L. Clarkson and P. W. Shor. Applications of Random Sampling in Computational Geometry, II. Discrete Comput. Geom., 4:387–421, 1989.

    Google Scholar 

  9. R. Cole and M. T. Goodrich. Optimal Parallel Algorithms for Polygon and Pointset Problems. Algorithmica, 7:3–23, 1992.

    Article  Google Scholar 

  10. M. T. Goodrich. Geometric Partitioning Made Easier, Even in Parallel. In Proc. 9th ACM Symp. on Computational Geometry, 1993.

    Google Scholar 

  11. 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.

    Google Scholar 

  12. D. Haussler and E. Welzl. ⊂e-nets and Simplex Range Queries. Discrete and Computational Geometry, 2:127–152, 1987.

    Google Scholar 

  13. 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.

    Google Scholar 

  14. J. Matousek. Cutting hyperplane arrangements. Discrete Comput. Geom., 6:385–406, 1991.

    Google Scholar 

  15. J. Matoušek. Reporting points in halfspaces. Comput. Geom Theory Appl., 2(3):169–186, 1992.

    Google Scholar 

  16. K. Mulmuley. A Fast Planar Partition Algorithm. In Proc. 20th IEEE Symp. on the Foundations of Computer Science, pages 580–589, 1988.

    Google Scholar 

  17. 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.

    Google Scholar 

  18. 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.

    Google Scholar 

  19. 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.

    Google Scholar 

  20. 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.

    Article  Google Scholar 

  21. J. H. Reif and S. Sen. Optimal Randomized Parallel Algorithms for Computational Geometry. Algorithmica, 7:91–117, 1992.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Rutgers University, 08102, Camden, NJ

    Suneeta Ramaswami

Authors
  1. Suneeta Ramaswami
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

José Rolim

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation