Pankaj K. Agarwal
- 1.P. K. Agarwal, Ray shooting and other applications of spanning trees with low stabbing number, SIAM J. Computing 21 (1992), in press.]] Google Scholar
Digital Library
- 2.P. K. Agarwal and J. Matou#ek, Ray shooting and parametric search, Technical Report CS-1991-22, Dept. Computer Science, Duke University, 1991.]] Google ScholarDigital Library
- 3.P. K. Agarwal and J. Matou#ek, Dynamic half-space range reporting and its applications, Technical Report, GS-1991-43, Dept. Computer Science, Duke University, 1991.]] Google ScholarDigital Library
- 4.P. K. Agarwal and M. Sharir, Planar geometric location problems, Tech. Rept. 90-58, DIMACS, Rutgers University, August 1990. (Also to appear in Algorithmica.)]]Google Scholar
- 5.P. K. Agarwal and M. Sharix, Applications of a new partitioning scheme, Proc. 2nd Workshop on Algorithms and Data Structures, 1991, pp. 379-392.]]Google ScholarCross Ref
- 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.]] Google ScholarDigital Library
- 7.M. de Berg, D. Halperin, M. Overmars, J. Snoeyink, and M. van Kreveld, Efficient ray shooting and hidden surface removal, Proc. 7th A CM Syrup. on Computational Geometry, 1991, pp. 51-60.]] Google ScholarDigital Library
- 8.M. de Berg and M. Overmars, Hidden Surface Removal for Axis-Parallel Polyhedra, Proceedings 31"t Annual 1EEE Symposium on Foundations of Computer Science, 1990, pp. 252-261.]]Google ScholarDigital Library
- 9.B. Chazelle, On the convex layers of a planar set, IEEE Trans. Information Theory IT-31 (1985), 509- 517.]]Google ScholarCross Ref
- 10.}3. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir and J. Stolfi, Lines in space: Combinatorics and algorithms, Proc. #1. ACM Symposium on Theory of Computing, 1989, pp. 389-392. Full version: Tech. Rept. 491, Dept. of Computer Science, New York University, February 1990.]] Google ScholarDigital Library
- 11.B. Chazelle and L. Guibas, Visibility and intersection problems in plane geometry, Discrete Comput. Geom. 4 (1989), 551-589.]]Google ScholarDigital Library
- 12.B. Chazelle and F. P. Preparata, Halfspace range searching: An algorithmic appfication of k-sets, Discrete # Computational Geometry, 1 (1986), 83-93.]]Google Scholar
- 13.B. Chazelle, M. Sharir and E. Welzl, Quasi-optimal upper bounds for simplex range searching and new zone theorems, Proc. 6th A CM Syrup. on Computational Geometry, 1990, pp. 23-33.]] Google ScholarDigital Library
- 14.K. Clarkson, A randomized algorithm for closest point queries, SlAM J. Computing 17 (1988), 830- 847.]] Google ScholarDigital Library
- 15.K. L. Clarkson and P. Shor, New applications of random sampling in computational geometry II, Discrete # Computational Geometry, 4, 1989.]]Google Scholar
- 16.R. Cole, Slowing down sorting networks to obtain faster sorting algorithms, J. A CM 31 (1984), 200- 208.]] Google ScholarDigital Library
- 17.D. Dobkin and D. Kirkpatrick, Determining the separation of preprocessed polyhedra: a unified approach, Proceedings 17th International Colloquium on Automata, Languages and Programming, 1990, pp. 400-413.]] Google ScholarDigital Library
- 18.H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, 1987.]] Google ScholarDigital Library
- 19.H. Edelsbrunner and E. Welzl, Constructing belts in two-dimensional arrangements with applications, SIAM J. Computing 15 (1986), 271-284.]] Google ScholarDigital Library
- 20.L. Guibas, M. Overmars and M. Sharir, Ray shooting, impficit point location, and related queries in arrangements of segments, Tech. Report 433, Courant Institute, New York University, 1989.]]Google Scholar
- 21.J. Matou#ek, Efficient partition trees, Proc. 7th ACM Syrup. on Computational Geometry, 1991, pp. 1-9.]] Google ScholarDigital Library
- 22.J. Matougek, Reporting points in halfspaces, Proc. 32nd IEEE Syrup. on Foundations of Computer Science, 1991.]] Google ScholarDigital Library
- 23.J. Matou#ek. Range searching with efficient hierarchical cuttings. In Proc. 8th A CM Symposium on Computational Geometry, 1992. To appear.]] Google ScholarDigital Library
- 24.J. Matou#ek and O. Schwarzkopf. Linear optimization queries. In Proc. 8th A CM Symposium on Computational Geometry, 1992. To appear.]] Google ScholarDigital Library
- 25.N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, J. A CM 30 (1983), 852-865.]] Google ScholarDigital Library
- 26.K. Mulmuley, On levels in arrangements and Voronoi diagrams, Discrete f_4 Computational Geometry, 6 (1991), 307-338.]]Google Scholar
- 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.]] Google ScholarDigital Library
- 28.M. Overmars and M. Sharir, Output-sensitive hidden surface removal, Proc. 30th 1EEE Syrup. on Foundations of Computer Science, 1989, pp. 598- 603.]]Google ScholarDigital Library
- 29.J. Pach, W. Steiger, and E. Szemer#di, An upper bound on the number of planar k-sets, Proc. 30th 1EEE Symposium on Foundations of Computer Science, 1989, pp. 72-79.]]Google ScholarDigital Library
- 30.O. Schwarzkopf. Ray shooting in convex polytopes. Technical Report B-91-18, FB Mathematik, Freie Universit#t Berlin, 1991.]]Google Scholar
- 31.D. Sommerville, Analytical Geometry in Three Dimensions, Cambridge, 1951.]]Google Scholar
- 32.S. Vre6ica and R. 2ivaljevi6, The colored Tverberg's problem and complexes of injective functions, Manuscript, 1991.]]Google Scholar
Index Terms
- Ray shooting and parametric search
Recommendations
Visibility and ray shooting queries in polygonal domains
Given a polygonal domain (or polygon with holes) in the plane, we study the problem of computing the visibility polygon of any query point. As a special case of visibility problems, we also study the ray-shooting problem of finding the first point on ...
Accelerating ray shooting through aggressive 5D visibility preprocessing
AFRIGRAPH '03: Proceedings of the 2nd international conference on Computer graphics, virtual Reality, visualisation and interaction in AfricaWe present a new approach to accelerating general ray shooting. Our technique uses a five-dimensional ray space partition and is based on the classic ray-classification algorithm. Where the original algorithm evaluates intersection candidates at run-...
Comments