Average case analysis of dynamic geometric optimization

Computational Geometry: Theory and Applications

Volumn 6, Issue 1, 1996, Pages 45-68

  Eppstein, David ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Average case analysis; Dynamic geometric optimization; Farthest neighbor forest; Maximum spanning tree; Orthogonal range search; Rotating caliper graph

Indexed keywords

EID: 0003661398     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/0925-7721(95)00018-6     Document Type: Article

References (58)

1. P.K. Agarwal, H. Edelsbrunner, O. Schwarzkopf and E. Welzl, Euclidean minimum spanning trees and bichromatic closest pairs, Discrete Comput. Geom. 6 (1991) 407-422. See also: 6th Symp. Comp. Geom. (1990) 203-210.
2. P.K. Agarwal, H. Edelsbrunner, O. Schwarzkopf and E. Welzl, Euclidean minimum spanning trees and bichromatic closest pairs, Discrete Comput. Geom. 6 (1991) 407-422. See also: 6th Symp. Comp. Geom. (1990) 203-210.
3. P.K. Agarwal, D. Eppstein and J. Matoušek, Dynamic algorithms for half-space reporting, proximity problems, and geometric minimum spanning trees, in: Proc. 33rd IEEE Symp. Foundations of Computer Science (1992) 80-89.
4. P.K. Agarwal, J. Matoušek and S. Suri, Farthest neighbors, maximum spanning trees, and related problems in higher dimensions, Comput. Geom.: Theory & Appl. 4 (1992) 189-201. See also: 2nd Worksh. Algorithms and Data Structures (1991) 105-116.
5. P.K. Agarwal, J. Matoušek and S. Suri, Farthest neighbors, maximum spanning trees, and related problems in higher dimensions, Comput. Geom.: Theory & Appl. 4 (1992) 189-201. See also: 2nd Worksh. Algorithms and Data Structures (1991) 105-116.
6. P.K. Agarwal and M. Sharir, Off-line dynamic maintenance of the width of a planar point set, Comput. Geom.: Theory & Appl. 1 (1991) 65-78.
7. D. Alberts and M. Rauch Henzinger, Average case analysis of dynamic graph algorithms, in: Proc. 6th ACM-SIAM Symp. Discrete Algorithms (1995) 312-321.
8. N. Amenta, Helly theorems and generalized linear programming, Discrete Comput. Geom. 12 (1994) 241-261. See also: 9th Symp. Comp. Geom. (1993) 63-72.
9. N. Amenta, Helly theorems and generalized linear programming, Discrete Comput. Geom. 12 (1994) 241-261. See also: 9th Symp. Comp. Geom. (1993) 63-72.
10. T. Asano, B. Bhattacharya, M. Keil and F. Yao, Clustering algorithms based on minimum and maximum spanning trees, in: Proc. 4th ACM Symp. Computational Geometry (1988) 252-257.
11. H. Baumgarten, H. Jung and K. Mehlhorn, Dynamic point location in general subdivisions, J. Algorithms 17 (1994) 342-380. See also: 3rd Symp. Discrete Algorithms (1992) 250-258.
12. H. Baumgarten, H. Jung and K. Mehlhorn, Dynamic point location in general subdivisions, J. Algorithms 17 (1994) 342-380. See also: 3rd Symp. Discrete Algorithms (1992) 250-258.
13. J.L. Bentley and J. Saxe, Decomposable searching problems I: Static-to-dynamic transformation, J. Algorithms 1 (1980) 301-358.
14. K.Q. Brown, Voronoi diagrams from convex hulls, Inform. Proc. Lett. 9 (1979) 223-226.
15. G. Cattaneo and G.F. Italiano, Average case and empirical study of sparsification (1995) Manuscript.
16. S.W. Cheng and R. Janardan, New results on dynamic planar point location, SIAM J. Comput. 21 (1992) 972-999. See also: 31st Symp. Found. Comp. Sci. (1990) 96-105.
17. S.W. Cheng and R. Janardan, New results on dynamic planar point location, SIAM J. Comput. 21 (1992) 972-999. See also: 31st Symp. Found. Comp. Sci. (1990) 96-105.
18. Y.-J. Chiang and R. Tamassia, Dynamization of the trapezoid method for planar point location, Int. J. Comput. Geom. & Appl. 2 (1992) 311-333.
19. See also: 7th Symp. Comp. Geom. (1991) 61-70.
20. K.L. Clarkson and P.W. Shor, Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental, in: Proc. 4th ACM Symp. Computational Geometry (1988) 12-17.
21. O. Devillers, S. Meiser and M. Teillaud, Fully dynamic Delaunay triangulation in logarithmic expected time per operation, Comput. Geom.: Theory & Appl. 2 (1992) 55-80. See also: 2nd Worksh. Algorithms and Data Structures (1991) 42-53.
22. O. Devillers, S. Meiser and M. Teillaud, Fully dynamic Delaunay triangulation in logarithmic expected time per operation, Comput. Geom.: Theory & Appl. 2 (1992) 55-80. See also: 2nd Worksh. Algorithms and Data Structures (1991) 42-53.
23. H. Edelsbrunner and N.R. Shah, Incremental topological flipping works for regular triangulations, in: Proc. 8th ACM Symp. Computational Geometry (1992) 43-52.
24. D. Eppstein, Dynamic three-dimensional linear programming, ORSA J. Comput. 4 (1992) 360-368. See also: 32nd Symp. Found. Comp. Sci. (1991) 488-494.
25. D. Eppstein, Dynamic three-dimensional linear programming, ORSA J. Comput. 4 (1992) 360-368. See also: 32nd Symp. Found. Comp. Sci. (1991) 488-494.
26. D. Eppstein, Offline algorithms for dynamic minimum spanning tree problems, J. Algorithms 17 (1994) 237-250. See also: 2nd Worksh. Algorithms and Data Structures (1991) 392-399.
27. D. Eppstein, Offline algorithms for dynamic minimum spanning tree problems, J. Algorithms 17 (1994) 237-250. See also: 2nd Worksh. Algorithms and Data Structures (1991) 392-399.
28. D. Eppstein, Dynamic euclidean minimum spanning trees and extrema of binary functions, Discrete Comput. Geom. 13 (1995) 237-250.
29. D. Eppstein, Z. Galil, G.F. Italiano and A. Nissenzweig, Sparsification - A technique for speeding up dynamic graph algorithms, in: Proc. 33rd IEEE Symp. Foundations of Computer Science (1992) 60-69.
30. D. Eppstein, Z. Galil and G.F. Italiano, Improved sparsification. Technical Report 93-20, Department of Information and Computer Science, University of California, Irvine (1993).
31. D. Eppstein, G.F. Italiano, R. Tamassia, R.E. Tarjan, J. Westbrook and M. Yung, Maintenance of a minimum spanning forest in a dynamic plane graph, J. Algorithms 13 (1992) 33-54. See also: 1st Symp. Discrete Algorithms (1990) 1-11.
32. D. Eppstein, G.F. Italiano, R. Tamassia, R.E. Tarjan, J. Westbrook and M. Yung, Maintenance of a minimum spanning forest in a dynamic plane graph, J. Algorithms 13 (1992) 33-54. See also: 1st Symp. Discrete Algorithms (1990) 1-11.
33. G.N. Frederickson, Data structures for on-line updating of minimum spanning trees, SIAM J. Comput. 14 (1985) 781-798.
34. M.T. Goodrich and R. Tamassia, Dynamic trees and dynamic point location, in: Proc. 23rd ACM Symp. Theory of Computing (1991) 523-533.
35. L.J. Guibas, D.E. Knuth and M. Sharir, Randomized incremental construction of Delaunay and Voronoi diagrams, Algorithmica 7 (1992) 381-413. See also: 17th Int. Coll. on Automata, Languages and Programming (1990) 414-431.
36. L.J. Guibas, D.E. Knuth and M. Sharir, Randomized incremental construction of Delaunay and Voronoi diagrams, Algorithmica 7 (1992) 381-413. See also: 17th Int. Coll. on Automata, Languages and Programming (1990) 414-431.
37. R. Janardan, On maintaining the width and diameter of a planar point-set online, Int. J. Comput. Geom. & Appl. 3 (1993) 331-344. See also: 2nd Int. Symp. Algorithms (1991) 137-149.
38. R. Janardan, On maintaining the width and diameter of a planar point-set online, Int. J. Comput. Geom. & Appl. 3 (1993) 331-344. See also: 2nd Int. Symp. Algorithms (1991) 137-149.
39. K. Mehlhorn, S. Meiser and C. O'Dunlaing, On the construction of abstract Voronoi diagrams, Discrete Comput. Geom. 6 (1991) 211-224. See also: Symp. Theor. Aspects of Comp. Sci. (1990) 227-239.
40. K. Mehlhorn, S. Meiser and C. O'Dunlaing, On the construction of abstract Voronoi diagrams, Discrete Comput. Geom. 6 (1991) 211-224. See also: Symp. Theor. Aspects of Comp. Sci. (1990) 227-239.
41. C. Monma, M. Paterson, S. Suri and F. Yao, Computing Euclidean maximum spanning trees, Algorithmica 5 (1990) 407-419. See also: 4th Symp. Comp. Geom. (1988) 239-249.
42. C. Monma, M. Paterson, S. Suri and F. Yao, Computing Euclidean maximum spanning trees, Algorithmica 5 (1990) 407-419. See also: 4th Symp. Comp. Geom. (1988) 239-249.
43. K. Mulmuley, A fast planar partition algorithm I, J. Symbolic Computation 10 (1990) 253-280. See also: 29th Symp. Found. Comp. Sci. (1988) 580-589.
44. K. Mulmuley, A fast planar partition algorithm I, J. Symbolic Computation 10 (1990) 253-280. See also: 29th Symp. Found. Comp. Sci. (1988) 580-589.
45. K. Mulmuley, Randomized multidimensional search trees: dynamic sampling, in: Proc. 7th ACM Symp. Computational Geometry (1991) 121-131.
46. K. Mulmuley, Randomized multidimensional search trees: Lazy balancing and dynamic shuffling, in: Proc. 32nd IEEE Symp. Foundations of Computer Science (1991) 180-196.
47. K. Mulmuley, Computational Geometry, An Introduction through Randomized Algorithms (Prentice Hall, 1993).
48. M.H. Overmars and J. van Leeuwen, Maintenance of configurations in the plane, J. Comp. Syst. Sci. 23 (1981) 224-233.
49. F.P. Preparata and M.I. Shamos, Computational Geometry - An Introduction (Springer, New York, 1985).
50. F.P. Preparata and R. Tamassia, Fully dynamic point location in a monotone subdivision, SIAM J. Comput. 18 (1989) 811-830.
51. W. Pugh, Skip lists: A probabilistic alternative to balanced trees, Comm. Assoc. Comput. Mach. 33 (1990) 668-676.
52. G. Rote, C. Schwarz and J. Snoeyink, Maintaining the approximate width of a set of points in the plane, in: Proc. 5th Canad. Conf. Computational Geometry (1993) 258-263.
53. O. Schwarzkopf, Dynamic maintenance of geometric structures made easy, in: Proc. 32nd IEEE Symp. Foundations of Computer Science (1991) 197-206.
54. R. Seidel, Small-dimensional linear programming and convex hulls made easy, Discrete Comput. Geom. 6 (1991) 423-434. See also: 6th Symp. Comp. Geom. (1990) 211-215.
55. R. Seidel, Small-dimensional linear programming and convex hulls made easy, Discrete Comput. Geom. 6 (1991) 423-434. See also: 6th Symp. Comp. Geom. (1990) 211-215.
56. M.I. Shamos and D. Hoey, Closest-point problems, in: Proc. 16th IEEE Symp. Foundations of Computer Science (1975) 151-162.
57. D.D. Sleator and R.E. Tarjan, A data structure for dynamic trees, J. Comp. Syst. Sci. 24 (1983) 362-381.
58. A.C. Yao, On constructing minimum spanning trees in k-dimensional space and related problems, SIAM J. Comput. 11 (1982) 721-736.