Edgar A. Ramos
- 1.P. K. Agarwal, M. de Berg, J. Matou~,ek and O. Schwarzkopf. Constructing levels in arrangements and higher order Voronoi diagrams. SIAM J. Cornput. 27 (1998), 654-667. Google Scholar
Digital Library
- 2.P. K. Agarwal and J. Erickson. Geometric range searching and its relatives. To appear in Discrete and Computational Geometry: Ten Years Later (B. Chazelle, J. E. Goodman, and R. Pollack, eds.) AMS Press.Google Scholar
- 3.P. K. Agarwal, J. Matou.~ek and O. Schwarzkopf. Computing many faces in arrangements of lines and segments. SIAM J. Comput. 27 (1998), 491-505. Google ScholarDigital Library
- 4.N. M. Amato, M. T. Goodrich and E. A. Ramos. Computing faces in segment and simplex arrangements. STOC'95, 672-682. Google ScholarDigital Library
- 5.M. de Berg, K. Dobrindt and O. Schwarzkopf. On lazy randomized incremental construction. Discrete Comput. Geom. 14 (1995), 261-286.Google ScholarDigital Library
- 6.H. BrSnnimann. Derandomization of Geometric Algorithms. Ph.D. Thesis. Department of Computer Science, Princeton University. 1995. Google ScholarDigital Library
- 7.H. BrSnnimann, B. Chazelle and J. Matou~ek. Product range spaces, sensitive sampling, and derandomization. FOCS'93, 400-409. Google ScholarDigital Library
- 8.T. Chan. Fixed-dimensional linear programming queries made easy. SOCG'96, 284-290. Google ScholarDigital Library
- 9.T. Chan. Random sampling, halfspace range reporting and construction of (< k)-levels in three dimensions. FOCS'98. Google ScholarDigital Library
- 10.B. Chazelle. Cutting hyperplanes for divide-andconquer. Discrete Comput. Geom., 9 (1993), 145- 158.Google ScholarDigital Library
- 11.B. Chazelle. An optimal convex hull algorithm in any fixed dimension. Discrete Comput. Geom., 10 (1993), 377-409.Google ScholarDigital Library
- 12.B. Chazelle and J. Friedman. A deterministic view of random sampling and its use in geometry. Combinatot/ca, 10 (1990), 229-249.Google ScholarCross Ref
- 13.B. Chazelle and J. Friedman. Point location among hyperplanes and unidirectional ray-shooting. Cornput. Geom. 4 (1994), 53-62. Google ScholarDigital Library
- 14.K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom. 4 (1989), 387-421.Google ScholarDigital Library
- 15.A. Crauser, P. Ferragina, K. Mehlhorn, U. Meyer and E. A. Ramos. External memory algorithms for some geometric problems. SOCG'98, 259-268. Google ScholarDigital Library
- 16.J. Matou~ek. Cutting hyperplane arrangements. Discrete Comput. Geom. 6 (1991), 385-406. Google ScholarDigital Library
- 17.J. Matougek. Approximations and optimal geometric divide-and-conquer. J. Comput. Syst. Sci. 50 (1995), 203-208. Google ScholarDigital Library
- 18.J. Matou~ek. Efficient partition trees. Discrete Cornput. Geom. 8 (1992), 315-334.Google ScholarDigital Library
- 19.J. Matou~ek. Reporting points in halfspaces. Cornput. Geom. 2 (1992), 169-186. Google ScholarDigital Library
- 20.J. Matou~ek. On vertical ray shooting in arrangements. Cornput. Geom. 3 (1993), 279-285. Google ScholarDigital Library
- 21.J. Matougek and O. Schwarzkopf. On ray shooting in convex polytopes. Discrete Cornput. Geom. 10 (1993), 215-232.Google ScholarDigital Library
- 22.K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, Englewood Cliffs, NJ, 1993.Google Scholar
Index Terms
- On range reporting, ray shooting and k-level construction
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-...
Ray Shooting Amidst Convex Polygons in 2D
We consider the problem of ray shooting in a two-dimensional scene consisting ofmconvex polygons with a total ofnedges. We present a data structure that requiresO(mnlogm) space and preprocessing time and that answers a ray shooting query inO(log2mlog2n) ...
Comments