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$