Dynamic half-space reporting, geometric optimization, and minimum spanning trees

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 1992-October, Issue , 1992, Pages 80-89

  Agarwal, Pankaj K ^a   Eppstein, David ^b   Matousek, Jin ^c,d  

^a DUKE UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c CHARLES UNIVERSITY   (Czech Republic)

^d FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; LINEAR PROGRAMMING; TREES (MATHEMATICS);

DYNAMIC ALGORITHM; DYNAMIC DATA STRUCTURE; EUCLIDEAN MINIMUM SPANNING TREES; GEOMETRIC OPTIMIZATION; GEOMETRIC PROBLEMS; HALF SPACES; MINIMUM SPANNING TREES; NEIGHBOR SEARCHING;

GEOMETRY;

EID: 84950158692     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1992.267816     Document Type: Conference Paper

References (34)

1. P.K. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl. Euclidean minimum spanning trees and trichromatic closest pairs. Proc. 6th ACM Symp. Corn-put. Geom. (1990) 203-210. SIAM J. Comput., to appear.
2. P.K. Agarwal and J. Matousek. Ray shooting and parametric search. Proc. 24th ACM Symp. Theory of Computing (1992) 517-526.
3. P.K. Agarwal and M. Sharir. Planar geometric location problems and maintaining the width of a planar set. Proc. 2nd ACM/SIAM Symp. Discrete Algorithms (1991) 449-458.
4. P.K. Agarwal and M. Sharir. Applications of a new partitioning scheme. Discrete Comput. Geom. to appear.
5. J. Bentley and J. Saxe. Decomposable searching problems I: Static-to-dynamic transformation. J. Algorithms 1 (1980) 301-358.
6. B. Chazelle. An optimal algorithm for computing convex layers. IEEE Trans. Information Theory IT-31 (1985) 509-517.
7. B. Chazelle, L. Guibas, H. Edelsbrunner, and M. Sharir. Diameter, width, closest line pair, and parametric searching. Proc. 8th ACM Symp. Computational Geometry (1992) 120-129.
8. B. Chazelle, L. Guibas, and D. T. Lee. The power of geometric duality. BIT 25 (1985) 76-90.
9. B. Chazelle and F. P. Preparata. Halfspace range searching: An algorithmic application of k-sets. Discrete Comput. Geom. 1 (1986) 83-93.
10. B. Chazelle, M. Sharir, and E. Welzl. Quasi-optimal upper bounds for simplex range searching and new zone theorems. Proc. 6th ACM Symp. Computational Geometry (1990) 23-33.
11. Yi Chiang and R. Tamassia. Dynamic algorithms in computational geometry. Tech. Rept. CS-91-24, Dept. Computer Science, Brown University, 1991.
12. K. L. Clarkson. New applications of random sampling in computational geometry. Discrete Comput. Geom. 2 (1987) 195-222.
13. K. L. Clarkson. A randomized algorithm for closest-point queries. SIAM J. Comput. 17 (1988) 830-847.
14. K. L. Clarkson and P. Shor. New applications of random sampling in computational geometry II. Discrete Comput. Geom. 4 (1989) 387-421.
15. T. Coreman, C. Leiserson and R. Rivest. Introduction to Algorithms, The MIT Press, Cambridge, MA, 1990.
16. D. Dobkin and S. Suri. Dynamically computing the maxima of decomposable functions, with applications. J. ACM3S (1991) 275-298.
17. H. Edelsbrunner and M. Overmars. Batched dynamic solutions to decomposable searching problems. J. Algorithms 6 (1985) 515-542.
18. D. Eppstein. Offline algorithms for dynamic minimum spanning tree problems. Proc. 2nd Worksh. Algorithms and Data Structures, Springer-Verlag LNCS 519 (1991) 392-399.
19. D. Eppstein. Dynamic three-dimensional linear programming. Proc. 32nd IEEE Symp. Found. Computer Science (1991) 488-494. ORSA J. Comput., to appear.
20. D. Eppstein and J. Erickson. Iterated nearest neighbors and finding minimal polytopes. Manuscript, 1992.
21. D. Eppstein, Z. Galil, G.F. Italiano, and A. Nis-sentzweig. Sparsification - A technique for speeding up dynamic graph algorithms. Proc. 32nd IEEE Symp. Found. Computer Science (1992), this proceedings.
22. G.N. Frederickson. Data structures for on-line updating of minimum spanning trees, with applications. SIAM J. Comput. 14 (1985) 781-798.
23. J. Hershberger and S. Suri. Offline maintenance of planar configurations. Proc. 2nd ACM/SIAM Symp. Discrete Algorithms (1991) 32-41.
24. J. Matousek. Reporting points in halfspaces. Proc. 32nd IEEE Symp. Found. Computer Science (1991) 207-215.
25. J. Matousek and O. Schwarzkopf. Linear optimization queries. Proc. 8th ACM Symp. Computational Geometry (1992) 16-25.
26. N. Megiddo. Linear-time algorithms for linear programming in R3 and related problems. SIAM J. Computing 12 (1983) 720-732.
27. K. Mehlhorn. Multi-dimensional Searching and Computational Geometry. Springer-Verlag, Belin-Heidelberg-New York, 1985.
28. M. Overmars and H. van Leeuwen. Maintenance of configurations in the plane. J. Comput. Sys. Sci. 23 (1981), 166-204.
29. F. Preparata and M. Shamos. Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
30. F. Preparata and R. Tamassia. Efficient point location in a spatial cell complex. SIAM J. Comput. 21 (1992) 267-280.
31. N. Sarnak and R. Tarjan. Planar point location using persistent search trees, Commun. ACM 29 (1986) 669-679.
32. M. Smid. Maintaining the minimal distance of a point set in polylogarithmic time. Proc. 2nd ACM/SIAM Symp. Discrete Algorithms (1991) 1-6.
33. K.J. Supowit. New techniques for some dynamic closest-point and farthest-point problems. Proc. 1st ACM/SIAM Symp. Discrete Algorithms (1990) 84-90.
34. P.M. Vaidya. Geometry helps in matching. SIAM J. Comput. 18 (1989) 1201-1225.