Skip to main content
A faster solution to the horizon problem
Published Web Location
https://doi.org/10.1029/WR016i004p00709No data is associated with this publication.
Abstract
An algorithm is developed for calculating the horizons for each point in a digital terrain grid in order N iterations, whereas all previous methods seem to be of O(N2) time complexity. The new method makes horizon computations reasonable, and ought to improve the accuracy of surface climate models in rugged terrain. © 1981.
Many UC-authored scholarly publications are freely available on this site because of the UC's open access policies. Let us know how this access is important for you.