External-memory computational geometry

In this paper we give new techniques for designing efficient algorithms for computational geometry problems that are too large to be solved in internal memory. We use these techniques to develop optimal and practical algorithms for a number of important large-scale problems. We discuss our algorithms primarily in the context of single processor/single disk machines, a domain in which they are not only the first known optimal results but also of tremendous practical value. Our methods also produce the first known optimal algorithms for a wide range of two-level and hierarchical multilevel memory models, including parallel models. The algorithms are optimal both in terms of I/O cost and internal computation.<<ETX>>

[1]  Proposal.  Massive Information Storage, Management, and Use , 1989 .

[2]  Gabriel M. Kuper,et al.  Constraint Query Languages , 1995, J. Comput. Syst. Sci..

[3]  David Maier,et al.  Readings in Object-Oriented Database Systems , 1989 .

[4]  F. P. Preparata,et al.  Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.

[5]  Michael T. Goodrich.  Constructing the Convex Hull of a Partially Sorted Set of Points , 1992, Comput. Geom..

[6]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[7]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[8]  Jeffrey Scott Vitter,et al.  Optimal cooperative search in fractional cascaded data structures , 1990, SPAA '90.

[9]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[10]  Ronald L. Graham,et al.  An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..

[11]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[12]  Jeffrey Scott Vitter,et al.  Efficient memory access in large-scale computation (invited paper) , 1991 .

[13]  Jeffrey Scott Vitter,et al.  Deterministic distribution sort in shared and distributed memory multiprocessors , 1993, SPAA '93.

[14]  Donald Ervin Knuth,et al.  The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .

[15]  Randy H. Katz,et al.  A case for redundant arrays of inexpensive disks (RAID) , 1988, SIGMOD '88.

[16]  Alok Aggarwal,et al.  Hierarchical memory with block transfer , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[17]  David G. Kirkpatrick,et al.  The Ultimate Planar Convex Hull Algorithm? , 1986, SIAM J. Comput..

[18]  Derek Thompson,et al.  Fundamentals of spatial information systems , 1992, A.P.I.C. series.

[19]  Richard M. Karp,et al.  Probabilistic recurrence relations , 1994, JACM.

[20]  John H. Reif,et al.  Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems , 1992, SIAM J. Comput..

[21]  Bowen Alpern,et al.  A model for hierarchical memory , 1987, STOC.

[22]  David K. Gifford,et al.  The TWA reservation system , 1984, CACM.

[23]  Michael T. Goodrich.  Geometric partitioning made easier, even in parallel , 1993, SCG '93.

[24]  Mikhail J. Atallah,et al.  On the parallel decomposability of geometric problems , 1989, SCG '89.

[25]  Jeffrey Scott Vitter,et al.  Efficient Memory Access in Large-Scale Computation , 1991, STACS.

[26]  H KatzRandy,et al.  A case for redundant arrays of inexpensive disks (RAID) , 1988 .

[27]  Jeffrey Scott Vitter,et al.  Optimal disk I/O with parallel block transfer , 1990, STOC '90.

[28]  Alok Aggarwal,et al.  The input/output complexity of sorting and related problems , 1988, CACM.

[29]  David Maier,et al.  Hysterical B-trees , 1981, Inf. Process. Lett..

[30]  Robert E. Tarjan,et al.  Making data structures persistent , 1986, STOC '86.

[31]  Douglas Comer,et al.  Ubiquitous B-Tree , 1979, CSUR.