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 require...
详细信息
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.
暂无评论