A local search algorithm for ray-convex polyhedron intersection

Abstract

In this paper we present a new algorithm (LSABV) for determining the intersection between a ray and a convex polyhedron (RCPI) in a fast way. LSABV is based on local search and the concept of visibility. LSABV requires only the boundary description of the polyhedron and it does not need additional data structures. Numerical experiments show that LSABV is faster than Haines's algorithm in the case of polyhedra with moderate or large number of faces.

A Brief Survey of Clipping and Intersection Algorithms with a List of References (including Triangle-Triangle Intersections)

“…The intersection with the AABBox is described in Eisemann et al (2007), Kodituwakku and Wijeweera (2012), Maonica et al (2017) and Mahovsky and Wyvill (2004). Other algorithms are available in Sharma and Manohar (1993), Skala (1996a), Williams et al (2005), Llanas and Sainz (2012). The 3D line segment-triangle intersection algorithm is described in Jokanovic (2019), Amanatides and Choi (1995), Lagae and Dutré (2005) (in 2D only) and a ray/convex polyhedron intersection was described in Zheng and Millham (1991).…”