Randomized external-memory algorithms for line segment intersection and other geometric problems

International Journal of Computational Geometry and Applications

Volumn 11, Issue 3, 2001, Pages 305-337

  Crauser, A ^a   Ferragina, P ^a,b   Mehlhorn, K ^a   Meyer, U ^a   Ramos, E A ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

External memory; Line segment intersections; Randomized algorithms

Indexed keywords

EID: 0035593602     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195901000523     Document Type: Article

References (49)

1. A. Aggarwal and J. S. Vitter. The Input/Output complexity of sorting and related problems. Comm. ACM 31 (1988), 1116-1127.
2. N. M. Amato, M. T. Goodrich, and E. A. Ramos. Computing faces in segment and simplex arrangements. In Proc. 27th Annu. ACM Sympos. Theory Comput., 1995, 672-682.
3. N. M. Amato, M. T. Goodrich, and E. A. Ramos. Computing the Arrangement of Curve Segments: Divide-and-Conquer Algorithms via Sampling. Short abstract in Proc. 9th Annu. ACM-SIAM Sympos. Discrete Algorithms, 2000, 705-706. Complete manuscript available from http://www.mpi-sb.mpg.de/∼ramos
4. N. M. Amato and E. A. Ramos. On computing Voronoi diagrams by divide-prune-and-conquer. In Proc. 12th Ann. ACM Sympos. Comput. Geom., 1996, 672-682.
5. L. Arge, P. Ferragina, R. Grossi, and J. S. Vitter. On sorting strings in external memory. Proc. 29th Annu. ACM Sympos. Theory Comput., 1997, 540-548.
6. L. Arge, D. E. Vengroff, and J. S. Vitter. External-memory algorithms for processing line segments in geographic information systems. In Proc. Annu. European Sympos. Algorithms, LNCS 979, 295-310, Springer, 1995.
7. I. J. Balaban. An optimal algorithm for finding segment intersections. In Proc. 11th Annu. ACM Sympos. Comput. Geom., 1995, 211-219.
8. R. D. Barve, E. F. Grove, and J. S. Vitter. Simple randomized mergesort on parallel disks. In Proc. ACM Sympos. Parallel Algorithms and Architectures, 1996, 109-118.
9. M. de Berg, M. van Kreveld, M. Overmars and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer, 1997.
10. J.-D. Boissonnat and M. Yvinec. Algorithmic Geometry. Cambridge University Press, 1998.
11. H. Brönnimann, B. Chazelle, and J. Matoušek. Product range spaces, sensitive sampling, and derandomization. SIAM J. Computing 28 (1999), 1552-1575.
12. B. Chazelle. An optimal convex hull algorithm in any fixed dimension. Discrete Comput. Geom. 10 (1993), 377-409.
13. B. Chazelle and H. Edelsbrunner. An optimal algorithm for intersecting line segments in the plane. J. ACM 39 (1992), 1-54.
14. B. Chazelle and J. Friedman. A deterministic view of random sampling and its use in geometry. Combinatorica 10 (1990), 229-249.
15. Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff and J. S. Vitter. External-memory graph algorithms. In Proc. ACM-SIAM Sympos. on Discrete Algorithms, 1995, 139-149.
16. K. L. Clarkson. Randomized geometric algorithms. In D.-Z. Du and F.K. Hwang, eds., Computing in Euclidean Geometry, Vol.1 of Lecture Notes Series on Computing, pages 117-162. World Scientific, Singapore, 1992.
17. K. L. Clarkson, R. Cole, and R. Tarjan. Randomized parallel algorithms for trapezoidal diagrams. Int. J. Comput. Geom. & Appls. (1992), 117-133.
18. K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4 (1989), 387-421.
19. A. Crauser and K. Mehlhorn. LEDA-SM, extending LEDA to secondary memory. In Workshop on Algorithm Engineering, LNCS 1668, 228-242, Springer, 1999.
20. R. F. Cromp. An intelligent information fusion system for handling the archiving and querying of terabyte-sized spatial databases. In S. R. Tate ed., Report on the Workshop on Data and Image Compression Needs and Uses in Scientific Community, CESDIS TR-93-99, 75-84, 1993.
21. F. Dehne, W. Dittrich, and D. Hutchinson. Efficient external memory algorithms by simulating coarse-grained parallel algorithms. ACM Sympos. Parallel Algorithms and Architectures, 1997, 106-115.
22. H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer, Heidelberg, 1987.
23. H. Edelsbrunner and E. P. Mücke. Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graph. 9 (1990), 66-104.
24. I. Z. Emiris, J. F. Canny and R. Seidel. Efficient perturbations for handling geometric degeneracies. Algorithmica 19 (1997), 219-242.
25. P. Ferragina and R. Grossi. The String B-Tree: A New Data Structure for String Search in External Memory and its Applications. J. ACM 46 (1999), 236-280.
26. G. A. Gibson, J. S. Vitter, and J. Wilkes. Report of the working group on storage I/O issues in large-scale computing. ACM Computing Surveys, 28 (1996).
27. M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry. In Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci., 1993, 714-723.
28. D. Haussler and E. Welzl. Epsilon-nets and simplex range queries. Discrete Comput. Geom. 2 (1987), 127-151.
29. R. Klein. Concrete and Abstract Voronoi diagrams. LNCS 400, Springer, 1988.
30. R. Laurini and A. D. Thompson. Fundamentals of Spatial Information Systems. A.P.I.C. Series, Academic Press, NY 1992.
31. J. Matoušek. Cutting hyperplane arrangements. Discrete Comput. Geom. 6 (1991), 385-406.
32. J. Matoušek. Derandomization in computational geometry. J. Algorithms 20 (1996), 545-580.
33. K. Mehlhorn and S. Näher. LEDA: A platform for combinatorial and geometric computing. Comm. ACM 38 (1995), 96-102.
34. K. Mulmuley. A fast planar partition algorithm, I. In Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci., 1988, 580-589.
35. K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, Englewood Cliffs, NJ, 1993.
36. K. Mulmuley and S. Sen. Dynamic point location in arrangements of hyperplanes. Discrete Comput. Geom., 8 (1992), 335-360.
37. M. H. Nodine and J. S. Vitter. Greed sort: An optimal sorting algorithm for multiple disks. J. ACM (1995), 919-933.
38. M. H. Nodine and J. S. Vitter. Deterministic Distribution Sort in Shared and Distributed Memory Multiprocessors Proc. ACM Sympos. Parallel Algorithms and Architectures, 1993, 120-129.
39. J. Pach and P. K. Agarwal. Combinatorial Geometry. Wiley-Interscience, 1995.
40. Yale N. Patt. The I/O subsystem - a candidate for improvement. Guest Editor's Introduction in IEEE Computer 27 (1994), 15-16.
41. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer, New York, 1985.
42. J.H. Reif and S. Sen. Optimal parallel randomized algorithms for three-dimensional convex hulls and related problems. SIAM J. Comput. 21 (1992), 466-485.
43. H. Samet. Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison Wesley, MA 1989.
44. R. Seidel. Backward analysis of randomized geometric algorithms. In New Trends in Discrete and Computational Geometry (J. Pach, ed.), Algorithms and Combinatorics, Vol. 10, 37-67, Springer, 1993.
45. J. Sibeyn and M. Kaufmann. BSP-like external-memory computation. Proc. of Italian Conference on Algorithms and Complexity, 1997.
46. D. E. Vengroff. TPIE User Manual and Reference. Duke University, Technical Report 1995.
47. J. S. Vitter and E. A. M. Shriver. Algorithms for parallel memory, I: Two-level memories. Algorithmica 12 (1994), 110-147.
48. J. S. Vitter. External Memory Algorithms. Proc. European Symposium on Algorithms, LNCS 1461, Springer, 1998.
49. C. K. Yap. A geometric consistency theorem for a symbolic perturbation scheme. J. Comput. Syst. Sci. 39 (1989), 236-246.