scispace - formally typeset
Open Access

Improving the accuracy of digital terrain models

Gabriela Droj
Reads0
Chats0
TLDR
The change from paper maps to GIS, in various kinds of ge- ographical data analysis and applications, has made it easy to use the same spatial data for dierent applications.
Abstract
The change from paper maps to GIS, in various kinds of ge- ographical data analysis and applications, has made it easy to use the same spatial data for dierent

read more

Citations
More filters

Terrain mapping from unmanned aerial vehicles

TL;DR: In this article, the authors proposed a novel way of generating DTM and DSM by using UAVs for different land covers including forest, plantation and developed areas in the tropical region of Malaysia.
References
More filters
Book ChapterDOI

Quantifying Uncertainty of Digital Elevation Models Derived from Topographic Maps

TL;DR: In this paper, the authors explored a methodology for quantifying the uncertainty of DEMs created by digitizing topographic maps and examined the origins of uncertainty in DEM production, by computing a vector total of Root Mean Square Error from the source map, sampling and measurement errors, and the interpolation process.

Assessment of Kriging Accuracy in the GIS Environment

I-Kuai Hung
TL;DR: In this article, the sensitivity of ordinary Kriging interpolation in the GIS environment was evaluated with respect to the resolution of the predicted grid and conclusions were drawn for applications in spatial analysis.

Constrained Visualization of 2D Positive Data using Modified Quadratic Shepard Method

TL;DR: This paper presents an algorithm that produces a non-negative graph through scattered positive data sets using Modified Quadratic Shepard method, which is improved in that it produces the positive graph without much deviation of shapes from the ones due to Modified QuadRatic Shepard scheme.
Book ChapterDOI

Algorithms for Triangulated Terrains

TL;DR: In this article, the authors discuss ways to represent a triangulated irregular network (TIN) in a data structure, and give some of the basic algorithms that work on TINs.