Selecting distances in arrangements of hyperplanes spanned by points

Journal of Discrete Algorithms

Volumn 2, Issue 3, 2004, Pages 333-345

  Bespamyatnikh, Sergei ^a   Segal, Michael ^b  

^a The University of Texas at Dallas   (United States)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Counting; Distance selection problem; Lower bound; Parametric search

Indexed keywords

ALGORITHMS; DATA ACQUISITION; DECISION MAKING; INTEGER PROGRAMMING; SET THEORY; SORTING;

COUNTING; DISTANCE SELECTION PROBLEMS; LOWER BOUND; PARAMETRIC SEARCH;

PROBLEM SOLVING;

EID: 10644291860     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2003.12.001     Document Type: Article

References (22)

1. P. Agarwal, M. Sharir, Planar geometric location problems, Algorithmica 11 (1994) 185-195.
2. P. Agarwal, B. Aronov, M. Sharir, S. Suri, Selecting distances in the plane, Algorithmica 9 (1993) 495-514.
3. M. Ajtai, J. Komlos, E. Szemeredi, An (n log n) sorting network, Combinatorica 3 (1983) 1-19.
4. J. Basch, Kinetic data structures, PhD Thesis, Stanford University, USA, 1999.
5. J. Basch, L. Guibas, J. Hershberger, Data structures for mobile data, in: Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, 1997, pp. 747-756.
6. H. Brönnimann, B. Chazelle, Optimal slope selection via cuttings, Comput. Geom. Theory Appl. 10 (1) (1998) 23-29.
7. T. Chan, On enumerating, in: Proc. 14th Annu. ACM Sympos. Comput. Geom., 1998, pp. 279-286.
8. R. Cole, Slowing down sorting networks to obtain faster sorting algorithms, J. ACM 34 (1987) 200-208.
9. R. Cole, J. Salowe, W. Steiger, E. Szemerédi, An optimal-time algorithm for slope selection, SIAM J. Comput. 18 (4) (1989) 792-810.
10. M.B. Dillencourt, D.M. Mount, N.S. Netanyahu, A randomized algorithm for slope selection, Internat. J. Comput. Geom. Appl. 2 (1992) 1-27.
11. A. Efrat, M. Sharir, A. Ziv, Computing the smallest k-enclosing circle and related problems, Comput. Geom. Theory Appl. 4 (1994) 119-136.
12. J. Erickson, On the relative complexities of some geometric problems, in: Proceedings of the 7th Canadian Conference on Computational Geometry, 1995, pp. 85-90.
13. J. Erickson, Lower bounds for fundamental geometric problems, PhD Thesis, University of California at Berkeley, 1996.
14. 2) problems in computational geometry, Comput. Geom. Theory Appl. 5 (1995) 165-185.
15. M. Goodrich, Geometric partitioning made easier, even in parallel, in: Proc. 9th Annu. ACM Sympos. Comput. Geom., 1993, pp. 73-82.
16. P. Gupta, R. Janardan, M. Smid, Algorithms for some intersection searching problems involving curved objects, Internat. J. Math. Algorithms 1 (1999) 35-52.
17. M.J. Katz, M. Sharir, Optimal slope selection via expanders, Inform. Process. Lett. 47 (1993) 115-122.
18. J. Matoušek, Randomized optimal algorithm for slope selection, Inform. Process. Lett. 39 (1991) 183-187.
19. D. Mount, N. Netanyahu, Efficient algorithms for robust circular arc estimators, in: Proc. 5th Canad. Conf. Comput. Geom., 1993, pp. 79-84.
20. D. Mount, N. Netanyahu, Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses, Comput. Geom. Theory Appl. 19 (2001) 1-33.
21. N. Megiddo, Applying parallel computation algorithm in the design of serial algorithms, J. ACM 30 (1983) 852-865.
22. F. Preparata, M. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.