“…In the SBR method, the intersection tests are quite time-consuming especially as the target size increasing. Many acceleration techniques, such as ray-box intersection algorithm in FPGA [13,14], multiresolution grid algorithm [15], recursive subdivision octree algorithm [16], and KD-tree based algorithm [17], have been developed to reduce the computation time of ray-tracing process. In this report, the bidirectional ray-tracing algorithm is proposed to decrease the intersection tests between patches and rays, further reducing computation time.…”