Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications

Proceedings of the Annual Symposium on Computational Geometry

Volumn Part F129372, Issue , 1995, Pages 39-50

  Agarwal, Pankaj K ^a   Efrat, Alon ^b   Sharir, Micha ^b,c  

^a DUKE UNIVERSITY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL GEOMETRY; DATA STRUCTURES; FUNCTIONS; GEOMETRY;

ALGEBRAIC FUNCTIONS; COMBINATORIAL COMPLEXITY; DISTANCE FUNCTIONS; DYNAMIC DATA STRUCTURE; DYNAMIC SETTINGS; GEOMETRIC OPTIMIZATION; ITS APPLICATIONS; NEIGHBOR SEARCHING;

OPTIMIZATION;

EID: 84958016763     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/220279.220284     Document Type: Conference Paper

References (40)

1. P. Agarwal, M. de Berg, J. Matoušek, and O. Schwarzkopf, Computing levels in arrangements and higher order Voronoi diagrams, Proc. 10th Annual Symp. on Comp. Geom., 1994, 67-75.
2. P. Agarwal, A. Efrat, M. Shanr, and S. Toledo, Computing a segment-center for a planar point set, J. Algorithms 15(1993), 314-323.
3. P. Agarwal and J. Matousek, Dynamic half-space range searching and its applications, Algorithmica 14(1995), in press.
4. P. Agarwal and J. Matoušek, Ray shooting and parametric search, SIAM J. Comput. 22, 794-806.
5. P. Agarwal and J. Matoušek, Range searching with semialgebraic sets, Discrete Comput. Geom. 11(1994), 393-418.
6. P. Agarwal, O. Schwarzkopf, and M. Sharir, Overlay of lower envelopes in three dimensions and its applications, this proceedings.
7. P. Agarwal, M. Sharir, and P. Shor, Sharp upper and lower bounds for the length of general Davenport Schinzel sequences, J. Combm. Theory, Ser. A. 52(1989), 228-274.
8. A. Aggarwal, A. Bar-Noy, S. Khuller, D. Kravets, and B. Schieber, Efficient minimum cost matching using quadrangle inequality, Proc. 33rd Symp. on Found. of Comp. Sci., 1992, 583-592.
9. H. Brönnimann, B. Chazelle, and J. Matousek, Product range spaces, sensitive sampling, and derandomization, Proc. 34th Symp. on Found. of Comp. Sci., 1993, 400-409.
10. S. Buss and P. Yianilos, Linear and O (n log n) time minimum-cost matching algorithms for quasi-convex tours, Proc. 5th ACM-SIAM Symp. on Disc. Algo., 1994, 65-76.
11. B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, A singly exponential stratification scheme for real semi-algebraic varieties and its applications, Proc. 16th Int. Colloq. on Auto., Lang, and Prog., 1989, 179-193.
12. (See also Theoretical Comp. Sci. 84(1991), 77-105.)
13. K. Clarkson, New applications of random sampling in computational geometry, Discrete Comput. Geom. 2(1987), 195-222.
14. K. Clarkson and P. Shor, Applications of random sampling in computational geometry, II, Discrete Comput. Geom. 4(1989), 387-421.
15. M. de Berg, D. Halperin, and L. Guibas, Vertical decomposition for triangles in 3-space, Proc. 10th Symp. on Comput. Geom., 1994, 1-10.
16. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg, 1987.
17. H. Edelsbrunner and R. Seidel, Voronoi diagrams and arrangements, Discrete Comput. Geom. 1(1986), 25-44.
18. A. Efrat and M. Sharir, A near-linear algorithm for the planar segment center problem, to appear in Discrete Comput. Geom.
19. D. Eppstein, Dynamic Euclidean minimum spanning trees and extrema of binary functions, Discrete Comput. Geom. 13(1995), 111-122.
20. B. Grünbaum, A proof of Vázsonyi's conjecture, Bull. Research Council Israel, Sec. A 6(1956), 77-78.
21. D. Halperin and M. Sharir, New bounds for lower envelopes in three dimensions, with applications to visibility of terrains, Discrete Comput. Geom. 12(1994), 313-326.
22. S. Hart and M. Sharir, Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes, Combinatorica 6(1986), 151-177.
23. D. Haussler and E. Welzl, ∈-nets and simplex range queries, Discrete Comput. Geom. 2(1987), 127-151.
24. H. Imai, D. T. Lee, and C. Yang, 1-Segment center covering problems, ORSA J. of Comput. 4(1992), 426-434.
25. D. Leven and M. Sharir, Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams, Discrete Comput. Geom. 2(1987), 9-31.
26. H. Kuhn, The Hungarian method for the assignment problem, Naval Research Logistics Quarterly 2(1955), 83-97.
27. E. Lawler, Combinatorial Optimization: Networks and Matroids, Saunders College Publishing, Fort Worth, TX, 1976.
28. p-metric, J. ACM 27(1980), 604-618.
29. D. T. Lee and S. Drysdale, Generalizations of Voronoi diagrams in the plane, SIAM J. Comput. 10(1981), 73-87.
30. O. Marcotte and S. Suri, Fast matching algorithms for points on a polygon, SIAM J. Comput. 20(1991), 405-422.
31. J. Matoušek, Approximations and optimal geometric divide-and-conquer, Proc. 23. Annual ACM Symp. on Theory of Comput, 1991, 506-511.
32. J. Matousek, Reporting points in halfspaces, Comput. Geom. Theory Appls. 2(1992), 169-186.
33. J. Matousek and O. Schwarzkopf, On ray shooting in convex polytopes, Discrete Comp. Geom. 10(1993), 215-232.
34. N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, J. ACM 30(1983), 852-865.
35. K. Mulmuley, Computational Geometry: An Introduction Through Randomized Algorithms, Prentice Hall, Englewood Cliffs, NJ, 1993.
36. M. Sharir, Almost tight upper bounds for lower envelopes in higher dimensions, Discrete Comput. Geom. 12(1994), 327-345.
37. M. Sharir and P. Agarwal, Davenport-Schmzel Sequences and Their Geometric Applications, Cambridge University Press, New York, 1995.
38. S. Toledo, Maximizing non-linear concave functions in fixed dimensions, Proc. 33rd Symp. on Found. of Comp. Sci., 1992, 676-685.
39. P. Vaidya, Geometry helps in matching, SIAM J. Cornput., 18(1989), 1201-1225.
40. L. Valiant, Parallelism in comparison problems, SIAM J. Comput. 4(1975), 348-355.