A. Crauser
P. Ferragina
K. Mehlhorn
- 1.A. Aggarwal and J. S. Vitter. The Input/Output complexity of sorting and related problems. Communications of the ACM, 31(9):1116-1127, 1988. Google Scholar
Digital Library
- 2.N.M. Amato, M. T. Goodrich, and E. A. Ramos. Computing faces in segment and simplex arrangements. In Proc. 27th Annu. A CM Sympos. Theory Oomput., 672--682, 1995. Google ScholarDigital Library
- 3.N. M. Amato and E. A. Ramos. On computing Voronoi diagrams by divide-prune-and-conquer. In Proc. 12th Annual ACM Sympos. Comput. Geom., 199{}. 672-682, 1995. Google ScholarDigital Library
- 4.L. Arge, P. Ferragina, R. Grossi, and J. S. Vitter. On t:orting strings in external memory. Proc. A CM Symposium on the Theory of Computing (STOC '97), 540-548, 1997. Google ScholarDigital Library
- 5.L. Arge, D. E. Vengroff, and J. S. Vitter. External-memory algorithms for processing line segments in geographic information systems. In Proc. Annual European Sympo.#ium on Algorithms, LNCS 979, 295-310, 1995. Google ScholarDigital Library
- 6.R.D. Barve, E.F. Grove and J.S. Vitter. Simple randomized mergesort on parallel disks. In Proc. IEEE Syrup. on Foundations of Comp. Sci., 1996.Google ScholarDigital Library
- 7.H. Brgnnimann, B. Chazelle, and J. Matou#ek. Product range spaces, sensitive sampling, and derandomization, in Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci., 1993, 400-4O9.Google Scholar
- 8.B. Chazelle. An optimal convex hull algorithm in any fixed dimension. Discrete Comput. Geom. 10 (1993) 377-409.Google ScholarDigital Library
- 9.B. Chazelle and H. Edelsbrunner. An optimal algorithm for intersecting line segments in the plane. J. A CM 39 (1992) 1-54. Google ScholarDigital Library
- 10.B. Chazelle and j. Friedman. A deterministic view of random sampling and its use in geometry. Oombinatorica 10 (1990) 229-249.Google ScholarCross Ref
- 11.Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tama#sia, D. E. Vengroff, and J. S. Vitter. External-memory graph algorithms. In Proc. A GM-SIAM Syrup. on Discrete Algorithms, 139-149, 1995. Google ScholarDigital Library
- 12.K.L. Clarkson. Randomized geometric algorithms. In D.- Z. Du and F.K.Hwang, eds., Computing in Euclido#n Gcomefry, Vol.1 of Lecture Notes Series on Computing, pag, e# 117-162. World Scientific, Singapore, 1992.Google Scholar
- 13.K. L. Clarkson, 1%. Cole, and 1%. Tarjan. Randomized parallel algorithms for trapezoidal diagrams. International Journal of Computational Geometry # Applications, pp. 117-1 33, 1992.Google ScholarCross Ref
- 14.K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Gomput. Geom., 4 (1989) 387-421.Google ScholarDigital Library
- 15.A. Crauser and K. Mehlhorn. LEDA-SM, a platform for secondary memory computation, 1998, see WEB.pages of the authors.Google Scholar
- 16.I%. F. Cromp. An intelligent information fusion system for handling the archiving and querying of terabyte-sizcd spatial databases. In S. R. Tare eel., Report. on the Work.#hop on Data and Image Compression Needs and Uae# in Scientific Community, CESDIS TR-93-99, 75-84, 1993.Google Scholar
- 17.F. Dehne, W. Dittrich, and D. Hutchinson. Efficient external memory algorithms by simulating coat.ze-grained parallel algori thms. A CM Symposium on Parallel Algorithms and Architectures, pp. 106-115, 1997'. Google ScholarDigital Library
- 18.H. Edelsbrunner. Algorithms in Oombinatoria! Geometry. Springer Verlag, Heidelberg, 1987. Google ScholarDigital Library
- 19.P. Ferragina and R. Grossi. A fully.dynarnie data structure for external substring search. In Proc. #Tth Annu. A CM Sympos. Theory Gomput., 693-702, 1995. Google ScholarDigital Library
- 20.G. A. Gibson, J. S. Vitter, and J. Wilkes. Report of the working group on storage I/O issues in large-scalo c,#mputing. A CM Computing Surveys, 28(4), December 1991;. Google ScholarDigital Library
- 21.M.T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry. In Proc. IEEE Syrup. on Foundations of Gomp. Sci., 714-723, 1993.Google Scholar
- 22.R. Klein. Concrete and Abstract Voronoi diagrams. LCNS 400, Springer-Verlag, 1988.Google Scholar
- 23.R. Laurinl and A. D. Thompson. Fundamentals of Spatial Information Systems. A.P.I.C. Series, Academic Press, NY 1992.Google Scholar
- 24.J, Matou#ek. Cutting hyperplane arrangements. Discrete Gomput. Geom. 6 (1991) 385--406. Google ScholarDigital Library
- 25.K. Mehlhom and S. N#iher. LEDA: A platform for combinatorial and geometric computing. Communications of the A OM 38 (1995) 96-102. Google ScholarDigital Library
- 26.K, Mulmuley, A fast planar partition algorithm, I. In Proc. 2#th Annu, IEEE Sympos, Found. Comput. Sei., 1988# 580- 589,Google Scholar
- 27.K, Mulmuley, Oomputational Geometry: An Introduction Throuoh Randomized Algorithms. Prentice Hall, Englewood Cllff#, NJ# 1993,Google Scholar
- 28.K. Mulmuley and S, Sen. Dynamic point location in arrangementB of hyperplanes. Discrete Oomput. Geom., 8 (1992) 335-360.Google ScholarDigital Library
- 29.M, H. Nodlne and J. S. Vitter. Greed sort: An optimal norttng algorithm for multiple disks. Journal of the A CM (1995) 010-933, Google ScholarDigital Library
- 30.Yalo N, Patt. The I/O subsystem--a candidate for improvement. Guest Editor's Introduction in IEEE Computer, 27(3):15-16, 1994. Google ScholarDigital Library
- 31.F. P, Proparata and M. I. Shamos. Oomputational Geometry: An Introduction. Sprlnger-Verlag, New York, 1985. Google ScholarDigital Library
- 32.J,It, Relf and S, Sen. Optimal parallel randomized algorithms for three-dimensional convex hulls and related problems, SIAM J. Comput, 21 (1992) 466--485. Google ScholarDigital Library
- 33.H. Samot. Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison Wesloy, MA 1989. Google ScholarDigital Library
- 34.R. Seldel. Backward analysis of randomized geometric algorithms. In New Trends in Discrete and Computational Geometry (J. Paeh, ed.), Algorithms and Combinatories, Vol. 10, Sprlngor.Verlag, 1993, pp. 37-67.Google Scholar
- 35.J. Slbeyn and M. Kaufmann. BSP-like external-memory computation. Proc. of Italian Conference on Algorithms and Gomplexity, 1997. Google ScholarDigital Library
- 36.D.E, Vengroff. TPIE User Manual and Reference. Duke UnlverBlty, Technical Report 1995.Google Scholar
- 37.D,E, Vengroff and J. Vitter. I/O-efficient scientific computation uslng TPIE. IEEE Symp. on Parallel and Distributed Computing, 1995, Google ScholarDigital Library
- 38.J, S, Vltter and E. A. M. Shriver. Algorithms for parallel memory# I. Two-level memories. Algorithmic.a, 12(2-3):110- 147, 1094.Google ScholarDigital Library
Index Terms
- Randomized external-memory algorithms for some geometric problems
Recommendations
Efficient randomized algorithms for some geometric optimization problems
In this paper we first prove the following combinatorial bound, concerning the complexity of the vertical decomposition of the minimization diagram of trivariate functions: Let $$\mathcal{F}$$ be a collection ofn totally or partially defined algebraic ...
Simple randomized algorithms for closest pair problems
We present a conceptually simple, randomized incremental algorithm for finding the closest pair in a set of n points in D-dimensional space, where D ≥ 2 is a fixed constant. Much of the work reduces to maintaining a dynamic dictionary. Using dynamic ...
Randomized algorithms
This tutorial will illustrate the power of randomization in algorithms. The history of algorithms begins with deterministic algorithms. Deterministic algorithms are more natural, are usually easier to analyze, and are usually easier to understand by ...
Comments