Algorithms for ray-shooting and intersection searching

DOI10.1016/0196-6774(92)90062-HMaRDI QIDQ4015270zbMATH OpenOpenAlexFDO

Authors Siu-Wing Cheng, Ravi Janardan

Publication date 12 January 1993

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(92)90062-h

zbMATH Keywords

ray-shootingsegment intersection searchingtriangle stabbing

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
• Publication:4934236
• A local search algorithm for ray-convex polyhedron intersection
• Algorithms for subpath convex hull queries and ray-shooting among segments
• Optimal algorithms for some intersection radius problems
• Ray Shooting and Parametric Search
• On intersection searching problems involving curved objects
• Algorithms for generalized halfspace range searching and other intersection searching problems
• Algorithms for generalized halfspace range searching and other intersection searching problems
• Visibility and ray shooting queries in polygonal domains

Cited in

(17)

• Orthogonal queries in segments
• Algorithms for generalized halfspace range searching and other intersection searching problems
• Connected component and simple polygon intersection searching
• Visibility testing and counting for uncertain segments
• Ray Shooting and Parametric Search
• scientific article; zbMATH DE number 4062593 (Why is no real title available?)
• A local search algorithm for ray-convex polyhedron intersection
• An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction
• Simplex Range Searching and Its Variants: A Review
• Reporting bichromatic segment intersections from point sets
• Algorithms for generalized halfspace range searching and other intersection searching problems
• Point enclosure problem for homothetic polygons
• Algorithms for subpath convex hull queries and ray-shooting among segments
• Algorithms for computing closest points for segments
• Algorithms for computing closest points for segments
• Point enclosure problem for homothetic polygons
• A deterministic partition tree and applications

This page was built for publication: Algorithms for ray-shooting and intersection searching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4015270)