Visibility Flashcards
1
Q
Complexity of solving the visibility problem
A
The worst case complexity is O(n^2) but in reality it is more like O(n)
2
Q
With what algorithms can i solve the visibility problem?
A
- Painter’s Algorithm
- z-Buffer Algorithm
3
Q
Binary Space Parition (BSP)
A
4
Q
Painter’s algorithm
A
5
Q
z-Buffer-algorithm
A
6
Q
z-Buffer-algorithm Pros
A
7
Q
z-Buffer-algorithm Cons
A
