Linux Certif

Toute la documentation sur la certification Linux LPI

v.hull

NAME

v.hull - Uses a GRASS vector points map to produce a convex hull vector map.

KEYWORDS

vector, geometry

SYNOPSIS

v.hull
v.hull help
v.hull [-a] input=name output=name [--overwrite] [--verbose] [--quiet]

Flags:

-a

Use all vector points (do not limit to current region)

--overwrite

Allow output files to overwrite existing files

--verbose

Verbose module output

--quiet

Quiet module output

Parameters:

input=name

Name of input vector points map

output=name

Name of output vector area map

DESCRIPTION

v.hull computes the convex hull of a vector points map and outputs the convex hull polygon as a vector area map. The convex hull, or convex envelope, for an object or a set of objects is the minimal convex set containing the given objects. This module creates a vector polygon containing all vector points of the input map.

Example of v.hull output:
       |
Convex hull polygon created with v.hull

REFERENCES

M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf, (2000). Computational geometry, chapter 1.1, 2-8.

SEE ALSO

v.delaunay

AUTHOR

Andrea Aime, Modena, Italy
Markus Neteler, ITC-irst (update to 5.7)

Last changed: $Date: 2006-05-30 11:05:37 +0200 (Tue, 30 May 2006) $

Full index

© 2003-2008 GRASS Development Team