摘要：The Point-In-Polyhedron problem is to check whether a point is inside or outside of a given polyhedron. When a degenerate case is detected, the traditional ray-crossing algorithms avoid the case by selecting a different ray or erase the case by perturbing input data. This paper introduces a Threshold-Based Ray-Crossing (TBRC) algorithm for solving the Point-In-Polyhedron problem. The TBRC algorithm copes directly with degenerate cases by checking whether to count the face intersecting with the ray. It is worth mentioning that the TBRC algorithm can handle all degeneracies without extra computation and storage. Moreover, we analyze the basic algorithm and examine how to accelerate it. The experimental results show that TBRC algorithm is highly efficient and robust for the Point-In-Polyhedron problem, compared to a classical tetrahedron-based algorithm without pre-processing.
关键词：TBRC; the edge-face problem; Point-In-Polyhedron
