共查询到20条相似文献，搜索用时 31 毫秒
1.
TianXing Yu LiYang Xiong Min Cao ZhiHui Wang YiChi Zhang 《International journal of geographical information science》2016,30(11):2171-2187
Selecting the set of candidate viewpoints (CVs) is one of the most important procedures in multiple viewshed analysis. However, the quantity of CVs remains excessive even when only terrain feature points are selected. Here we propose the Region Partitioning for Filtering (RPF) algorithm, which uses a region partitioning method to filter CVs of a multiple viewshed. The region partitioning method is used to decompose an entire area into several regions. The quality of CVs can be evaluated by summarizing the viewshed area of each CV in each region. First, the RPF algorithm apportions each CV to a region wherein the CV has a larger viewshed than that in other regions. Then, CVs with relatively small viewshed areas are removed from their original regions or reassigned to another region in each iterative step. In this way, a set of high-quality CVs can be preserved, and the size of the preserved CVs can be controlled by the RPF algorithm. To evaluate the computational efficiency of the RPF algorithm, its performance was compared with simple random (SR), simulated annealing (SA), and ant colony optimization (ACO) algorithms. Experimental results indicate that the RPF algorithm provides more than a 20% improvement over the SR algorithm, and that, on average, the computation time of the RPF algorithm is 63% that of the ACO algorithm. 相似文献
2.
3.
Viewshed analysis remains one of the most popular GIS tools for assessing visibility, despite the recognition of several limitations when quantifying visibility from a human perspective. The visual significance of terrain is heavily influenced by the vertical dimension (i.e. slope, aspect and elevation) and distance from the observer, neither of which are adjusted for in standard viewshed analyses. Based on these limitations, this study aimed to develop a methodology which extends the standard viewshed to represent visible landscape as more realistically perceived by a human, called the ‘Vertical Visibility Index’ (VVI). This method was intended to overcome the primary limitations of the standard viewshed by calculating the vertical degrees of visibility between the eye-level of a human and the top and bottom point of each visible cell in a viewshed. Next, the validity of the VVI was assessed using two comparison methods: 1) the known proportion of vegetation visible as assessed through imagery for 10 locations; and 2) standard viewshed analysis for 50 viewpoints in an urban setting. While positive, significant correlations were observed between the VVI values and both comparators, the correlation was strongest between the VVI values and the image verified, known values (r = 0.863, p = 0.001). The validation results indicate that the VVI is a valid method which can be used as an improvement on standard viewshed analyses for the accurate representation of landscape visibility from a human perspective. 相似文献
4.
Yanli Zhao Anand Padmanabhan 《International journal of geographical information science》2013,27(2):363-384
Viewshed analysis, often supported by geographic information system, is widely used in many application domains. However, as terrain data continue to become increasingly large and available at high resolutions, data-intensive viewshed analysis poses significant computational challenges. General-purpose computation on graphics processing units (GPUs) provides a promising means to address such challenges. This article describes a parallel computing approach to data-intensive viewshed analysis of large terrain data using GPUs. Our approach exploits the high-bandwidth memory of GPUs and the parallelism of massive spatial data to enable memory-intensive and computation-intensive tasks while central processing units are used to achieve efficient input/output (I/O) management. Furthermore, a two-level spatial domain decomposition strategy has been developed to mitigate a performance bottleneck caused by data transfer in the memory hierarchy of GPU-based architecture. Computational experiments were designed to evaluate computational performance of the approach. The experiments demonstrate significant performance improvement over a well-known sequential computing method, and an enhanced ability of analyzing sizable datasets that the sequential computing method cannot handle. 相似文献
5.
Huanping Wu Lingqing Yao Bing Luo 《International journal of geographical information science》2013,27(9):955-964
As increasingly large‐scale and higher‐resolution terrain data have become available, for example air‐form and space‐borne sensors, the volume of these datasets reveals scalability problems with existing GIS algorithms. To address this problem, a kind of serial algorithm was developed to generate viewshed on large grid‐based digital elevation models (DEMs). We first divided the whole DEM into rectangular blocks in row and column directions (called block partitioning), then processed these blocks with four axes followed by four sectors sequentially. When processing the particular block, we adopted the ‘reference plane’ algorithm to calculate the visibility of the target point on the block, and adjusted the calculation sequence according to the different spatial relationships between the block and the viewpoint since the viewpoint is not always inside the DEM. By adopting the ‘Reference Plane’ algorithm and using a block partitioning method to segment and load the DEM dynamically, it is possible to generate viewshed efficiently in PC‐based environments. Experiments showed that the divided block should be dynamically loaded whole into computer main memory when partitioning, and the suggested approach retains the accuracy of the reference plane algorithm and has near linear compute complexity. 相似文献
6.
Andrej Osterman Lucas Benedičič Patrik Ritoša 《International journal of geographical information science》2014,28(11):2304-2327
A rapid and flexible parallel approach for viewshed computation on large digital elevation models is presented. Our work is focused on the implementation of a derivate of the R2 viewshed algorithm. Emphasis has been placed on input/output (IO) efficiency that can be achieved by memory segmentation and coalesced memory access. An implementation of the parallel viewshed algorithm on the Compute Unified Device Architecture (CUDA), which exploits the high parallelism of the graphics processing unit, is presented. This version is referred to as r.cuda.visibility. The accuracy of our algorithm is compared to the r.los R3 algorithm (integrated into the open-source Geographic Resources Analysis Support System geographic information system environment) and other IO-efficient algorithms. Our results demonstrate that the proposed implementation of the R2 algorithm is faster and more IO efficient than previously presented IO-efficient algorithms, and that it achieves moderate calculation precision compared to the R3 algorithm. Thus, to the best of our knowledge, the algorithm presented here is the most efficient viewshed approach, in terms of computational speed, for large data sets. 相似文献
7.
Peter F. Fisher 《International journal of geographical information science》2013,27(4):331-347
Abstract In most documentation of geographical information systems (GIS) it is very rare to find details of the algorithms used in the software, but alternative formulations of the same process may derive different results. In this research several alternatives in the design of viewshed algorithms are explored. Three major features of viewshed algorithms are examined: how elevations in the digital elevation model are inferred, how viewpoint and target are represented, and the mathematical formulation of the comparison. It is found that the second of these produces the greatest variability in the viewable area (up to 50 per cent over the mean viewable area), while the last gives the least. The same test data are run in a number of different GIS implementations of the viewshed operation, and smaller, but still considerable, variability in the viewable area is observed. The study highlights three issues: the need for standards and/or empirical benchmark datasets for GIS functions; the desirability of publication of algorithms used in GIS operations; and the fallacy of the binary representation of a complex GIS product such as the viewshed. 相似文献
8.
地形作为影响植被覆盖的重要因素,对植被恢复评价以及生态修复规划意义重大。地形位作为测度地形因子综合效应的指标,具有单一地形因子难以比拟的优势。然而,现有地形位指数算法以整个研究区为参照,未考虑空间异质性,难以反映植被生长的局部环境特征。基于地理学第三定律对地理环境相似的强调,融合“空间位置邻近”和“环境特征相似”,对传统地形位模型进行改进：① 引入局部窗口算法,以突出局部地形特征;② 在不同生境因子组合下测算地形位指数,以排除环境差异对地形位作用的干扰。案例研究表明,新模型有效提升了地形位指数对植被覆盖水平的解释力度;当考虑生境因子组合,且采用最优窗口时,局部窗口地形位指数与植被覆盖度之间的相关性最高。此外,通过观察不同生境组合下的地形位指数发现,在高热少水阴坡和高热少水阳坡条件下,植被覆盖度与局部窗口地形位指数具有更高相关性;可见,越是水资源相对匮乏区域,植被覆盖对局部窗口地形位的响应越敏感。本文有望为植被恢复评价与规划提供新的指标。 相似文献
9.
Phil Bartie William Mackaness 《International journal of geographical information science》2017,31(4):805-824
Visibility modelling calculates what an observer could theoretically see in the surrounding region based on a digital model of the landscape. In some cases, it is not necessary, nor desirable, to compute the visibility of an entire region (i.e. a viewshed), but instead it is sufficient and more efficient to calculate the visibility from point to point, or from a point to a small set of points, such as computing the intervisibility of predators and prey in an agent-based simulation. This paper explores how different line-of-sight (LoS) sample ordering strategies increase the number of early target rejections, where the target is considered to be obscured from view, thereby improving the computational efficiency of the LoS algorithm. This is of particular importance in dynamic environments where the locations of the observers, targets and other surface objects are being frequently updated. Trials were conducted in three UK cities, demonstrating a robust fivefold increase in performance for two strategies (hop, divide and conquer). The paper concludes that sample ordering methods do impact overall efficiency, and that approaches which disperse samples along the LoS perform better in urban regions than incremental scan methods. The divide and conquer method minimises elevation interception queries, making it suitable when elevation models are held on disk rather than in memory, while the hopping strategy was equally fast, algorithmically simpler, with minimal overhead for visible target cases. 相似文献
10.
The concept of computing least-cost paths has been proposed and discussed for a few decades but only in simplified form due to the limited computational resources in the past. With the advancement of computer technology in speed and data storage, it is now possible to implement least-cost path algorithms with realistic conditions. In this paper, we present our implementations of least-cost paths by integrating viewshed information computed from digital elevation models. Our implementations and analyses include four possible types of paths. They are scenic paths, strategic paths, hidden paths, and withdrawn paths. While possible applications of these least-cost paths include planning of civil engineering, military and environmental planning, other extensions can be formulated without much difficulty. 相似文献
11.
12.
Ran Wei Alan T. Murray 《International journal of geographical information science》2016,30(3):432-450
Location siting is an important part of service provision, with much potential to impact operational efficiency, safety, security, system reliability, etc. A class of location models seeks to optimize coverage of demand for service that is continuously distributed across space. Decision-making and planning contexts include police/fire resource allocation for a community, siting cellular towers to support cell phone signal transmission, locating emergency warning sirens to alert the public of severe weather and other related dangers, and many others as well. When facilities can be sited anywhere in continuous space to provide coverage to an entire region, this is a very computationally challenging problem to solve because potential demand for service is everywhere and there are an infinite number of potential facility sites to consider. This article develops a new parallel solution approach for this location coverage optimization problem through an iterative bounding scheme on multi-core architectures. The developed approach is applied to site emergency warning sirens in Dublin, Ohio, and fire stations in Elk Grove, California. Results demonstrate the effectiveness and efficiency of the proposed approach, enabling real-time analysis and planning. This work illustrates that the integration of cyberinfrastructure can significantly improve computational efficiency in solving challenging spatial optimization problems, fitting the themes of this special issue: cyberinfrastructure, GIS, and spatial optimization. 相似文献
13.
L. De Floriani C. Montani R. Scopigno 《International journal of geographical information science》2013,27(6):515-531
Abstract In this paper we address the problem of computing visibility information on digital terrain models in parallel. We propose a parallel algorithm for computing the visible region of an observation point located on the terrain. The algorithm is based on a sequential triangle-sorting visibility approach proposed by De Floriani et al. (1989). Static and dynamic parallelization strategies, both in terms of partitioning criteria and scheduling policies, are discussed. The different parallelization strategies are implemented on an MIMD multicomputer and evaluated through experimental results. 相似文献
14.
DEM 点位地形信息量化模型研究 总被引：2，自引：0，他引：2
针对DEM 点位, 首先应用微分几何法对其所负载的语法信息量进行测度, 其次根据地形特征点类型及地形结构特征确定其语义信息量, 然后基于信息学理论构建了DEM 点位地形信息综合量化模型。在此基础上, 以黄土丘陵沟壑区作为实验样区, 对DEM 点位地形信息量提取方法及其在地形简化中的初步实例应用进行了探讨和验证。实验结果显示, 所提出的DEM 点位地形信息量化方案可行;基于DEM 地形信息量指数的多尺度DEM 构建方案, 具有机理明确、易于实现的特点, 并通过优先保留地形骨架特征点, 可以有效减少地形失真, 从而满足不同层次的多尺度数字地形建模和表达要求。对DEM 点位地形信息进行有效量化, 为认识DEM 地形信息特征提供了一个新的切入点, 同时为多尺度数字地形建模提供理论依据与方法支持。 相似文献
15.
基于山地灾害动态过程仿真需要的考虑,并针对该动态过程仿真时渲染数据量过大所造成的实时性较差的问题,提出了利用改进的三角形二叉树LOD算法实现地形三维建模与可视化的方法。算法对山地地形数据进行了分层和分块的预处理,用三角形二叉树表示地形网格,并结合视点和局部地形的粗糙程度,动态的载入所需的地形块和释放无用的地形块,使得内存中的地形数据维持在一定范围内。实验结果表明;在对地形渲染不失真的前提下,本方法能够有效地提高地形绘制的效率,可应用到大规模山地地形的三维建模与可视化中去,为整个山地灾害的动态过程仿真奠定了良好的基础。 相似文献
16.
17.
Bi Yu Chen William H.K. Lam Shih-Lung Shaw Ke Yan 《International journal of geographical information science》2014,28(1):22-38
Large-scale global positioning system (GPS) positioning information of floating cars has been recognised as a major data source for many transportation applications. Mapping large-scale low-frequency floating car data (FCD) onto the road network is very challenging for traditional map-matching (MM) algorithms developed for in-vehicle navigation. In this paper, a multi-criteria dynamic programming map-matching (MDP-MM) algorithm is proposed for online matching FCD. In the proposed MDP-MM algorithm, the MDP technique is used to minimise the number of candidate routes maintained at each GPS point, while guaranteeing to determine the best matching route. In addition, several useful techniques are developed to improve running time of the shortest path calculation in the MM process. Case studies based on real FCD demonstrate the accuracy and computational performance of the MDP-MM algorithm. Results indicated that the MDP-MM algorithm is competitive with existing algorithms in both accuracy and computational performance. 相似文献
18.
DEM流径算法的相似性分析 总被引：4，自引：0，他引：4
流径算法是分布式水文模型、土壤侵蚀模拟等研究中的关键技术环节,决定着汇水面积、地形指数等许多重要的地形、水文参数的计算。本文以黄土高原两个典型样区的不同分辨率DEM为研究对象,对常用的五种流径算法(D8、Rho8、Dinf、MFD和DEMON)通过相对差系数、累积频率图、XY散点分布图等进行了定量的对比分析。结果表明:算法的差异主要集中在坡面区域,汇流区域各类算法的差别较小;算法差异在不同DEM尺度下都有所体现,但高分辨率下的差异会更明显;在地形复杂区域,多流向算法要优于单流向算法。研究也进一步指出汇水面积、地形指数等水文参数对流径算法具有强烈的依赖性。 相似文献
19.
Quanhua Dong 《International journal of geographical information science》2018,32(2):302-323
Geometric buffers are important for spatial analysis in many applications of geographic information systems (GISs), such as environmental measurement and management, human health, urban planning, etc. Geometric buffer generation algorithms are well studied in the Euclidean space where the buffer distance is measured by Euclidean metrics; however, very few algorithms are available for generating geometric buffers on the terrain surface in a virtual globe where the buffer distance is measured by geodesic metrics. This paper proposes a tile-based method for geodesic buffer generation according to the characteristics of a virtual globe. It extends the vector tile model (VTM) to organize terrain and vector data, and the XYH algorithm is improved to build geodesic distance fields for terrain meshes. Based on the data organization and the improved XYH algorithm, a geodesic buffer is generated via three main steps: selecting and assembling tiles, updating geodesic distance fields and tracing the boundaries of buffer zones. This method is implemented with multi-scale terrain and vector data, and the experimental results show that it is valid and exact and can be applied in practical applications. 相似文献
20.
Wildfire evacuation trigger points are prominent geographic features (e.g., ridge lines, rivers, and roads) utilized in timing evacuation warnings. When a fire crosses a feature, an evacuation warning is issued to the communities or firefighters in the path of the fire. Current methods for generating trigger buffers have limited utility because the resulting buffers are not explicitly tied to prominent geographic features, making it difficult to visually determine when a fire has breached a trigger point. This work aims to address this limitation by using reverse geocoding to identify prominent geographic trigger points that have more value to emergency managers. The method consists of three steps: 1) generate a trigger buffer using fire-spread modeling; 2) utilize online reverse-geocoding to retrieve geographic features proximal to the buffer boundary; and 3) identify the most prominent geographic features using viewshed analysis and compute the warning time each would offer given predicted fire spread rates to proximal communities. A case study of Julian, California is presented to identify prominent geographic trigger points that may have value to emergency managers in improving the timing of wildfire evacuation warnings in this region. 相似文献