Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
From MaRDI portal
Publication:934024
DOI10.1016/J.COMGEO.2007.10.006zbMATH Open1161.68050OpenAlexW2216717618MaRDI QIDQ934024FDOQ934024
Authors: Boris Aronov, Chris Gray, Mark de Berg 
Publication date: 29 July 2008
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2007.10.006
Recommendations
- Vertical ray shooting for fat objects
- scientific article; zbMATH DE number 437551
- Linear data structures for fast ray-shooting amidst convex polyhedra
- Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra
- Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions
Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Range Searching and Point Location among Fat Objects
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ray shooting, depth orders and hidden surface removal
- On range searching with semialgebraic sets
- Lines in space: Combinatorics and algorithms
- Ray shooting on triangles in 3-space
- Linear size binary space partitions for uncluttered scenes
- The complexity of the free space for motion planning amidst fat obstacles
- Ray Shooting Amidst Spheres in Three Dimensions and Related Problems
- Ray Shooting and Parametric Search
- Fast detection of polyhedral intersection
- Ray shooting amid balls, farthest point from a line, and range emptiness searching
- New lower bounds for Hopcroft's problem
- Range searching in low-density environments
- Vertical ray shooting and computing depth orders for fat objects
- Title not available (Why is that?)
- Vertical ray shooting for fat objects
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Ray shooting and stone throwing
Cited In (11)
- A local search algorithm for ray-convex polyhedron intersection
- On ray shooting for triangles in 3-space and related problems
- Title not available (Why is that?)
- Linear data structures for fast ray-shooting amidst convex polyhedra
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
- Decompositions and boundary coverings of non-convex fat polyhedra
- Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra
- Vertical ray shooting for fat objects
- A fast method for obtaining convex combination coefficients
- Title not available (Why is that?)
- Algorithms for ray-shooting and intersection searching
This page was built for publication: Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q934024)
