Space-time tradeoffs for emptiness queries

SIAM Journal on Computing

Volumn 29, Issue 6, 2000, Pages 1968-1996

  Erickson, Jeff ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; DATA STRUCTURES; DIGITAL ARITHMETIC; GRAPH THEORY; POLYNOMIALS; SET THEORY;

PARTITION GRAPHS; SPACE-TIME TRADEOFFS;

QUERY LANGUAGES;

EID: 0034481485     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539798337212     Document Type: Article

References (58)

1. P. K. AGARWAL AND J. ERICKSON. Geometric range searching and its relatives, in Advances in Discrete and Computational Geometry, B. Chazelle, J. E. Goodman, and R. Pollack, eds., Contemp. Math. 223, Amer. Math. Soc., Providence, RI, 1999, pp. 1-56.
2. P. K. AGARWAL AND J. MATOUŠEK, Ray shooting and parametric search, SIAM J. Comput., 22 (1993), pp. 794-806.
3. A. AGGARWAL, M. HANSEN, AND T. LEIGHTON, Solving query-retrieval problems by compacting Voronoi diagrams, in Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, Baltimore, MD, 1990, pp. 331-340.
4. A. ANDERSSON, Sublogarithmic searching without multiplications, in Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, Milwaukee, WI, 1995, pp. 655-663.
5. A. ANDERSSON, Faster deterministic sorting and searching in linear space, in Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, Burlington, VT, 1996, pp. 135-141.
6. A. ANDERSSON AND K. SWANSON, On the difficulty of range searching, Comput. Geom., 8 (1997), pp. 115-122.
7. S. ARYA AND D. M. MOUNT, Approximate range searching, in Proceedings of the 11th Annual ACM Symposium on Computational Geometry, Vancouver, British Columbia, Canada, 1995, pp. 172-181.
8. M. BEN-OR, Lower bounds for algebraic computation trees, in Proceedings of the 15th Annual ACM Symposium on the Theory of Computing, Boston, MA, 1983, pp. 80-86.
9. A. BORODIN, R. OSTROVSKY, AND Y. RABANI, Lower bounds for high dimensional nearest neighbor search and related problems, in Proceedings of the 31st Annual ACM Symposium on the Theory of Computing, Atlanta, GA, 1999, pp. 312-321.
10. H. BRÖNNIMANN, B. CHAZELLE, AND J. PACH, How hard is halfspace range searching?, Discrete Comput. Geom., 10 (1993), pp. 143-155.
11. T. M. CHAN, Fixed-dimensional linear programming queries made easy, in Proceedings of the 12th Annual ACM Symposium on Computational Geometry, Philadelphia, PA, 1996, pp. 284-290.
12. T. M. CHAN, Output-sensitive results on convex hulls, extreme points, and related problems, Discrete Comput. Geom., 16 (1996), pp. 369-387.
13. B. CHAZELLE, A functional approach to data structures and its use in multidimensional searching, SIAM J. Comput., 17 (1988), pp. 427-462.
14. B. CHAZELLE, Lower bounds on the complexity of polytope range searching, J. Amer. Math. Soc., 2 (1989), pp. 637-666.
15. B. CHAZELLE, Lower bounds for orthogonal range searching, I: The reporting case, J. ACM, 37 (1990), pp. 200-212.
16. B. CHAZELLE, Lower bounds for orthogonal range searching, II: The arithmetic model. J. ACM, 37 (1990), pp. 439-463.
17. B. CHAZELLE, Cutting hyperplanes for divide-and-conquer, Discrete Comput. Geom., 9 (1993), pp. 145-158.
18. B. CHAZELLE, Lower bounds for off-line range searching, Discrete Comput. Geom., 17 (1997), pp. 53-66.
19. B. CHAZELLE, H. EDELSBRUNNER, L. J. GUIBAS, AND M. SHARIR, Algorithms for bichromatic line segment problems and polyhedral terrains, Algorithmica, 11 (1994), pp. 116-132.
20. B. CHAZELLE AND J. FRIEDMAN, Point location among hyperplanes and unidirectional ray-shooting, Comput. Geom., 4 (1994), pp. 53-62.
21. B. CHAZELLE, L. J. GUIBAS, AND D. T. LEE, The power of geometric duality, BIT, 25 (1985), pp. 76-90.
22. B. CHAZELLE AND B. ROSENBERG, Simplex range reporting on a pointer machine, Comput. Geom. Theory Appl., 5 (1996), pp. 237-247.
23. K. CLARKSON, H. EDELSBRUNNER, L. J. GUIBAS, M. SHARIR, AND E. WELZL, Combinatorial complexity bounds for arrangements of curves and spheres, Discrete Comput. Geom., 5 (1990), pp. 99-160.
24. K. L. CLARKSON, An algorithm for approximate closest-point queries, in Proceedings of the 10th Annual ACM Symposium on Computational Geometry, Stony Brook, NY, 1994, pp. 160-164.
25. M. DE BERG, M. OVERMARS, AND O. SCHWARZKOPF, Computing and verifying depth orders, SIAM J. Comput., 23 (1994). pp. 437-446.
26. D. P. DOBKIN AND D. G. KIRKPATRICK, Determining the separation of preprocessed polyhedra - a unified approach, in Proceedings of the 17th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Comput. Sci. 443, Springer-Verlag, New York, 1990, pp. 400-413.
27. R. DWYER AND W. EDDY, Maximal empty ellipsoids, Internat. J. Comput. Geom. Appl., 6 (1996), pp. 169-186.
28. H. EDELSBRUNNER AND M. H. OVERMARS, Batched dynamic solutions to decomposable searching problems, J. Algorithms, 6 (1985), pp. 515-542.
29. J. ERICKSON, On the relative complexities of some geometric problems, in Proceedings of the Seventh Canadian Conference on Computational Geometry, Quebec City, Quebec, Canada, 1995, pp. 85-90.
30. J. ERICKSON, New lower bounds for halfspace emptiness, in Proceedings of the 37th Annual IEEE Symposium on the Foundations of Computer Science, Burlington, VT, 1996, pp. 472-481.
31. J. ERICKSON, New lower bounds for Hopcroft's problem, Discrete Comput. Geom., 16 (1996), pp. 389-418.
32. J. ERICKSON, Space-time tradeoffs for emptiness queries, in Proceedings of the 13th Annual ACM Symposium on Computational Geometry, Nice, France. 1997, pp. 304-313.
33. M. L. FREDMAN, Lower bounds on the complexity of some optimal data structures, SIAM J. Comput., 10 (1981), pp. 1-10.
34. J. E. GOODMAN AND R. POLLACK, Allowable sequences and order types in discrete and computational geometry, in New Trends in Discrete and Computational Geometry, J. Pach, ed., Algorithms Combin. 10. Springer-Verlag, Berlin. 1993, pp. 103-134.
35. L. GUIBAS, M. OVERMARS, AND J.-M. ROBERT, The exact fitting problem in higher dimensions, Comput. Geom., 6 (1996), pp. 215-230.
36. M. HENK, J. RICHTER-GEBERT, AND G. M. ZIEGLER, Basic properties of convex polytopes, in Handbook of Discrete and Computational Geometry. J. E. Goodman and J. O'Rourke, eds., CRC Press LLC, Boca Raton, FL, 1997, pp. 243-270.
37. J. KLEINBERG, Two algorithms for nearest-neighbor search in high dimension, in Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, El Paso, TX, 1997, pp. 599-608.
38. J. MATOUŠEK, Efficient partition trees, Discrete Comput. Geom., 8 (1992), pp. 315-334.
39. J. MATOUŠEK, Reporting points in halfspaces, Comput. Geom., 2 (1992), pp. 169-186.
40. J. MATOUŠEK, Linear optimization queries, J. Algorithms, 14 (1993), pp. 432-448.
41. J. MATOUŠEK, On vertical ray shooting in arrangements, Comput. Geom., 2 (1993). pp. 279-285.
42. J. MATOUŠEK, Range searching with efficient hierarchical cuttings, Discrete Comput. Geom., 10 (1993), pp. 157-182.
43. J. MATOUŠEK, Geometric range searching, ACM Comput. Surv., 26 (1994), pp. 421-461.
44. J. MATOUŠEK AND O. SCHWARZKOPF, On ray shooting in convex polytopes, Discrete Comput. Geom., 10 (1993), pp. 215-232.
45. P. B. MILTERSON, Lower bounds for Union-Split-Find related problems on random access machines, in Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, Montreal, Quebec, Canada, 1994, pp. 625-634.
46. P. B. MILTERSON, N. NISAN, S. SAFRA, AND A. WIDGERSON, On data structures and asymmetric communication complexity, J. Comput. System Sci., 57 (1998), pp. 37-49.
47. M. H. OVERMARS, Efficient data structures for range searching on a grid, J. Algorithms, 9 (1988), pp. 254-275.
48. J. PACH AND P. K. AGARWAL, Combinatorial Geometry, John Wiley & Sons, New York, 1995.
49. F. P. PREPARATA AND M. I. SHAMOS, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
50. J. M. STEELE AND A. C. YAO, Lower bounds for algebraic decision trees, J. Algorithms, 3 (1982), pp. 1-8.
51. J. STOLFI, Oriented Protective Geometry: A Framework for Geometric Computations, Academic Press, New York, 1991.
52. L. SZÉKELY, Crossing numbers and hard Erdös problems in discrete geometry, Combin., Probab., Comput., 6 (1997), pp. 353-358.
53. E. SZEMERÉDI AND W. TROTTER, JR., Extremal problems in discrete geometry, Combinatorica, 3 (1983), pp. 381-392.
54. R. E. TARJAN, A class of algorithms which require nonlinear time to maintain disjoint sets, J. Comput. System Sci., 18 (1979), pp. 110-127.
55. D. E. WILLARD, Log-logarithmic worst case range queries are possible in space Θ(n), Inform. Process. Lett., 17 (1983), pp. 81-89.
56. A. C. YAO, On the complexity of maintaining partial sums, SIAM J. Comput., 14 (1985), pp. 277-288.
57. A. C.-C. YAO, Should tables be sorted?, J. ACM, 28 (1981), pp. 615-628.
58. G. M. ZIEGLER, Lectures on Polytopes, Grad. Texts in Math. 152, Springer-Verlag, Heidelberg, 1994.