Ray shooting and parametric search

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129722, Issue , 1992, Pages 517-526

  Agarwal, Pankaj K ^a   Matoušek, Jiří ^b  

^a DUKE UNIVERSITY   (United States)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; GEOMETRY; COMPUTATIONAL COMPLEXITY; COMPUTER GRAPHICS; DATA STRUCTURES; GRAPH THEORY;

EMPTINESS PROBLEM; HALF-PLANES; HIDDEN SURFACE REMOVAL; NONTRIVIAL SOLUTION; PREPROCESSING TIME; RAY SHOOTING; RAY SHOOTING ALGORITHMS; SEARCH TECHNIQUE;

GAMMA RAYS; ALGORITHMS;

PARAMETRIC SEARCH TECHNIQUE; RAY SHOOTING PROBLEM; SEGMENT EMPTINESS PROBLEM;

EID: 0026966834     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/129712.129763     Document Type: Conference Paper

References (32)

1. P. K. Agarwal, Ray shooting and other applications of spanning trees with low stabbing number, SIAM J. Computing 21 (1992), in press.
2. P. K. Agarwal and J. Matoušek, Ray shooting and parametric search, Technical Report CS-1991-22, Dept. Computer Science, Duke University, 1991.
3. P. K. Agarwal and J. Matoušek, Dynamic half-space range reporting and its applications, Technical Report, CS-1991-43, Dept. Computer Science, Duke University, 1991.
4. P. K. Agarwal and M. Sharir, Planar geometric location problems, Tech. Rept. 90-58, DIMACS, Rutgers University, August 1990. (Also to appear in Algorith-mica.)
5. P. K. Agarwal and M. Shark, Applications of a new partitioning scheme, Proc. 2nd Workshop on Algorithms and Data Structures, 1991, pp. 379-392.
6. B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and R. Wenger, Points and triangles in the plane and halving planes in the space, Discrete & Computational Geometry, 6 (1991), 435-442.
7. M. de Berg, D. Halperin, M. Overmars, J. Snoeyink, and M. van Kreveld, Efficient ray shooting and hidden surface removal, Proc. 7th ACM Symp. on Computational Geometry, 1991, pp. 51-60.
8. M. de Berg and M. Overmars, Hidden Surface Removal for Axis-Parallel Polyhedra, Proceedings 31st Annual IEEE Symposium on Foundations of Computer Science, 1990, pp. 252-261.
9. B. Chazelle, On the convex layers of a planar set, IEEE Trans. Information Theory IT-31 (1985), 509-517.
10. B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir and J. Stolfi, Lines in space: Combinatorics and algorithms, Proc. 21. ACM Symposium on Theory of Computing, 1989, pp. 389-392. Full version: Tech. Rept. 491, Dept. of Computer Science, New York University, February 1990.
11. B. Chazelle and L. Guibas, Visibility and intersection problems in plane geometry, Discrete Comput. Geom. 4 (1989), 551-589.
12. B. Chazelle and F. P. Preparata, Halfspace range searching: An algorithmic application of fc-sets, Discrete & Computational Geometry, 1 (1986), 83-93.
13. B. Chazelle, M. Sharir and E. Welzl, Quasi-optimal upper bounds for simplex range searching and new zone theorems, Proc. 6th ACM Symp. on Computational Geometry, 1990, pp. 23-33.
14. K. Clarkson, A randomized algorithm for closest point queries, SIAM J. Computing 17 (1988), 830-847.
15. K. L. Clarkson and P. Shor, New applications of random sampling in computational geometry II, Discrete & Computational Geometry, 4, 1989.
16. R. Cole, Slowing down sorting networks to obtain faster sorting algorithms, J. ACM 31 (1984), 200208.
17. D. Dobkin and D. Kirkpatrick, Determining the separation of preprocessed polyhedra: a unified approach, Proceedings 17 International Colloquium on Automata, Languages and Programming, 1990, pp. 400-413.
18. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, 1987.
19. H. Edelsbrunner and E. Welzl, Constructing belts in two-dimensional arrangements with applications, SIAM J. Computing 15 (1986), 271-284.
20. L. Guibas, M. Overmars and M. Sharir, Ray shooting, implicit point location, and related queries in arrangements of segments, Tech. Report 433, Courant Institute, New York University, 1989.
21. J. Matoušek, Efficient partition trees, Proc. 7th ACM Symp. on Computational Geometry, 1991, pp. 1-9.
22. J. Matoušek, Reporting points in halfspaces, Proc. 32nd IEEE Symp. on Foundations of Computer Science, 1991.
23. J. Matoušek. Range searching with efficient hierarchical cuttings. In Proc. 8th ACM Symposium on Computational Geometry, 1992. To appear.
24. J. Matoušek and O. Schwarzkopf. Linear optimization queries. In Proc. 8th ACM Symposium on Computational Geometry, 1992. To appear.
25. N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, J. ACM 30 (1983), 852-865.
26. K. Mulmuley, On levels in arrangements and Voronoi diagrams, Discrete & Computational Geometry, 6 (1991), 307-338.
27. K. Mulmuley, Randomized multidimensional search trees: Further results in dynamic sampling, Proceedings 32nd Annual IEEE Symposium on Foundations of Computer Science, 1991, pp. 216-27.
28. M. Overmars and M. Sharir, Output-sensitive hidden surface removal, Proc. 30th IEEE Symp. on Foundations of Computer Science, 1989, pp. 598-603.
29. J. Pach, W. Steiger, and E. Szemerédi, An upper bound on the number of planar fc-sets, Proc. 30th IEEE Symposium on Foundations of Computer Science, 1989, pp. 72-79.
30. O. Schwarzkopf. Ray shooting in convex polytopes. Technical Report B-91-18, FB Mathematik, Freie Universität Berlin, 1991.
31. D. Sommerville, Analytical Geometry in Three Dimensions, Cambridge, 1951.
32. S. Vrecica and R. Zivaljevic, The colored Tver-berg's problem and complexes of injective functions, Manuscript, 1991.