Game Development Reference
In-Depth Information
R 2 C = R Cx +
2 R λ ,
1
2 R λ ,R Cy +
1
R 3 C = R Cx +
2 R λ ,
1
2 R λ ,R Cy
1
R 4 C = R Cx
2 R λ ,
1
2 R λ ,R Cy
1
1
2 R λ ,
R 1 λ =
1
2 R λ ,
R 2 λ =
1
2 R λ ,
R 3 λ =
1
2 R λ .
R 4 λ =
Option 3. If the viewable region span θ , calculated at the viewable region R 's
center position R C , and with the applied offset R λ , θ ( R C ,R λ ), is less than
or equal to the maximum viewable region span θ max , then the viewable
region R is added to final output stream of viewable regions.
Note that for the final iteration in Stage 2 of the algorithm, any viewable region
not culled must be added to the final output stream, regardless of the viewable
region span. This is to ensure that all remaining viewable regions have a chance
y
y
R 1
R 2
R
R 4
R 3
x
x
(a)
(b)
Figure 1.3. (a) The viewable region ( R ). (b) The split viewable regions ( R 1 ,R 2 ,R 3 ,R 4).
 
 
Search Nedrilad ::




Custom Search