3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

Related Items

On point covers of \(c-\)oriented polygons, Ray shooting and intersection searching amidst fat convex polyhedra in 3-space, Improved bounds on the union complexity of fat objects, Kinetic collision detection for convex fat objects, Models and motion planning, Walking around fat obstacles.

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Range searching with efficient hierarchical cuttings
Visibility and intersection problems in plane geometry
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
On \(k\)-sets in arrangements of curves and surfaces
Applications of a new space-partitioning technique
Efficient partition trees
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
Quasi-optimal upper bounds for simplex range searching and new zone theorems
Efficient hidden surface removal for objects with small union size
Point location in fat subdivisions
On the union of fat wedges and separating a collection of segments by a line
The complexity of the free space for a robot moving amidst fat obstacles
Ray shooting in polygons using geodesic triangulations
Range searching in low-density environments
The complexity of the free space for motion planning amidst fat obstacles
Computing depth orders for fat objects and related problems
Algorithms for generalized halfspace range searching and other intersection searching problems
Improved algorithms for discs and balls using power diagrams
Range Searching and Point Location among Fat Objects
Circle Shooting in a Simple Polygon
Fat Triangles Determine Linearly Many Holes
Computing and Verifying Depth Orders
Two-Dimensional and Three-Dimensional Point Location in Rectangular Subdivisions
A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
On intersection searching problems involving curved objects
New results on binary space partitions in the plane (extended abstract)
On fat partitioning, fat covering and the union size of polygons
GENERALIZED INTERSECTION SEARCHING PROBLEMS
Special issue: Algorithms for geographic data handling