Computing the Visibility of Points on a Surface Given by Isolines

摘要

An algorithm for computing the visibility of points on the surface given by lines of equal level is suggested. Time and space complexities of the computational algorithm are reduced by representing initial data through regular binary truncated trees. This allows one to use the general-to-specific (descent) method of discrete geometry.