ast sweeping methods for distance and visibility computation on the grids
Richard Tsai
Princeton University
PACM & Mathematics
In this talk, we will discuss two fast methods for computing the distance function and
the visibility information in a level set setting. The methods make use of Gauss-Seidel type iterative strategy and the upwinding idea originated from the PDE theory. These methods can be generalized to other problems such as distance reinitialization and ray tracing.