.TH v.surf.rst 1grass "" "GRASS 8.3.1" "GRASS GIS User's Manual"
.SH NAME
\fI\fBv.surf.rst\fR\fR  \- Performs surface interpolation from vector points map by splines.
.br
Spatial approximation and topographic analysis from given point or isoline data in vector format to floating point raster format using regularized spline with tension.
.SH KEYWORDS
vector, surface, interpolation, splines, RST, 3D, no\-data filling, parallel
.SH SYNOPSIS
\fBv.surf.rst\fR
.br
\fBv.surf.rst \-\-help\fR
.br
\fBv.surf.rst\fR [\-\fBctd\fR] \fBinput\fR=\fIname\fR  [\fBlayer\fR=\fIstring\fR]   [\fBzcolumn\fR=\fIname\fR]   [\fBwhere\fR=\fIsql_query\fR]   [\fBelevation\fR=\fIname\fR]   [\fBslope\fR=\fIname\fR]   [\fBaspect\fR=\fIname\fR]   [\fBpcurvature\fR=\fIname\fR]   [\fBtcurvature\fR=\fIname\fR]   [\fBmcurvature\fR=\fIname\fR]   [\fBdeviations\fR=\fIname\fR]   [\fBcvdev\fR=\fIname\fR]   [\fBtreeseg\fR=\fIname\fR]   [\fBoverwin\fR=\fIname\fR]   [\fBnprocs\fR=\fIinteger\fR]   [\fBmask\fR=\fIname\fR]   [\fBtension\fR=\fIfloat\fR]   [\fBsmooth\fR=\fIfloat\fR]   [\fBsmooth_column\fR=\fIstring\fR]   [\fBsegmax\fR=\fIinteger\fR]   [\fBnpmin\fR=\fIinteger\fR]   [\fBdmin\fR=\fIfloat\fR]   [\fBdmax\fR=\fIfloat\fR]   [\fBzscale\fR=\fIfloat\fR]   [\fBtheta\fR=\fIfloat\fR]   [\fBscalex\fR=\fIfloat\fR]   [\-\-\fBoverwrite\fR]  [\-\-\fBhelp\fR]  [\-\-\fBverbose\fR]  [\-\-\fBquiet\fR]  [\-\-\fBui\fR]
.SS Flags:
.IP "\fB\-c\fR" 4m
.br
Perform cross\-validation procedure without raster approximation
.IP "\fB\-t\fR" 4m
.br
Use scale dependent tension
.IP "\fB\-d\fR" 4m
.br
Output partial derivatives instead of topographic parameters
.IP "\fB\-\-overwrite\fR" 4m
.br
Allow output files to overwrite existing files
.IP "\fB\-\-help\fR" 4m
.br
Print usage summary
.IP "\fB\-\-verbose\fR" 4m
.br
Verbose module output
.IP "\fB\-\-quiet\fR" 4m
.br
Quiet module output
.IP "\fB\-\-ui\fR" 4m
.br
Force launching GUI dialog
.SS Parameters:
.IP "\fBinput\fR=\fIname\fR \fB[required]\fR" 4m
.br
Name of input vector map
.br
Or data source for direct OGR access
.IP "\fBlayer\fR=\fIstring\fR" 4m
.br
Layer number or name
.br
Vector features can have category values in different layers. This number determines which layer to use. When used with direct OGR access this is the layer name.
.br
Default: \fI1\fR
.IP "\fBzcolumn\fR=\fIname\fR" 4m
.br
Name of the attribute column with values to be used for approximation
.br
If not given and input is 2D vector map then category values are used. If input is 3D vector map then z\-coordinates are used.
.IP "\fBwhere\fR=\fIsql_query\fR" 4m
.br
WHERE conditions of SQL statement without \(cqwhere\(cq keyword
.br
Example: income < 1000 and population >= 10000
.IP "\fBelevation\fR=\fIname\fR" 4m
.br
Name for output surface elevation raster map
.IP "\fBslope\fR=\fIname\fR" 4m
.br
Name for output slope raster map
.IP "\fBaspect\fR=\fIname\fR" 4m
.br
Name for output aspect raster map
.IP "\fBpcurvature\fR=\fIname\fR" 4m
.br
Name for output profile curvature raster map
.IP "\fBtcurvature\fR=\fIname\fR" 4m
.br
Name for output tangential curvature raster map
.IP "\fBmcurvature\fR=\fIname\fR" 4m
.br
Name for output mean curvature raster map
.IP "\fBdeviations\fR=\fIname\fR" 4m
.br
Name for output deviations vector point map
.IP "\fBcvdev\fR=\fIname\fR" 4m
.br
Name for output cross\-validation errors vector point map
.IP "\fBtreeseg\fR=\fIname\fR" 4m
.br
Name for output vector map showing quadtree segmentation
.IP "\fBoverwin\fR=\fIname\fR" 4m
.br
Name for output vector map showing overlapping windows
.IP "\fBnprocs\fR=\fIinteger\fR" 4m
.br
Number of threads for parallel computing
.br
Default: \fI1\fR
.IP "\fBmask\fR=\fIname\fR" 4m
.br
Name of raster map used as mask
.IP "\fBtension\fR=\fIfloat\fR" 4m
.br
Tension parameter
.br
Default: \fI40.\fR
.IP "\fBsmooth\fR=\fIfloat\fR" 4m
.br
Smoothing parameter
.br
Smoothing is by default 0.5 unless smooth_column is specified
.IP "\fBsmooth_column\fR=\fIstring\fR" 4m
.br
Name of the attribute column with smoothing parameters
.IP "\fBsegmax\fR=\fIinteger\fR" 4m
.br
Maximum number of points in a segment
.br
Default: \fI40\fR
.IP "\fBnpmin\fR=\fIinteger\fR" 4m
.br
Minimum number of points for approximation in a segment (>segmax)
.br
Default: \fI300\fR
.IP "\fBdmin\fR=\fIfloat\fR" 4m
.br
Minimum distance between points (to remove almost identical points)
.IP "\fBdmax\fR=\fIfloat\fR" 4m
.br
Maximum distance between points on isoline (to insert additional points)
.IP "\fBzscale\fR=\fIfloat\fR" 4m
.br
Conversion factor for values used for approximation
.br
Default: \fI1.0\fR
.IP "\fBtheta\fR=\fIfloat\fR" 4m
.br
Anisotropy angle (in degrees counterclockwise from East)
.IP "\fBscalex\fR=\fIfloat\fR" 4m
.br
Anisotropy scaling factor
.SH DESCRIPTION
\fIv.surf.rst\fR program performs spatial approximation based on
\fIz\-values\fR (input vector map is 3D and \fBzcolumn\fR parameter
is not given), \fIcategories\fR (input vector map is 2D
and \fBzcolumn\fR parameter is not given), or \fIattributes\fR
(\fBzcolumn\fR parameter is given) of point or isoline data given in
a vector map named \fBinput\fR to grid cells in the output raster
map \fBelevation\fR representing a surface.
.PP
As an option, simultaneously with approximation, topographic
parameters slope, aspect, profile curvature (measured in the direction
of the steepest slope), tangential curvature (measured in the
direction of a tangent to contour line) or mean curvature are computed
and saved as raster maps specified by the options \fBslope, aspect,
pcurv, tcurv, mcurv\fR respectively. If \fB\-d\fR flag is
set, \fIv.surf.rst\fR outputs partial derivatives
fx,fy,fxx,
fyy,fxy instead of slope, aspect, profile,
tangential and mean curvatures respectively. If the input vector map
have time stamp, the program creates time stamp for all output maps.
.PP
User can either use \fIr.mask\fR to set a mask
or specify a raster map in \fBmask\fR option, which will be used
as a mask. The approximation is skipped for cells which have zero or
NULL value in mask. NULL values will be assigned to these cells in all
output raster maps. Data points are checked for identical points and
points that are closer to each other than the given \fBdmin\fR are
removed.  If sparsely digitized contours or isolines are used as
input, additional points are computed between each 2 points on a line
if the distance between them is greater than
specified \fBdmax\fR. Parameter
\fBzmult\fR allows user to rescale the values used for approximation
(useful e.g. for transformation of
elevations given in feet to meters, so that the proper values of slopes
and curvatures can be computed).
.PP
Regularized spline with tension is used for the approximation. The
\fBtension\fR parameter tunes the character of the resulting surface
from thin plate to membrane. Smoothing parameter \fBsmooth\fR
controls the deviation between the given points and the resulting
surface and it can be very effective in smoothing noisy data while
preserving the geometrical properties of the surface.  With the
smoothing parameter set to zero (\fBsmooth=0\fR) the resulting
surface passes exactly through the data points (spatial interpolation
is performed). When smoothing parameter is used, it is also possible
to output a vector point map \fBdeviations\fR containing deviations of the
resulting surface from the given data.
.PP
If the number of given points is greater than \fBsegmax\fR, segmented
processing is used. The region is split into quadtree\-based
rectangular segments, each having less than \fBsegmax\fR points and
approximation is performed on each segment of the region. To ensure
smooth connection of segments the approximation function for each
segment is computed using the points in the given segment and the
points in its neighborhood which are in the rectangular window
surrounding the given segment. The number of points taken for
approximation is controlled by \fBnpmin\fR, the value of which must
be larger than \fBsegmax\fR.  User can choose to output vector
maps \fBtreeseg\fR and \fBoverwin\fR which represent the quad tree
used for segmentation and overlapping neighborhoods from which
additional points for approximation on each segment were taken.
.PP
Predictive error of surface approximation for given parameters can be
computed using the \fB\-c\fR flag. A crossvalidation procedure is then
performed using the data given in the vector map \fBinput\fR and the
estimated predictive errors are stored in the vector point map
\fBcvdev\fR. When using this flag, no raster output maps are computed.
Anisotropic surfaces can be interpolated by setting anisotropy
angle \fBtheta\fR and scaling factor \fBscalex\fR.  The program
writes values of selected input and internally computed parameters to
the history file of raster map
\fBelevation\fR.
.PP
The user must run \fIg.region\fR before
the program to set the region and resolution for approximation.
.SH NOTES
\fIv.surf.rst\fR uses regularized spline with tension for
approximation from vector data. The module does not require input data
with topology, therefore both level1 (no topology) and level2 (with
topology) vector point data are supported.  Additional points are used
for approximation between each 2 points on a line if the distance
between them is greater than specified \fBdmax\fR. If \fBdmax\fR is
small (less than cell size) the number of added data points can be
vary large and slow down approximation significantly.  The
implementation has a segmentation procedure based on quadtrees which
enhances the efficiency for large data sets. Special color tables are
created by the program for output raster maps.
.PP
Topographic parameters are computed directly from the approximation
function so that the important relationships between these parameters
are preserved. The equations for computation of these parameters and
their interpretation is described in
Mitasova and Hofierka, 1993
or Neteler and Mitasova, 2004).
Slopes and aspect are computed in degrees (0\-90 and 1\-360 respectively).
The aspect raster map has value 0 assigned to flat areas (with slope less
than 0.1%) and to singular points with undefined aspect. Aspect points
downslope and is 90 to the North, 180 to the West, 270 to the South and
360 to the East, the values increase counterclockwise. Curvatures are positive
for convex and negative for concave areas. Singular points with undefined
curvatures have assigned zero values.
.PP
Tension and smoothing allow user to tune the surface character.
For most landscape scale applications the default values should
provide adequate results.  The program gives warning when significant
overshoots appear in the resulting surface and higher tension or
smoothing should be used.
.PP
To select parameters that will produce a surface with desired
properties, it is useful to know that the method is scale dependent
and the tension works as a rescaling parameter (high tension
\(dqincreases the distances between the points\(dq and reduces the
range of impact of each point, low tension \(dqdecreases the
distance\(dq and the points influence each other over longer
range). Surface with tension set too high behaves like a membrane
(rubber sheet stretched over the data points) with peak or pit
(\(dqcrater\(dq) in each given point and everywhere else the
surface goes rapidly to trend. If digitized contours are used as input
data, high tension can cause artificial waves along contours. Lower
tension and higher smoothing is suggested for such a case.
.PP
Surface with \fBtension\fR set too low behaves like a stiff steel
plate and overshoots can appear in areas with rapid change of gradient
and segmentation can be visible. Increase in tension should solve the
problems.
.PP
There are two options how \fBtension\fR can be applied in relation
to \fBdnorm\fR (dnorm rescales the coordinates depending on the
average data density so that the size of segments
with \fBsegmax=\fR40 points is around 1 \- this ensures the numerical
stability of the computation):
.IP
.IP \fB1\fR
Default: the given \fBtension\fR is applied to normalized data
(\fIx/dnorm\fR), that means that the distances are multiplied
(rescaled) by \fItension/dnorm\fR. If density of points is
changed, e.g., by using higher \fBdmin\fR, the \fBdnorm\fR
changes and \fBtension\fR needs to be changed too to get the same
result.  Because the \fBtension\fR is applied to normalized data
its suitable value is usually within the 10\-100 range and does not
depend on the actual scale (distances) of the original data (which
can be km for regional applications or cm for field
experiments).
.IP \fB2\fR
Flag\fB\-t\fR: The given \fBtension\fR is applied to
un\-normalized data (rescaled \fItension = tension*dnorm/1000\fR
is applied to normalized data (\fIx/dnorm\fR) and
therefore \fBdnorm\fR cancels out) so here \fBtension\fR truly
works as a rescaling parameter.  For regional applications with
distances between points in km the suitable tension can be 500 or
higher, for detailed field scale analysis it can be 0.1. To help
select how much the data need to be rescaled the program
writes \fBdnorm\fR and rescaled tension
\fIfi=tension*dnorm/1000\fR at the beginning of the program
run. This rescaled \fBtension\fR should be around 20\-30. If it is
lower or higher, the given \fBtension\fR parameter should be
changed accordingly.
.PP
.PP
The default is a recommended choice, however for the applications
where the user needs to change density of data and preserve the
approximation character the \fB\-t\fR flag can be helpful.
.PP
Anisotropic data (e.g. geologic phenomena) can be interpolated
using \fBtheta\fR and \fBscalex\fR defining orientation and ratio of
the perpendicular axes put on the longest/shortest side of the
feature, respectively. \fBTheta\fR is measured in degrees from East,
counterclockwise. \fBScalex\fR is a ratio of axes sizes.
Setting \fBscalex\fR in the range 0\-1, results in a pattern prolonged
in the direction defined by \fBtheta\fR. \fBScalex\fR value 0.5
means that modeled feature is approximately 2 times longer in the
direction of \fBtheta\fR than in the perpendicular direction.
\fBScalex\fR value 2 means that axes ratio is reverse resulting in a
pattern perpendicular to the previous example. Please note that
anisotropy option has not been extensively tested and may include bugs
(for example, topographic parameters may not be computed correctly) \-
if there are problems, please report to GRASS bugtracker (accessible
from https://grass.osgeo.org/).
.br
.PP
For data with values changing over several magnitudes (sometimes the
concentration or density data) it is suggested to interpolate the log
of the values rather than the original ones.
.PP
\fIv.surf.rst\fR checks the numerical stability of the algorithm by
computing the values in given points, and prints the root mean square
deviation (rms) found into the history file of raster
map \fBelevation\fR. For computation with smoothing set to 0, rms
should be 0. Significant increase in \fBtension\fR is suggested if
the rms is unexpectedly high for this case. With smoothing parameter
greater than zero the surface will not pass exactly through the data
points and the higher the parameter the closer the surface will be to
the trend. The rms then represents a measure of smoothing effect on
data. More detailed analysis of smoothing effects can be performed
using the output deviations option.
.PP
\fIv.surf.rst\fR also writes the values of parameters used in
computation into the comment part of history file \fBelevation\fR as
well as the following values which help to evaluate the results and
choose the suitable parameters: minimum and maximum z values in the
data file (zmin_data, zmax_data) and in the interpolated raster map
(zmin_int, zmax_int), rescaling parameter used for normalization
(dnorm), which influences the tension.
.PP
If visible connection of segments appears, the program should be rerun
with higher \fBnpmin\fR to get more points from the neighborhood of
given segment and/or with higher tension.
.PP
When the number of points in a vector map is not too large (less than
800), the user can skip segmentation by setting \fBsegmax\fR to the
number of data points or \fBsegmax=700\fR.
.PP
\fIv.surf.rst\fR gives warning when user wants to interpolate
outside the rectangle given by minimum and maximum coordinates in the
vector map, zoom into the area where the given data are is suggested
in this case.
.PP
When a \fBmask\fR is used, the program takes all points in the given
region for approximation, including those in the area which is masked
out, to ensure proper approximation along the border of the mask. It
therefore does not mask out the data points, if this is desirable, it
must be done outside \fIv.surf.rst\fR.
.SS Cross validation procedure
.PP
The \(dqoptimal\(dq approximation parameters for given data can be
found using a cross\-validation (CV) procedure (\fB\-c\fR flag).  The
CV procedure is based on removing one input data point at a time,
performing the approximation for the location of the removed point
using the remaining data points and calculating the difference between
the actual and approximated value for the removed data point. The
procedure is repeated until every data point has been, in turn,
removed. This form of CV is also known as the
\(dqleave\-one\-out\(dq or \(dqjack\-knife\(dq method (Hofierka
et al., 2002; Hofierka, 2005). The differences (residuals) are then
stored in the \fBcvdev\fR output vector map. Please note that during
the CV procedure no other output maps can be set, the approximation is
performed only for locations defined by input data.  To find
\(dqoptimal parameters\(dq, the CV procedure must be iteratively
performed for all reasonable combinations of the approximation
parameters with small incremental steps (e.g. tension, smoothing) in
order to find a combination with minimal statistical error (also
called predictive error) defined by root mean squared error (RMSE),
mean absolute error (MAE) or other error characteristics.  A script
with loops for tested RST parameters can do the job, necessary
statistics can be calculated using
e.g. \fIv.univar\fR. It should be noted
that crossvalidation is a time\-consuming procedure, usually reasonable
for up to several thousands of points. For larger data sets, CV should
be applied to a representative subset of the data. The
cross\-validation procedure works well only for well\-sampled phenomena
and when minimizing the predictive error is the goal.  The parameters
found by minimizing the predictive (CV) error may not not be the best
for for poorly sampled phenomena (result could be strongly smoothed
with lost details and fluctuations) or when significant noise is
present that needs to be smoothed out.
.SH EXAMPLE
.SS Setting for lidar point cloud
Lidar point clouds as well as UAS SfM\-based (phodar) point clouds tend
to be dense in relation to the desired raster resolution and thus a
different set of parameters is more advantageous, e.g. in comparison to
a typical temperature data interpolation.
.br
.nf
\fC
v.surf.rst input=points elevation=elevation npmin=100
\fR
.fi
.SS Usage of the where parameter
Using the \fBwhere\fR parameter, the interpolation can be limited to
use only a subset of the input vectors.
.PP
North Carolina example (we simulate randomly distributed elevation
measures which we interpolate to a gap\-free elevation surface):
.br
.nf
\fC
g.region raster=elevation \-p
# random elevation extraction of 500 samplings
r.random elevation vector_output=elevrand n=500
v.info \-c elevrand
v.db.select elevrand
# interpolation based on all points
v.surf.rst elevrand zcol=value elevation=elev_full
# apply the color table of the original raster map
r.colors elev_full raster=elevation
d.rast elev_full
d.vect elevrand
# interpolation based on subset of points (only those over 1300m/asl)
v.surf.rst elevrand zcol=value elevation=elev_partial where=\(dqvalue > 1300\(dq
r.colors elev_partial raster=elevation
d.rast elev_partial
d.vect elevrand where=\(dqvalue > 1300\(dq
\fR
.fi
.SH REFERENCES
.RS 4n
.IP \(bu 4n
Mitasova, H., Mitas, L. and Harmon, R.S., 2005,
Simultaneous spline approximation and topographic analysis for
lidar elevation data in open source GIS, IEEE GRSL 2 (4), 375\- 379.
.IP \(bu 4n
Hofierka, J., 2005, Interpolation of Radioactivity Data Using Regularized Spline with Tension. Applied GIS, Vol. 1, No. 2, pp. 16\-01 to 16\-13. DOI: 10.2104/ag050016
.IP \(bu 4n
Hofierka J., Parajka J., Mitasova H., Mitas L., 2002, Multivariate
Interpolation of Precipitation Using Regularized Spline with Tension.
Transactions in GIS 6(2), pp. 135\-150.
.IP \(bu 4n
H. Mitasova, L. Mitas, B.M. Brown, D.P. Gerdes, I. Kosinovsky, 1995, Modeling
spatially and temporally distributed phenomena: New methods and tools for
GRASS GIS. International Journal of GIS, 9 (4), special issue on Integrating
GIS and Environmental modeling, 433\-446.
.IP \(bu 4n
Mitasova, H. and Mitas, L., 1993:
Interpolation by Regularized Spline with Tension:
I. Theory and Implementation, Mathematical Geology ,25, 641\-655.
.IP \(bu 4n
Mitasova, H. and Hofierka, J., 1993: Interpolation
by Regularized Spline with Tension: II. Application to Terrain Modeling
and Surface Geometry Analysis, Mathematical Geology 25, 657\-667.
.IP \(bu 4n
Mitas, L., and Mitasova H., 1988,  General variational approach to the approximation
problem, Computers and Mathematics with Applications, v.16, p. 983\-992.
.IP \(bu 4n
Neteler, M. and Mitasova, H., 2008, Open Source GIS: A GRASS GIS Approach, 3rd Edition,
Springer, New York, 406 pages.
.IP \(bu 4n
Talmi, A. and Gilat, G., 1977 : Method for Smooth Approximation of Data,
Journal of Computational Physics, 23, p.93\-123.
.IP \(bu 4n
Wahba, G., 1990, : Spline Models for Observational Data, CNMS\-NSF Regional
Conference series in applied mathematics, 59, SIAM, Philadelphia, Pennsylvania.
.RE
.SH SEE ALSO
\fI
v.vol.rst,
v.surf.idw,
v.surf.bspline,
r.fillnulls,
g.region
\fR
.PP
Overview: Interpolation and Resampling in GRASS GIS
.PP
For examples of applications see
GRASS4 implementation and
GRASS5 and GRASS6 implementation.
.SH AUTHORS
\fIOriginal version of program (in FORTRAN) and GRASS enhancements\fR:
.br
Lubos Mitas, NCSA, University of Illinois at Urbana Champaign, Illinois,
USA (1990\-2000); Department of Physics, North Carolina State University, Raleigh
.br
Helena Mitasova, USA CERL, Department of Geography, University of Illinois at
Urbana\-Champaign, USA (1990\-2001); MEAS, North Carolina State University, Raleigh
.PP
\fIModified program (translated to C, adapted for GRASS, new segmentation
procedure):\fR
.br
Irina Kosinovsky, US Army CERL, Dave Gerdes, US Army CERL
.PP
\fIModifications for new sites format and timestamping:\fR
.br
Darrel McCauley, Purdue University, Bill Brown, US Army CERL
.PP
\fIUpdate for GRASS5.7, GRASS6 and addition of crossvalidation:\fR
.br
Jaroslav Hofierka, University of Presov; Radim Blazek, ITC\-irst
.PP
\fIParallelization using OpenMP:\fR
.br
Stanislav Zubal, Czech Technical University in Prague
.br
Michal Lacko, Pavol Jozef Safarik University in Kosice
.SH SOURCE CODE
.PP
Available at:
v.surf.rst source code
(history)
.PP
Accessed: Sunday Dec 17 17:22:30 2023
.PP
Main index |
Vector index |
Topics index |
Keywords index |
Graphical index |
Full index
.PP
© 2003\-2023
GRASS Development Team,
GRASS GIS 8.3.1 Reference Manual