Book ChapterDOI
An Efficient Natural Neighbour Interpolation Algorithm for Geoscientific Modelling
Hugo Ledoux,Christopher M. Gold +1 more
- pp 97-108
Reads0
Chats0
TLDR
An algorithm to implement natural neighbour interpolation in two and three dimensions, which has the same time complexity as the insertion of a single point in a Voronoi diagram or a Delaunay triangulation.Abstract:
Although the properties of natural neighbour interpolation and its usefulness with scattered and irregularly spaced data are well-known, its implementation is still a problem in practice, especially in three and higher dimensions. We present in this paper an algorithm to implement the method in two and three dimensions, but it can be generalized to higher dimensions. Our algorithm, which uses the concept of flipping in a triangulation, has the same time complexity as the insertion of a single point in a Voronoi diagram or a Delaunay triangulation.read more
Citations
More filters
Journal ArticleDOI
Crop height monitoring with digital imagery from Unmanned Aerial System (UAS)
TL;DR: The growth curve results showed that the proposed approach indicated less RMSE and generated more reliable growth curves for monitoring sorghum height, which could be used to derive a growth curve by fitting a sigmoidal curve.
Journal ArticleDOI
Classifying airborne LiDAR point clouds via deep features learned by a multi-scale convolutional neural network
TL;DR: The proposed deep feature-based method for accurately classifying multiple ground objects from airborne LiDAR point clouds can effectively distinguish eight types of ground objects, including low vegetation, impervious surface, car, fence/hedge, roof, facade, shrub and tree, and achieves a higher accuracy than other existing methods.
Journal ArticleDOI
CEH-GEAR: 1 km resolution daily and monthly areal rainfall estimates for the UK for hydrological and other applications
Virginie Keller,Maliko Tanguy,Ilaria Prosdocimi,J. A. Terry,Olivia Hitt,Steven J. Cole,Matthew Fry,D. G. Morris,Harry Dixon +8 more
TL;DR: The CEH-GEAR data set as discussed by the authors contains 1 km grids of daily and monthly rainfall estimates for Great Britain (GB) and Northern Ireland (NI) (together with approximately 3500 km2 of catchment in the Republic of Ireland) from 1890 onwards.
Journal ArticleDOI
Mountain torrents: Quantifying vulnerability and assessing uncertainties.
Reinhold Totschnig,Sven Fuchs +1 more
TL;DR: There is no need to distinguish between different sediment-laden torrent processes when assessing vulnerability of residential buildings towards torrent processes, and the derived vulnerability functions may be applied within the framework of risk management for mountain hazards within the European Alps.
Journal ArticleDOI
Generating an optimal DTM from airborne laser scanning data for landslide mapping in a tropical forest environment
Khamarrul Azahari Razak,Khamarrul Azahari Razak,Michele Santangelo,Cees J. van Westen,Menno Straatsma,Steven M. de Jong +5 more
TL;DR: In this article, the authors evaluated the suitability of airborne laser scanning (ALS) data for generating an optimal digital terrain model (DTM) for mapping landslides in the Cameron Highlands, Malaysia.
References
More filters
Book
Spatial Tessellations: Concepts and Applications of Voronoi Diagrams
TL;DR: In this article, the Voronoi diagram generalizations of the Voroni diagram algorithm for computing poisson Voroni diagrams are defined and basic properties of the generalization of Voroni's algorithm are discussed.
Journal ArticleDOI
Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes
Journal ArticleDOI
A sweepline algorithm for Voronoi diagrams
TL;DR: A geometric transformation is introduced that allows Voronoi diagrams to be computed using a sweepline technique and is used to obtain simple algorithms for computing the Vor onoi diagram of point sites, of line segment sites, and of weighted point sites.
Journal ArticleDOI
Primitives for the manipulation of general subdivisions and the computation of Voronoi
Leonidas J. Guibas,Jorge Stolfi +1 more
TL;DR: The following problem is discussed: given n points in the plane (the sites) and an arbitrary query point q, find the site that is closest to q, which can be solved by constructing the Voronoi diagram of the griven sites and then locating the query point in one of its regions.