Quick Navigator

 Search Site Miscellaneous Server Agreement Year 2038 Credits

# Manual Reference Pages  -  MATH::POLYGON::CONVEX (3)

.ds Aq ’

### NAME

Math::Polygon::Convex - Collection of convex algorithms

### INHERITANCE

```

Math::Polygon::Convex
is a Exporter

```

### SYNOPSIS

```

use Math::Polygon::Convex  qw/chainHull_2D/;

my @points = ( [1,2], [2,4], [5,7], [1,2] );
my \$poly   = chainHull_2D @points;

```

### DESCRIPTION

The convex polygon around a set of points, is the polygon with a minimal size which contains all points.

This package contains one convex calculation algorithm, but may be extended with alternative implementations in the future.

### FUNCTIONS

 chainHull_2DB>(\$points) Each POINT is an ARRAY of two elements: the X and Y coordinate of a point. Returned is the enclosing convex Math::Polygon object. Algorithm by Dan Sunday, http://geometryalgorithms.com/Archive/algorithm_0109/algorithm_0109.htm

This module is part of Math-Polygon distribution version 1.03, built on January 21, 2014. Website: http://perl.overmeer.net/geo/