1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
|
=encoding utf8
=head1 NAME
Math::Polygon::Convex - Collection of convex algorithms
=head1 INHERITANCE
Math::Polygon::Convex
is an Exporter
=head1 SYNOPSIS
use Math::Polygon::Convex qw/chainHull_2D/;
my @points = ( [1,2], [2,4], [5,7], [1,2] );
my $poly = chainHull_2D @points;
=head1 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.
=head1 FUNCTIONS
=over 4
=item B<chainHull_2D>(@points)
Each POINT is an ARRAY of two elements: the X and Y coordinate of a point.
Returned is the enclosing convex L<Math::Polygon|Math::Polygon> object.
Algorithm by Dan Sunday,
L<https://geometryalgorithms.com/Archive/algorithm_0109/algorithm_0109.htm>
=back
=head1 SEE ALSO
This module is part of Math-Polygon version 2.00,
built on September 04, 2025. Website: F<http://perl.overmeer.net/CPAN/>
=head1 LICENSE
For contributors see file ChangeLog.
This software is copyright (c) 2004-2025 by Mark Overmeer.
This is free software; you can redistribute it and/or modify it under
the same terms as the Perl 5 programming language system itself.
|
