Algorithms for ray-shooting and intersection searching

DOI10.1016/0196-6774(92)90062-HzbMath0767.68089OpenAlexW2057120677MaRDI QIDQ4015270

Ravi Janardan, Siu-Wing Cheng

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)

Related Items (9)

REPORTING BICHROMATIC SEGMENT INTERSECTIONS FROM POINT SETS ⋮ 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 ⋮ Point enclosure problem for homothetic polygons ⋮ Simplex Range Searching and Its Variants: A Review ⋮ Algorithms for generalized halfspace range searching and other intersection searching problems ⋮ An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction

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