A Novel Ray-Casting Algorithm Using Dynamic Adaptive Sampling

Algorithm 1. solution process of intersection coordinates

Input: , number_Current, Total.

Output:

1: Take the coordinate of the geometric midpoint of and to obtain the sampling value g.

2: T is set threshold, and the number current represent the current iterations, which is required to less than the Total.

3: If then

4:  

5: Else

6:  

7: While do

8:   By linear interpolation of and , the coordinates of the intersection point of and

9: If number_Current>Total then return P0

10: If is close to then

11:  

12: Else

13:  

14: Return

Algorithm 1. solution process of intersection coordinates