On approximating the depth and related problems

SIAM Journal on Computing

Volumn 38, Issue 3, 2008, Pages 899-921

  Aronov, Boris ^a   Har Peled, Sariel ^b  

^a POLYTECHNIC UNIVERSITY   (United States)

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

Author keywords

Approximation; Computational geometry; Randomized algorithms

Indexed keywords

APPROXIMATION; BLUE POINTS; DISK COVERINGS; FAST ALGORITHMS; LINEAR PROGRAMMING PROBLEMS; RANDOM SAMPLINGS; RANDOMIZED ALGORITHMS; RANGE QUERIES; RED POINTS; SPACE COMPLEXITIES;

APPROXIMATION ALGORITHMS; COMPUTATIONAL GEOMETRY; LINEAR PROGRAMMING; LINEARIZATION;

PROBLEM SOLVING;

EID: 55249118861     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/060669474     Document Type: Article

References (38)

1. S. ARORA, L. BABAI, J. STERN, AND Z. SWEEDYK, The hardness of approximate optima in lattices, codes, and systems of linear equations, J. Comput. System Sci., 54 (1997), pp. 317-331.
2. 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., AMS, Providence, RI, 1999, pp, 1-56.
3. P. K. AGARWAL A. EFRAT, AND M. SHARIR, Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications, SIAM J. Comput., 29 (1999), pp, 912-953.
4. B. ARONOV AND S. HAR-PELED, On approximating the depth and related problems, in Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2005, pp, 886-894.
5. B. ARONOV, S. HAR-PELED, AND M. SHARIR, On approximate halfspace range counting and relative epsilon-approximations, in Proceedings of the 23rd Annual ACM Symposium on Computational Geometry, ACM, New York, 2007, pp. 327-336.
6. E. AMALDI AND V. KANN, The complexity and approximability of finding maximum feasible subsystems of linear relations, Theoret. Comput. Sci., 147 (1995), pp. 181-210.
7. S. ARYA AND D. M. MOUNT, Approximate range searching, Comput. Geom., 17 (2000), pp. 135-152.
8. H. BRÖNNIMANN, B. CHAZELLE, AND J. PACH, How hard is halfspace range searching?, Discrete Comput. Geom., 10 (1993), pp. 143-155.
9. J.-D. BOISSONNAT AND M. YVINEC, Algorithmic Geometry, Cambridge University Press, Cambridge, UK, 1998; also available online from http://www.inria.fr/prisme/personnel/yvinec/livre.html.
10. T. M. CHAN, Random sampling, halfspace range reporting, and construction of (≤ k)-levels in three dimensions, SIAM J. Comput., 30 (2000), pp. 561-575.
11. T. M. CHAN, Low-dimensional linear programming with violations, SIAM J. Comput., 34 (2005), pp. 879-893; also available online from http://www.math.uwaterloo.ca/̃tmchan/pub.html.
12. E. COHEN, Size-estimation framework with applications to transitive closure and reachability, J. Comput. System Sci., 55 (1997), pp. 441-453.
13. K. L. CLARKSON AND P. W. SHOR, Applications of random sampling in computational geometry II, Discrete Comput. Geom., 4 (1989), pp. 387-421.
14. M. DE BERG, M. VAN KREVELD, M. H. OVERMARS, AND O. SCHWARZKOPF, Computational Geometry: Algorithms and Applications, 2nd ed., Springer-Verlag, New York, 2000; also available online from http://www.cs.uu.nl/geobook/.
15. R. O. DUDA, P. E. HART, AND D. G. STORK, Pattern Classification, 2nd ed., Wiley-Interscience, New York. 2001.
16. D. P. DOBKIN AND D. G. KIRKPATRICK, A linear algorithm for determining the separation of convex polyhedra, J. Algorithms, 6 (1985), pp. 381-392.
17. 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.
18. H. EDELSBRUNNER, Algorithms in Combinatorial Geometry, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Heidelberg, 1987.
19. A. EFRAT, The complexity of the union of (α,β)- covered objects, SIAM J. Comput., 34 (2005), pp. 775-787.
20. E. EZRA, D. HALPERIN, AND M. SHARIR, Speeding up the incremental construction of the union of geometric objects in practice, Comput. Geom., 27 (2004), pp. 63-85.
21. 2) problems in computational geometry, Comput. Geom., 5 (1995), pp. 165-185; also available online from http://archive.cs.uu.nl/pub/RUU/ CS/techreps/CS-1993/1993-15.ps.gz.
22. S. HAR-PELED AND P. INDYK, When crossings count - approximating the minimum spanning tree, in Proceedings of the 16th Annual ACM Symposium on Computational Geometry, ACM, New York, 2000, pp. 166-175; also available online from http://www.uiuc.edu/̃sariel/papers/ 99/mst.html.
23. S. HAR-PELED AND Y. WANG, Shape fitting with outliers, SIAM J. Comput., 33 (2004), pp. 269-285.
24. P. INDYK AND R. MOTWANI, Approximate nearest neighbors: Towards removing the curse of dimensionality, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, ACM, New York, 1998, pp. 604-613; also available online from http://theory.lcs.mit.edu/ ̃indyk/nndraft.ps.
25. P. INDYK, High-Dimensional Computational Geometry, Ph.D. thesis, Stanford University, Stanford, CA, 2000; also available online from http://theory.lcs.mit.edu/̃indyk/thesis.html.
26. K. KEDEM, R. LIVNE, J. PACH, AND M. SHARIR, On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete Comput. Geom., 1 (1986), pp. 59-71.
27. H. KAPLAN AND M. SHARIR Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting, in Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2006, pp. 484-493.
28. J. MATOUŠEK, Randomized optimal algorithm for slope selection, Inform, Process. Lett., 39 (1991), pp. 183-187.
29. J. MATOUŠEK, Reporting points in halfspaces, Comput. Geom., 2 (1992), pp. 169-186.
30. J. MATOUŠEK, Range searching with efficient hierarchical cuttings, Discrete Comput. Geom., 10 (1993), pp, 157-182.
31. J. MATOUŠEK, On geometric optimization with few violated constraints. Discrete Comput. Geom., 14 (1995), pp. 365-384.
32. J. MATOUŠEK, J. PACH, M. SHARIR, S. SIFRONY, AND E. WELZL, Fat triangles determine linearly many holes, SIAM J. Comput., 23 (1994), pp. 154-169.
33. R. MOTWANI AND P. RAGHAVAN, Randomized Algorithms, Cambridge University Press, New York, 1995; also available online from http://us.cambridge.org/titles/catalogue.asp?isbn=0521474655.
34. K. MULMULEY. On levels in arrangements and Voronoi diagrams, Discrete Comput. Geom., 6 (1991), pp. 307-338.
35. M. SHARIR AND P. K. AGARWAL, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, New York, 1995; also available online from http://us.Cambridge.org/titles/catalogue.asp?isbn=0521470250.
36. M. SHARIR, On k-sets in arrangements of curves and surfaces, Discrete Comput. Geom., 6 (1991), pp. 593-613.
37. M. SHARIR, The Clarkson-Shor technique revisited and extended, Combim Probab. Comput., 12 (2003), pp. 191-201.
38. V. N. VAPNIK AND A. Y. CHERVONENKIS, On the uniform convergence of relative frequencies of events to their probabilities, Theory Probab. Appl., 16 (1971), pp, 264-280.