Fast approximation of visibility dominance using topographic features as targets and the associated uncertainty

An approach to reduce visibility index computation time andmeasure the associated uncertainty in terrain visibility analysesis presented. It is demonstrated that the visibility indexcomputation time in mountainous terrain can be reduced substantially,without any significant information loss, if the lineof sight from each observer on the terrain is drawn only to thefundamental topographic features, i.e., peaks, pits, passes,ridges, and channels. However, the selected sampling of targetsresults in an underestimation of the visibility index ofeach observer. Two simple methods based on iterative comparisonsbetween the real visibility indices and the estimatedvisibility indices have been proposed for a preliminary assessmentof this uncertainty. The method has been demonstratedfor gridded digital elevation models

Use of GIS for planning visual surveillance installations

11-14 September, 2005, Denver, CO, USA. Visual Surveillance is now commonplace in modern societies. Generally, the layout of observers in artificial visual surveillance (e.g., CCTV camera) involves an iterative, manual and gut-feel process of trying various layouts until a satisfactory solution has been found. This paper proposes how a GIS, can be used to identify the optimal number and locations of observers, ensuring complete visual coverage using an automated technique, namely Rank and Overlap Elimination (ROPE). The ROPE technique is a greedy-search method, which iteratively selects the most visibly dominant observer with minimum overlapping vistas. The paper also proposes measurements to characterise the shape of open spaces, relevant in assessing natural surveillance. The paper demonstrates an extension, called Isovist Analyst, to the popular ArcView for planning artificial and natural surveillance in indoor and outdoor open spaces, with arbitrary geometry and topology

Use of plan curvature variations for the identification of ridges and channels on DEM

This paper proposes novel improvements in the traditional algorithms for the identification of ridge and channel (also called ravines) topographic features on raster digital elevation models (DEMs). The overall methodology consists of two main steps: (1) smoothing the DEM by applying a mean filter, and (2) detection of ridge and channel features as cells with positive and negative plan curvature respectively, along with a decline and incline in plan curvature away from the cell in direction orthogonal to the feature axis respectively. The paper demonstrates a simple approach to visualize the multi-scale structure of terrains and utilize it for semi-automated topographic feature identification. Despite its simplicity, the revised algorithm produced markedly superior outputs than a comparatively sophisticated feature extraction algorithm based on conic-section analysis of terrain

A methodology to investigate and visualise the geographical provenance of road traffic casualties in deprived areas

This paper demonstrates a methodology based on spatial overlay techniques, casualty data and national deprivation scores, to quantify and visualise the geographical provenance of road traffic casualties in deprived areas. A case study of four districts with varying deprivation in Greater Manchester, UK is presented. It is shown that most injuries to pedestrians and car occupants occur in areas of similar levels of affluence/deprivation to that of where the casualties live. Thus, it is proposed that the phenomenon underlying the cause of road traffic injuries are probably universal despite the differences in factors such as demography and level of deprivation

Weighted and metric surface networks - new insights and an interactive application for their generalisation in Tcl/Tk

The idea of characterising the different forms of natural topographic surfaces by a topologicalmodel based on their fundamental surface features has attracted many proposals. In this paper, adetailed discussion and new proposals on various issues related to the concept, generation, andvisualisation of two graph theoretic based surface topology data structures ? Weighted SurfaceNetworks and their improved version, Metric Surface Networks - are presented. Also presented isan interactive Tcl/Tk application called Surface Topology Toolkit, which has been developed tosupport the discussion on aspects of their generalisation and visualisation. The highlight of theSurface Topology Toolkit is the utility to allow arbitrary contraction unlike the usual verteximportance based criterion. This paper proposes that effective automated surface topologymodelling based on these surface networks requires (a) further research in the development of?computing? algorithms that will accurately locate critical surface points, be able to establishtopological links, and also check topological consistency, (b) transforming their 2D straight linegraph like appearance to 3D to improve visualisation and contraction, and (c) assessment and userawarenessabout the effects of each type of contraction criterion on the topography

Visualising the structure of architectural open spaces based on shape analysis

This paper proposes the application of some well known two-dimensional geometrical shape descriptors for the visualisation of the structure of architectural open spaces. The paper demonstrates the use of visibility measures such as distance to obstacles and amount of visible space to calculate shape descriptors such as convexity and skeleton of the open space. The aim of the paper is to indicate a simple, objective and quantifiable approach to understand the structure of open spaces otherwise impossible due to the complex construction of built structures.Comment: 10 pages, 9 figure

Surface networks

© Copyright CASA, UCL. The desire to understand and exploit the structure of continuous surfaces is common to researchers in a range of disciplines. Few examples of the varied surfaces forming an integral part of modern subjects include terrain, population density, surface atmospheric pressure, physico-chemical surfaces, computer graphics, and metrological surfaces. The focus of the work here is a group of data structures called Surface Networks, which abstract 2-dimensional surfaces by storing only the most important (also called fundamental, critical or surface-specific) points and lines in the surfaces. Surface networks are intelligent and “natural ” data structures because they store a surface as a framework of “surface ” elements unlike the DEM or TIN data structures. This report presents an overview of the previous works and the ideas being developed by the authors of this report. The research on surface networks has fou

Exploring multiple viewshed analysis using terrain features and optimisation techniques

The calculation of viewsheds is a routine operation in geographic information systems and is used in a wide range of applications. Many of these involve the siting of features, such as radio masts, which are part of a network and yet the selection of sites is normally done separately for each feature. The selection of a series of locations which collectively maximise the visual coverage of an area is a combinatorial problem and as such cannot be directly solved except for trivial cases. In this paper, two strategies for tackling this problem are explored. The first is to restrict the search to key topographic points in the landscape such as peaks, pits and passes. The second is to use heuristics which have been applied to other maximal coverage spatial problems such as location-allocation. The results show that the use of these two strategies results in a reduction of the computing time necessary by two orders of magnitude, but at the cost of a loss of 10% in the area viewed. Three different heuristics were used, of which Simulated Annealing produced the best results. However the improvement over a much simpler fast-descent swap heuristic was very slight, but at the cost of greatly increased running times. © 2004 Elsevier Ltd. All rights reserved