We derive a new output-sensitive algorithm for hidden surface removal
in a collection of n triangles, viewed from a point z such that they c
an be ordered in an acyclic fashion according to their nearness to z.
If k is the combinatorial complexity of the output visibility map, the
n we obtain a sophisticated randomized algorithm that runs in (randomi
zed) time O(n4/3 log2.89 n + k3/5n4/5+delta) for any delta > 0. The me
thod is based on a new technique for tracing the visible contours usin
g ray shooting.