3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
From MaRDI portal
Recommendations
- Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
- Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions
- Vertical Ray Shooting and Computing Depth Orders for Fat Objects
- scientific article; zbMATH DE number 437551
- On ray shooting for triangles in 3-space and related problems
- Ray Shooting Amidst Spheres in Three Dimensions and Related Problems
- Vertical ray shooting for fat objects
- On ray shooting in convex polytopes
- Ray Shooting Amidst Convex Polygons in 2D
- Ray shooting on triangles in 3-space
Cites work
- scientific article; zbMATH DE number 3887061 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 732977 (Why is no real title available?)
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
- Algorithms for generalized halfspace range searching and other intersection searching problems
- Applications of a new space-partitioning technique
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
- Circle Shooting in a Simple Polygon
- Computing and Verifying Depth Orders
- Computing depth orders for fat objects and related problems
- Efficient hidden surface removal for objects with small union size
- Efficient partition trees
- Fat Triangles Determine Linearly Many Holes
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- GENERALIZED INTERSECTION SEARCHING PROBLEMS
- Improved algorithms for discs and balls using power diagrams
- New results on binary space partitions in the plane (extended abstract)
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- On \(k\)-sets in arrangements of curves and surfaces
- On fat partitioning, fat covering and the union size of polygons
- On intersection searching problems involving curved objects
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- On the union of fat wedges and separating a collection of segments by a line
- Point location in fat subdivisions
- Quasi-optimal upper bounds for simplex range searching and new zone theorems
- Range Searching and Point Location among Fat Objects
- Range searching in low-density environments
- Range searching with efficient hierarchical cuttings
- Ray shooting in polygons using geodesic triangulations
- Special issue: Algorithms for geographic data handling
- The complexity of the free space for a robot moving amidst fat obstacles
- The complexity of the free space for motion planning amidst fat obstacles
- Two-Dimensional and Three-Dimensional Point Location in Rectangular Subdivisions
- Visibility and intersection problems in plane geometry
Cited in
(24)- Models and motion planning
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry
- Range Searching and Point Location among Fat Objects
- Vertical Ray Shooting and Computing Depth Orders for Fat Objects
- Ray shooting from convex ranges
- Geodesic spanners for points in \(\mathbb{R}^3\) amid axis-parallel boxes
- Fair and square: cake-cutting in two dimensions
- Point enclosure problem for homothetic polygons
- Point enclosure problem for homothetic polygons
- Ray shooting amid balls, farthest point from a line, and range emptiness searching
- Dynamic data structures for fat objects and their applications
- Models and motion planning
- Improved bounds on the union complexity of fat objects
- A technique for adding range restrictions to generalized searching problems
- Computing depth orders for fat objects and related problems
- Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
- Walking around fat obstacles.
- Kinetic collision detection for convex fat objects
- Envy-Free Division of Land
- Piercing unit geodesic disks
- Keep your distance: land division with separation
- On point covers of c-oriented polygons
- Piercing pairwise intersecting convex shapes in the plane
- Vertical ray shooting for fat objects
This page was built for publication: 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1370928)
