convex_hull: Convex hull of a set of vertices

In igraph: Network Analysis and Visualization

Convex hull of a set of vertices

Description

Calculate the convex hull of a set of points, i.e. the covering polygon that has the smallest area.

Usage

convex_hull(data)

Arguments

data	The data points, a numeric matrix with two columns.

Value

A named list with components:

resverts	The indices of the input vertices that constritute the convex hull.
rescoords	The coordinates of the corners of the convex hull.

Related documentation in the C library

igraph_convex_hull().

Author(s)

Tamas Nepusz [e-mail]

References

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 2001. ISBN 0262032937. Pages 949-955 of section 33.3: Finding the convex hull.

See Also

Other other: running_mean(), sample_seq()

Examples

M <- cbind(runif(100), runif(100))
convex_hull(M)

igraph documentation built on Oct. 20, 2024, 1:06 a.m.