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-2zbMATH Open0888.68115OpenAlexW2136863760MaRDI QIDQ1370928FDOQ1370928
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient partition trees
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- Range Searching and Point Location among Fat Objects
- On the union of fat wedges and separating a collection of segments by a line
- Algorithms for generalized halfspace range searching and other intersection searching problems
- On intersection searching problems involving curved objects
- GENERALIZED INTERSECTION SEARCHING PROBLEMS
- Quasi-optimal upper bounds for simplex range searching and new zone theorems
- Improved algorithms for discs and balls using power diagrams
- 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
- Applications of a new space-partitioning technique
- The complexity of the free space for a robot moving amidst fat obstacles
- Fat Triangles Determine Linearly Many Holes
- Computing and Verifying Depth Orders
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
- Range searching with efficient hierarchical cuttings
- Ray shooting in polygons using geodesic triangulations
- The complexity of the free space for motion planning amidst fat obstacles
- On fat partitioning, fat covering and the union size of polygons
- Efficient hidden surface removal for objects with small union size
- On \(k\)-sets in arrangements of curves and surfaces
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
- Computing depth orders for fat objects and related problems
- Range searching in low-density environments
- Two-Dimensional and Three-Dimensional Point Location in Rectangular Subdivisions
- Point location in fat subdivisions
- Circle Shooting in a Simple Polygon
- New results on binary space partitions in the plane (extended abstract)
- Special issue: Algorithms for geographic data handling
Cited In (18)
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry
- Ray shooting from convex ranges
- Point enclosure problem for homothetic polygons
- Geodesic spanners for points in \(\mathbb{R}^3\) amid axis-parallel boxes
- Fair and square: cake-cutting in two dimensions
- Dynamic data structures for fat objects and their applications
- Models and motion planning
- Ray shooting amid balls, farthest point from a line, and range emptiness searching
- Improved bounds on the union complexity of fat objects
- A technique for adding range restrictions to generalized searching 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
- Keep your distance: land division with separation
- On point covers of \(c-\)oriented polygons
- Piercing pairwise intersecting convex shapes in the plane
- Models and motion planning
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 👍 👎
- Title not available (Why is that?) 👍 👎
- 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 👍 👎
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)
