3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
From MaRDI portal
Publication:1370928
DOI10.1016/S0925-7721(96)00027-2zbMath0888.68115OpenAlexW2136863760MaRDI QIDQ1370928
Publication date: 11 June 1998
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(96)00027-2
Related Items (16)
Fair and square: cake-cutting in two dimensions ⋮ Models and motion planning ⋮ A technique for adding range restrictions to generalized searching problems ⋮ Keep your distance: land division with separation ⋮ Piercing pairwise intersecting convex shapes in the plane ⋮ Point enclosure problem for homothetic polygons ⋮ Geodesic spanners for points in \(\mathbb{R}^3\) amid axis-parallel boxes ⋮ Ray shooting and intersection searching amidst fat convex polyhedra in 3-space ⋮ Improved bounds on the union complexity of fat objects ⋮ On point covers of \(c-\)oriented polygons ⋮ Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry ⋮ Models and motion planning ⋮ Kinetic collision detection for convex fat objects ⋮ Envy-Free Division of Land ⋮ Dynamic data structures for fat objects and their applications ⋮ 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
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
