Hidden surface removal for rectangles
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
A fast planar partition algorithm, II
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
An efficient algorithm for hidden surface removal
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
On the lower envelope of bivariate functions and its applications
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
A fast planar partition algorithm. I
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Output-sensitive hidden surface removal
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Robust, generic and efficient construction of envelopes of surfaces in three-dimensional spaces
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
| Hi-index | 0.00 |
We give an efficient, randomized hidden surface removal algorithm for scenes containing intersecting faces. Randomization is assumed only in the algorithm and not in the input. The algorithm is quasi-output sensitive in the following sense. Project all boundary edges as well as the edges formed by the intersections of scene faces onto the view plane. This gives rise to several junctions in the view plane, visible as well as invisible. Let us define the degree deg(q) of a junction q as the number of scene faces that give rise to q. Define l(q), the obstruction level of q, to be the number of faces in the scene that obscure q with respect to the view point. Thus l(q)=0 iff q is visible. Then the expected time spent by the algorithm on a junction q is inversely proportional to (1 + l(q))^d^e^g^(^q^)^-^1. Thus the work done on a junction decreases very fast as its obstruction level w.r.t. the view point increases.