Ray shooting on triangles in 3-space
From MaRDI portal
Publication:2366231
Recommendations
Cites work
- scientific article; zbMATH DE number 432756 (Why is no real title available?)
- scientific article; zbMATH DE number 432802 (Why is no real title available?)
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 3978403 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 177534 (Why is no real title available?)
- scientific article; zbMATH DE number 177535 (Why is no real title available?)
- scientific article; zbMATH DE number 177563 (Why is no real title available?)
- scientific article; zbMATH DE number 177829 (Why is no real title available?)
- scientific article; zbMATH DE number 3012556 (Why is no real title available?)
- A Randomized Algorithm for Closest-Point Queries
- An algorithm for generalized point location and its applications
- An optimal algorithm for intersecting line segments in the plane
- Analytic Inequalities
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Efficient ray shooting and hidden surface removal
- Finding the intersection of two convex polyhedra
- Merging visibility maps
- New applications of random sampling in computational geometry
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- Partitioning arrangements of lines. I: An efficient deterministic algorithm
- Partitioning arrangements of lines. II: Applications
- Quasi-optimal upper bounds for simplex range searching and new zone theorems
- Stabbing line segments
- The shortest watchtower and related problems for polyhedral terrains
Cited in
(22)- scientific article; zbMATH DE number 177535 (Why is no real title available?)
- Ray shooting and stone throwing
- Ray shooting from convex ranges
- Linear data structures for fast ray-shooting amidst convex polyhedra
- Worst-case versus average case complexity of ray-shooting
- A local search algorithm for ray-convex polyhedron intersection
- Stabbing isothetic boxes and rectangles in \(O(n\log n)\) time
- On range searching with semialgebraic sets
- Monte Carlo approximation of form factors with error bounded a priori
- Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number
- On lines missing polyhedral sets in 3-space
- The power of parallel projection
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
- Local polyhedra and geometric graphs
- Repetitive hidden-surface-removal for polyhedral scenes
- A succinct 3D visibility skeleton
- scientific article; zbMATH DE number 2112338 (Why is no real title available?)
- Triangles in space or building (and analyzing) castles in the air
- Watchman tours for polygons with holes
- ON THE EXPECTED SIZE OF THE 2D VISIBILITY COMPLEX
- Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
- On ray shooting for triangles in 3-space and related problems
This page was built for publication: Ray shooting on triangles in 3-space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2366231)
