.TH vector_graphical 1grass "" "GRASS 7.2.0" "Grass User's Manual"
\&.img\-list {
margin: 0;
padding: 0;
list\-style\-type: none;
}
\&.img\-list li {
padding: 5px;
overflow: auto;
}
\&.img\-list li:hover {
background\-color: #eee;
}
\&.img\-list li a {
color: initial;
text\-decoration: none;
display: block;
}
\&.img\-list li img {
width: 10%;
float: left;
margin: 0 15px 0 0;
background: white;
}
\&.img\-list li img.default\-img {
width: 40px;
padding\-left: 30px;
padding\-right: 30px;
}
\&.img\-list li .desc {
margin: 0px;
}
\&.img\-list li .name {
margin: 5px;
display: block;
color: #409940;
font\-weight: bold;
font\-style: italic;
}
.SH Graphical index of GRASS GIS modules
Go to vector introduction | topics
.PP
.SS Vector modules:
.RS 4n
.IP \(bu 4n
\fCv.buffer\fR \fCCreates a buffer around vector features of given type.\fR
.IP \(bu 4n
\fCv.clean\fR \fCToolset for cleaning topology of vector map.\fR
.IP \(bu 4n
\fCv.cluster\fR \fCPerforms cluster identification.\fR
.IP \(bu 4n
\fCv.decimate\fR \fCDecimates a point cloud
.br
\fR
.IP \(bu 4n
\fCv.delaunay\fR \fCCreates a Delaunay triangulation from an input vector map containing points or centroids.\fR
.IP \(bu 4n
\fCv.hull\fR \fCProduces a 2D/3D convex hull for a given vector map.\fR
.IP \(bu 4n
\fCv.lidar.edgedetection\fR \fCDetects the object\(cqs edges from a LIDAR data set.\fR
.IP \(bu 4n
\fCv.mkgrid\fR \fCCreates a vector map of a user\-defined grid.\fR
.IP \(bu 4n
\fCv.net.alloc\fR \fCAllocates subnets for nearest centers (direction from center).
.br
\fR
.IP \(bu 4n
\fCv.net.distance\fR \fCComputes shortest distance via the network between the given sets of features.
.br
\fR
.IP \(bu 4n
\fCv.net\fR \fCPerforms network maintenance.\fR
.IP \(bu 4n
\fCv.net.iso\fR \fCSplits net by cost isolines.
.br
\fR
.IP \(bu 4n
\fCv.net.path\fR \fCFinds shortest path on vector network.\fR
.IP \(bu 4n
\fCv.net.salesman\fR \fCCreates a cycle connecting given nodes (Traveling salesman problem).
.br
\fR
.IP \(bu 4n
\fCv.net.steiner\fR \fCCreates Steiner tree for the network and given terminals.
.br
\fR
.IP \(bu 4n
\fCv.net.visibility\fR \fCPerforms visibility graph construction.\fR
.IP \(bu 4n
\fCv.overlay\fR \fCOverlays two vector maps offering clip, intersection, difference, symmetrical difference, union operators.\fR
.IP \(bu 4n
\fCv.qcount\fR \fCIndices for quadrat counts of vector point lists.\fR
.IP \(bu 4n
\fCv.random\fR \fCGenerates random 2D/3D vector points.\fR
.IP \(bu 4n
\fCv.segment\fR \fCCreates points/segments from input vector lines and positions.\fR
.IP \(bu 4n
\fCv.select\fR \fCSelects features from vector map (A) by features from other vector map (B).\fR
.IP \(bu 4n
\fCv.to.rast\fR \fCConverts (rasterize) a vector map into a raster map.\fR
.IP \(bu 4n
\fCv.to.rast3\fR \fCConverts a vector map (only points) into a 3D raster map.\fR
.IP \(bu 4n
\fCv.vect.stats\fR \fCCount points in areas, calculate statistics from point attributes.\fR
.IP \(bu 4n
\fCv.voronoi\fR \fCCreates a Voronoi diagram in current region from an input vector map containing points or centroids.\fR
.RE
.PP
Main index |
Topics index |
Keywords index |
Graphical index |
Full index
.PP
© 2003\-2016
GRASS Development Team,
GRASS GIS 7.2.0 Reference Manual