A synthetic visual plane algorithm for visibility computation in consideration of accuracy and efficiency

• Published in: Computers & geosciences Vol. 109; pp. 315 - 322
• Main Authors: Yu, Jieqing, Wu, Lixin, Hu, Qingsong, Yan, Zhigang, Zhang, Shaoliang
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01.12.2017
• Subjects: DEM; Horizon; Synthetic visual plane; Viewshed; Visibility; Horizon; Visibility; Synthetic visual plane; DEM; Viewshed
• DOI: 10.1016/j.cageo.2017.09.004
• ISSN: 0098-3004

Visibility computation is of great interest to location optimization, environmental planning, ecology, and tourism. Many algorithms have been developed for visibility computation. In this paper, we propose a novel method of visibility computation, called synthetic visual plane (SVP), to achieve better performance with respect to efficiency, accuracy, or both. The method uses a global horizon, which is a synthesis of line-of-sight information of all nearer points, to determine the visibility of a point, which makes it an accurate visibility method. We used discretization of horizon to gain a good performance in efficiency. After discretization, the accuracy and efficiency of SVP depends on the scale of discretization (i.e., zone width). The method is more accurate at smaller zone widths, but this requires a longer operating time. Users must strike a balance between accuracy and efficiency at their discretion. According to our experiments, SVP is less accurate but more efficient than R2 if the zone width is set to one grid. However, SVP becomes more accurate than R2 when the zone width is set to 1/24 grid, while it continues to perform as fast or faster than R2. Although SVP performs worse than reference plane and depth map with respect to efficiency, it is superior in accuracy to these other two algorithms. •A novel algorithm of visibility computation is proposed.•The algorithm performs better than R2 and reference plane either in efficiency or accuracy or even both in some cases.•The complex of the algorithm is O(n2) on n × n grids.•A new way of sightline test by global horizon is developed.