vectorintro.html 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378
  1. <!-- meta page description: Vector data processing in GRASS GIS -->
  2. <!-- meta page index: vector -->
  3. <h3>Vector maps in general</h3>
  4. A "vector map" is a data layer consisting of a number of sparse features
  5. in geographic space. These might be data points (drill sites), lines
  6. (roads), polygons (park boundary), volumes (3D CAD structure), or some
  7. combination of all these. Typically each feature in the map will be
  8. tied to a set of attribute layers stored in a database (road names,
  9. site ID, geologic type, etc.). As a general rule these can exist in 2D
  10. or 3D space and are independent of the GIS's computation region.
  11. <h3>Vector data import and export</h3>
  12. The <a href="v.in.ogr.html">v.in.ogr</a> module offers a common
  13. interface for many different vector formats. Additionally, it
  14. offers options such as on-the-fly creation of new locations or extension of
  15. the default region to match the extent of the imported vector map.
  16. For special cases, other import modules are available, e.g.
  17. <a href="v.in.ascii.html">v.in.ascii</a> for input from a text file
  18. containing coordinate and attribute data, and
  19. <a href="v.in.db.html">v.in.db</a> for input from a database containing
  20. coordinate and attribute data.
  21. With <a href="v.external.html">v.external</a> external maps can be
  22. virtually linked into a mapset, only pseudo-topology is generated but
  23. the vector geometry is not imported.
  24. The <em>v.out.*</em> set of commands exports to various formats. To import
  25. and export only attribute tables, use <a href="db.in.ogr.html">db.in.ogr</a>
  26. and <a href="db.out.ogr.html">db.out.ogr</a>.
  27. The naming convention for vector maps requires that map names start with a
  28. character, not a number (map name scheme: [A-Za-z][A-Za-z0-9_]*).
  29. <h3>Metadata</h3>
  30. The <a href="v.info.html">v.info</a> display general information such
  31. as metadata and attribute columns about a vector map including the
  32. history how it was generated. Each map generating command stores the
  33. command history into the metadata (query with <a href="v.info.html">v.info -h mapname</a>).
  34. Metadata such as map title, scale, organization etc. can be updated
  35. with <a href="v.support.html">v.support</a>.
  36. <h3>Vector map operations</h3>
  37. GRASS vector map processing is always performed on the full map.
  38. If this is not desired, the input map has to be clipped to the
  39. current region beforehand (<a href="v.in.region.html">v.in.region</a>,
  40. <a href="v.overlay.html">v.overlay</a>,<a href="v.select.html">v.select</a>).
  41. <h3>Vector model and topology</h3>
  42. GRASS is a topological GIS. This means that adjacent geographic
  43. components in a single vector map are related. For example in a
  44. non-topological GIS if two areas shared a common border that border
  45. would be digitized two times and also stored in duplicate. In a
  46. topological GIS this border exists once and is shared between two
  47. areas. Topological representation of vector data helps to produce and
  48. maintain vector maps with clean geometry as well as enables certain
  49. analyses that can not be conducted with non-topological or spaghetti
  50. data. In GRASS, topological data are refered to as level 2 data and
  51. spaghetti data is referred to as level 1.
  52. <p>
  53. Sometimes topology is not necessary and the additional memory and
  54. space requirements are burdensome to a particular task. Therefore two
  55. modules allow for working level 1 (non-topological) data within
  56. GRASS. The <a href="v.in.ascii.html">v.in.ascii</a> module allows
  57. users to input points without building topology. This is very useful
  58. for large files where memory restrictions may cause difficulties. The
  59. other module which works with level 1 data is
  60. <a href="v.surf.rst.html">v.surf.rst</a> which enables spatial
  61. approximation and topographic analysis from a point or isoline file.
  62. <p> In GRASS, the following vector object types are defined:
  63. <ul>
  64. <li> point: a point; </li>
  65. <li> line: a directed sequence of connected vertices with two endpoints called nodes; </li>
  66. <li> boundary: the border line to describe an area; </li>
  67. <li> centroid: a point within a closed ring of boundaries; </li>
  68. <li> area: the topological composition of a closed ring of boundaries and a centroid; </li>
  69. <li> face: a 3D area; </li>
  70. <li> kernel: a 3D centroid in a volume (not yet implemented); </li>
  71. <li> volume: a 3D corpus, the topological composition of faces and kernel (not yet implemented). </li>
  72. </ul>
  73. <p>
  74. Lines and boundaries can be composed of multiple vertices.
  75. <p>
  76. Area topology also holds information about isles. These isles are located
  77. within that area, not touching the boundaries of the outer area. Isles
  78. are holes inside the area, can consist of one or more areas and are used
  79. internally to maintain correct topology for areas.
  80. <p>
  81. The <a href="v.type.html">v.type</a> module can be used to convert
  82. between vector types if
  83. possible. The <a href="v.build.html">v.build</a> module is used to
  84. generate topology. It optionally allows the user to extract erroneous
  85. vector objects into a separate map. Topological errors can be
  86. corrected either manually
  87. within <a href="wxGUI.vdigit.html">wxGUI vector digitizer</a> or,
  88. to some extent, automatically in <a href="v.clean.html">v.clean</a>.
  89. A dedicated vector editing module is <a href="v.edit.html">v.edit</a>
  90. which supports global and local editing operations.
  91. Adjacent polygons can be found by <a href="v.to.db.html">v.to.db</a>
  92. (see 'sides' option).
  93. <p>
  94. Many operations including extraction, queries, overlay, and export will
  95. only act on features which have been assigned a category number. Typically
  96. a centroid will hold the attribute data for the area with which the centroid is
  97. associated. Boundaries are not typically given a category ID as it would be
  98. ambiguous as to which area either side of it the attribute data would belong
  99. to. An exception might be when the boundary between two crop-fields is the
  100. center-line of a road, and the category information is an index to the road
  101. name. For everyday use boundaries and centroids can be treated as internal
  102. data types and the user can work directly and more simply with the "area"
  103. type.
  104. <h3>Vector object categories and attribute management</h3>
  105. GRASS vectors can be linked to one or many database management systems
  106. (DBMS). The <em>db.*</em> set of commands provides basic SQL support for
  107. attribute management, while the <em>v.db.*</em> set of commands operates
  108. on a table linked to a vector map.
  109. <ul>
  110. <li><b>Categories</b><br>
  111. Categories are used to categorize vector objects and link
  112. attribute(s) to each category. Each vector object can have zero, one or
  113. several categories. Category numbers do not have to be unique for
  114. each vector object, several vector objects can share the same category.
  115. <br>Category numbers are stored both within the geometry file for each
  116. vector object and within the (optional) attribute table(s) (usually the "cat"
  117. column). It is not required that attribute table(s) hold an entry for
  118. each category, and attribute table(s) can hold
  119. information about categories not present in the vector geometry file.
  120. This means that e.g. an attribute table can be populated first and then
  121. vector objects can be added to the geometry file with category numbers.
  122. Using <a href="v.category.html">v.category</a>, category numbers can be
  123. printed or maintained.
  124. <br><br></li>
  125. <li><b>Layers</b><br>
  126. Layers are a characteristic of the vector feature (geometries) file.
  127. As mentioned above, categories allow the user to give either a
  128. unique id to each feature or to group similar features by giving
  129. them all the same id. Layers allow several parallel, but different
  130. groupings of features in a same map. The practical benefit of this
  131. system is that it allows placement of thematically distinct but
  132. topologically related objects into a single map, or for linking time
  133. series attribute data to a series of locations that did not change
  134. over time.
  135. <br>
  136. For example, one can have roads with one layer
  137. containing the unique id of each road and another layer with ids for
  138. specific routes that one might take, combining several roads by
  139. assigning the same id. While this example can also be dealt with in
  140. an attribute table, another example of the use of layers that shows
  141. their specific advantage is the possibility to identify the same geometrical
  142. features as representing different thematic objects. For example,
  143. in a map with a series of polygons representing fields in
  144. which at the same time the boundaries of these fields have a meaning
  145. as linear features, e.g. as paths, one can give a unique id to each
  146. field as area in layer 1, and a unique id in layer 2 to those
  147. boundary lines that are paths. If the paths will always depend on
  148. the field boundaries (and might change if these boundaries
  149. change) then keeping them in the same map can be helpful. Trying
  150. to reproduce the same functionality through attributes is much more
  151. complicated.
  152. <br>
  153. If a vector object has zero categories in a layer, then it does not
  154. appear in that layer. In this fashion some vector objects may appear
  155. in some layers but not in others. Taking the example of the fields
  156. and paths, only some boundaries, but not all, might have a category
  157. value in layer 2. With <em>option=report</em>,
  158. <a href="v.category.html">v.category</a> lists available categories
  159. in each layer.
  160. <br>
  161. Optionally, each layer can (but does not have
  162. to) be linked to an attribute table. The link is made by the
  163. category values of the features in that layer which have to have
  164. corresponding entries in the specified key column of the table.
  165. Using <a href="v.db.connect.html">v.db.connect</a> connections
  166. between layers and attribute tables can be listed or maintained.
  167. <br>
  168. In most modules, the first layer (<em>layer=1</em>) is active by
  169. default. Using <em>layer=-1</em> one can access all layers.
  170. </li>
  171. <li><b>SQL support</b><br>
  172. The DBF driver provides only very limited SQL support (as DBF is not an
  173. SQL DB) while the other DBMS backends (such as SQLite, PostgreSQL, MySQL
  174. etc) provide full SQL support since the SQL commands are sent directly
  175. to the DBMI. SQL commands can be directly executed with
  176. <a href="db.execute.html">db.execute</a>,
  177. <a href="db.select.html">db.select</a> and the other db.* modules.
  178. </li>
  179. </ul>
  180. When creating vector maps from scratch, in general an attribute table must be created and
  181. the table must be populated with one row per category (using <a href="v.to.db.html">v.to.db</a>).
  182. However, this can be performed in a single step using <a href="v.db.addtable.html">v.db.addtable</a>
  183. along with the definition of table column types. Column adding and dropping
  184. can be done with <a href="v.db.addcolumn.html">v.db.addcolumn</a> and
  185. <a href="v.db.dropcolumn.html">v.db.dropcolumn</a>. A table column can be renamed with
  186. <a href="v.db.renamecolumn.html">v.db.renamecolumn</a>. To drop a table from a map, use
  187. <a href="v.db.droptable.html">v.db.droptable</a>. Values in a table can be updated
  188. with <a href="v.db.update.html">v.db.update</a>. Tables can be joined with with
  189. <a href="v.db.join.html">v.db.join</a>.
  190. <h3>Editing vector attributes</h3>
  191. To manually edit attributes of a table, the map has to be
  192. queried in 'edit mode' using <a href="d.what.vect.html">d.what.vect</a>.
  193. To bulk process attributes, it is recommended to use SQL
  194. (<a href="db.execute.html">db.execute</a>).
  195. <h3>Geometry operations</h3>
  196. The module <a href="v.in.region.html">v.in.region</a> saves the
  197. current region extents as a vector area.
  198. Split vector lines can be changes to polylines by
  199. <a href="v.build.polylines.html">v.build.polylines</a>. Long lines can be
  200. split by <a href="v.split.html">v.split</a> and
  201. <a href="v.segment.html">v.segment</a>.
  202. Buffer and circles can be generated with <a href="v.buffer.html">v.buffer</a>
  203. and <a href="v.parallel.html">v.parallel</a>.
  204. <a href="v.generalize.html">v.generalize</a> is module for generalization of GRASS vector maps.
  205. 2D vector maps can be changed to 3D using
  206. <a href="v.drape.html">v.drape</a> or <a href="v.extrude.html">v.extrude</a>.
  207. If needed, the spatial position of vector points can be perturbed by
  208. <a href="v.perturb.html">v.perturb</a>.
  209. The <a href="v.type.html">v.type</a> command changes between vector
  210. types (see list above).
  211. Projected vector maps can be reprojected with <a href="v.proj.html">v.proj</a>.
  212. Unprojected maps can be geocoded with <a href="v.transform.html">v.transform</a>.
  213. Based on the control points, <a href="v.rectify.html">v.rectify</a> rectifies a
  214. vector map by computing a coordinate transformation for each vector object.
  215. Triangulation and point-to-polygon conversions can be done with <a
  216. href="v.delaunay.html">v.delaunay</a>, <a href="v.hull.html">v.hull</a>,
  217. and <a href="v.voronoi.html">v.voronoi</a>.
  218. The <a href="v.random.html">v.random</a> command generated random points.
  219. <h3>Vector overlays and selections</h3>
  220. Geometric overlay of vector maps is done with <a href="v.patch.html">v.patch</a>,
  221. <a href="v.overlay.html">v.overlay</a> and <a href="v.select.html">v.select</a>,
  222. depending on the combination of vector types.
  223. Vectors can be extracted with <a href="v.extract.html">v.extract</a>
  224. and reclassified with <a href="v.reclass.html">v.reclass</a>.
  225. <h3>Vector statistics</h3>
  226. Statistics can be generated by <a href="v.qcount.html">v.qcount</a>,
  227. <a href="v.sample.html">v.sample</a>, <a href="v.normal.html">v.normal</a>,
  228. and <a href="v.univar.html">v.univar</a>.
  229. Distances between vector objects are calculated with <a href="v.distance.html">v.distance</a>.
  230. <h3>Vector-Raster-DB conversion</h3>
  231. The <a href="v.to.db.html">v.to.db</a> transfers vector information
  232. into database tables.
  233. With <a href="v.to.points.html">v.to.points</a>,
  234. <a href="v.to.rast.html">v.to.rast</a> and <a href="v.to.rast3.html">v.to.rast3</a>
  235. conversions are performed. Note that a raster mask ("MASK") will not be
  236. respected since it is only applied when <em>reading</em> an existing
  237. GRASS raster map.
  238. <h3>Vector queries</h3>
  239. Vector maps can be queried with <a href="v.what.html">v.what</a> and
  240. <a href="v.what.vect.html">v.what.vect</a>.
  241. <h3>Vector-Raster queries</h3>
  242. Raster values can be transferred to vector maps with
  243. <a href="v.what.rast.html">v.what.rast</a> and
  244. <a href="v.rast.stats">v.rast.stats</a>.
  245. <h3>Vector network analysis</h3>
  246. GRASS provides support for vector network analysis. The following algorithms
  247. are implemented:
  248. <ul>
  249. <li> Network preparation and maintenance: <a href="v.net.html">v.net</a></li>
  250. <li> Shortest path: <a href="d.path.html">d.path</a> and
  251. <a href="v.net.path.html">v.net.path</a></li>
  252. <li> Shortest path between all pairs of nodes <a href="v.net.allpairs.html">v.net.allpairs</a>
  253. <li> Allocation of sources (create subnetworks, e.g. police station zones):
  254. <a href="v.net.alloc.html">v.net.alloc</a></li>
  255. <li> Iso-distances (from centers): <a href="v.net.iso.html">v.net.iso</a></li>
  256. <li> Computes bridges and articulation points: <a href="v.net.bridge.html">v.net.bridge</a></li>
  257. <li> Computes degree, centrality, betweeness, closeness and eigenvector centrality measures: <a href="v.net.centrality.html">v.net.centrality</a></li>
  258. <li> Computes strongly and weakly connected components: <a href="v.net.components.html">v.net.components</a></li>
  259. <li> Computes vertex connectivity between two sets of nodes: <a href="v.net.connectivity.html">v.net.connectivity</a></li>
  260. <li> Computes shortest distance via the network between the given sets of features: <a href="v.net.distance.html">v.net.distance</a></li>
  261. <li> Computes the maximum flow between two sets of nodes: <a href="v.net.flow.html">v.net.flow</a></li>
  262. <li> Computes minimum spanning tree:<a href="v.net.spanningtree.html">v.net.spanningtree</a></li>
  263. <li> Minimum Steiner trees (star-like connections, e.g. broadband cable
  264. connections): <a href="v.net.steiner.html">v.net.steiner</a></li>
  265. <li> Finds shortest path using timetables: <a href="v.net.timetable.html">v.net.timetable</a></li>
  266. <li> Traveling salesman (round trip): <a href="v.net.salesman.html">v.net.salesman</a></li>
  267. </ul>
  268. Vector directions are defined by the digitizing direction (a--&gt;--b).
  269. Both directions are supported, most network modules provide parameters
  270. to assign attribute columns to the forward and backward direction.
  271. <h3>Vector networks: Linear referencing system (LRS)</h3>
  272. LRS uses linear features and distance measured along those features to
  273. positionate objects. There are the commands
  274. <a href="v.lrs.create.html">v.lrs.create</a> to create a linear reference system,
  275. <a href="v.lrs.label.html">v.lrs.label</a> to create stationing on the LRS,
  276. <a href="v.lrs.segment.html">v.lrs.segment</a> to create points/segments on LRS,
  277. and
  278. <a href="v.lrs.where.html">v.lrs.where</a> to find line id and real km+offset
  279. for given points in vector map using linear reference system.
  280. <p>
  281. The <a href="lrs.html">LRS tutorial</a> explains further details.
  282. <h3>Interpolation and approximation</h3>
  283. Some of the vector modules deal with spatial or volumetric
  284. approximation (also called interpolation):
  285. <a href="v.kernel.html">v.kernel</a>,
  286. <a href="v.surf.idw.html">v.surf.idw</a>,
  287. <a href="v.surf.rst.html">v.surf.rst</a>, and
  288. <a href="v.vol.rst.html">v.vol.rst</a>.
  289. <h3>Lidar data processing</h3>
  290. Lidar point clouds (first and last return) are imported from text files
  291. with <a href="v.in.ascii.html">v.in.ascii</a> or from LAS files with
  292. <a href="v.in.lidar.html"> v.in.lidar</a>. Both modules recognize the
  293. -b flag to not build topology. Outlier detection is done with
  294. <a href="v.outlier.html">v.outlier</a> on both first and last return data.
  295. Then, with <a href="v.lidar.edgedetection.html">v.lidar.edgedetection</a>,
  296. edges are detected from last return data. The building are generated by
  297. <a href="v.lidar.growing.html">v.lidar.growing</a> from detected
  298. edges. The resulting data are post-processed with
  299. <a href="v.lidar.correction.html">v.lidar.correction</a>. Finally, the
  300. DTM and DSM are generated with <a href="v.surf.bspline.html">v.surf.bspline</a>
  301. (DTM: uses the 'v.lidar.correction' output; DSM: uses last return output
  302. from outlier detection).
  303. <h3>See also</h3>
  304. <ul>
  305. <li><a href="rasterintro.html">Introduction into raster data processing</a></li>
  306. <li><a href="raster3dintro.html">Introduction into 3D raster data (voxel) processing</a></li>
  307. <li><a href="vectorintro.html">Introduction into vector data processing</a></li>
  308. <li><a href="imageryintro.html">Introduction into image processing</a></li>
  309. <li><a href="databaseintro.html">Database management</a></li>
  310. <li><a href="projectionintro.html">Projections and spatial transformations</a></li>
  311. </ul>