Efficient Parallel and Distributed Algorithms for GIS Polygon Overlay Processing

Polygon clipping is one of the complex operations in computational geometry. It is used in Geographic Information Systems (GIS), Computer Graphics, and VLSI CAD. For two polygons with n and m vertices, the number of intersections can be O(nm). In this dissertation, we present the first output-sensitive CREW PRAM algorithm, which can perform polygon clipping in O(log n) time using O(n + k + k\u27) processors, where n is the number of vertices, k is the number of intersections, and k\u27 is the additional temporary vertices introduced due to the partitioning of polygons. The current best algorithm by Karinthi, Srinivas, and Almasi does not handle self-intersecting polygons, is not output-sensitive and must employ O(n^2) processors to achieve O(log n) time. The second parallel algorithm is an output-sensitive PRAM algorithm based on Greiner-Hormann algorithm with O(log n) time complexity using O(n + k) processors. This is cost-optimal when compared to the time complexity of the best-known sequential plane-sweep based algorithm for polygon clipping. For self-intersecting polygons, the time complexity is O(((n + k) log n log log n)/p) using p In addition to these parallel algorithms, the other main contributions in this dissertation are 1) multi-core and many-core implementation for clipping a pair of polygons and 2) MPI-GIS and Hadoop Topology Suite for distributed polygon overlay using a cluster of nodes. Nvidia GPU and CUDA are used for the many-core implementation. The MPI based system achieves 44X speedup while processing about 600K polygons in two real-world GIS shapefiles 1) USA Detailed Water Bodies and 2) USA Block Group Boundaries) within 20 seconds on a 32-node (8 cores each) IBM iDataPlex cluster interconnected by InfiniBand technology

Requirements for Topology in 3D GIS

Topology and its various benefits are well understood within the context of 2D Geographical Information Systems. However, requirements in three-dimensional (3D) applications have yet to be defined, with factors such as lack of users' familiarity with the potential of such systems impeding this process. In this paper, we identify and review a number of requirements for topology in 3D applications. The review utilises existing topological frameworks and data models as a starting point. Three key areas were studied for the purposes of requirements identification, namely existing 2D topological systems, requirements for visualisation in 3D and requirements for 3D analysis supported by topology. This was followed by analysis of application areas such as earth sciences and urban modelling which are traditionally associated with GIS, as well as others including medical, biological and chemical science. Requirements for topological functionality in 3D were then grouped and categorised. The paper concludes by suggesting that these requirements can be used as a basis for the implementation of topology in 3D. It is the aim of this review to serve as a focus for further discussion and identification of additional applications that would benefit from 3D topology. © 2006 The Authors. Journal compilation © 2006 Blackwell Publishing Ltd

IPH-Hydro Tools : uma ferramenta open source para determinação de informações topológicas em bacias hidrográficas integrada a um ambiente SIG

Watershed delineation, drainage network generation and determination of river hydraulic characteristics are important issues in hydrological sciences. In gene- ral, this information can be obtained from Digital Elevation Models (DEM) processing within GIS commercial softwares, such as ArcGIS and IDRISI. On the other hand, the use of open source GIS tools has increased significantly, and their advantages include free distribution, continuous development by user communities and full customization for specific requirements. Herein, we present the IPH-Hydro Tools, an open source tool coupled to MapWindow GIS software designed for watershed topology acquisition, including preprocessing steps in hydrological models such as MGB-IPH. In addition, several tests were carried out assessing the performance and applicability of the developed tool, given by a comparison with available GIS packages (ArcGIS, IDRISI, WhiteBox) for similar purposes. The IPH-Hydro Tools provided satisfactory results on tested applications, allowing for better drainage network and less processing time for catchment delineation. Regarding its limitations, the developed tool was incompatible with huge terrain data and showed some difficulties to represent drainage networks in extensive flat areas, which can occur in reservoirs and large riversA delimitação de bacias hidrográficas, geração da rede de drenagem e determinação de características hidráulicas de um rio de interesse são partes importantes de estudos na área de hidrologia. Atualmente muitas dessas informações são obtidas com o processamento de modelos digitais de elevação (MDEs) em sof- twares comerciais de SIG, como o ArcGIS e o IDRISI. Por outro lado, pacotes de SIG para uso livre, ou seja, gratuitos e de código aberto, têm aumentado significativamente nos últimos anos, e as vantagens desses pacotes incluem ampla distribuição e customização, desenvolvimento continuado pela comunidade de usuários e atendimento a necessidades específicas. Este trabalho apresenta o pacote livre (open-source) denominado IPH-Hydro Tools, um conjunto de ferramentas acoplado ao software livre MapWindow GIS criado para facilitar a aquisição de informações topológicas em bacias hidrográficas, bem como realização de etapas de pré-processamento em modelos hidrológicos a exemplo do MGB-IPH. Para avaliar a aplicabilidade e o desempenho da ferramenta desenvolvida foram realizados testes específicos, através da comparação dos resultados do IPH-Hydro Tools em relação a outros pacotes de SIG (ArcGIS, IDRISI, WhiteBox) disponíveis para esta finalidade. O IPH-Hydro Tools apresentou qualidade de rede de drenagem geralmente superior aos demais pacotes e menor tempo de processamento necessário para delimitação de bacias, apesar de algumas limitações como incompatibilidade em relação a matrizes muito grandes e dificuldade na representação da rede de drenagem em áreas extensas de mesma cota, a exemplo de reservatórios e rios muito largos

Isovist Analyst - An Arcview extension for planning visual surveillance

7-11 August, 2006, San Diego, CA, USA. Visual Surveillance e.g. CCTV, is now an essential part of the urban infrastructure in modern cities. One of the primary aims in visual surveillance is to ensure a maximum visual coverage of an area with the least number of visual surveillance installations, which is a NP-Hard maximal coverage problem. The planning of visual surveillance is a highly sensitive and costly task that has traditionally been done with a gut-feel process of establishing sight lines in CAD software. This paper demonstrates the ArcView extension Isovist Analyst, which automatically identifies a minimal number of potential visual surveillance sites that ensure complete visual coverage of an area. The paper proposes a Stochastical Rank and Overlap Elimination (S-ROPE) method, which iteratively identifies the optimal visual surveillance sites. S-ROPE method is essentially based on a greedy search technique, which has been improved by a combination of selective sampling strategy and random initialisation