Fast horizon computation at all points of a terrain with visibility and shading applications

被引:36
作者
Stewart, AJ [1 ]
机构
[1] Univ Toronto, Dept Comp Sci, Dynam Graph Project, Toronto, ON M5S 3G4, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
terrain; digital elevation map; horizon; skyline; visibility; shadows; rendering; GIS;
D O I
10.1109/2945.675656
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
A terrain is most often represented with a digital elevation map consisting of a set of sample points from the terrain surface. This paper presents a fast and practical algorithm to compute the horizon, or skyline, at all sample points of a terrain. The horizons are useful in a number of applications, including the rendering of self-shadowing displacement maps, visibility culling for faster flight simulation,and rendering of cartographic data. Experimental and theoretical results are presented which show that the algorithm is more accurate that previous algorithms and is faster than previous algorithms in terrains of more than 100,000 sample points.
引用
收藏
页码:82 / 93
页数:12
相关论文
共 4 条
  • [1] Remarks on the computation of the horizon of a digital terrain
    Dercole, F
    APPLIED MATHEMATICS AND COMPUTATION, 2003, 146 (2-3) : 627 - 641
  • [2] HORIZON COMPUTATION ON A HIERARCHICAL TRIANGULATED TERRAIN MODEL
    DEFLORIANI, L
    MAGILLO, P
    VISUAL COMPUTER, 1995, 11 (03) : 134 - 149
  • [3] FAST AND ACCURATE VISIBILITY COMPUTATION IN URBAN SCENES
    Vallet, Bruno
    Houzay, Erwann
    PIA11: PHOTOGRAMMETRIC IMAGE ANALYSIS, 2011, 2011, 38-3 (W22): : 77 - 82
  • [4] A fast serial computation approach for computing viewshed of a region by detecting key spots on the terrain
    Salehi, Afshin
    Halabian, Amirhossein
    Beni, Farkhondeh Ahmadi
    Salehi, Mohammadmahdi
    Dadras, Bijan
    GEOCARTO INTERNATIONAL, 2022, 37 (27) : 17625 - 17641