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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
|
#!/usr/bin/perl -w
# Copyright 2014 Kevin Ryde
# This file is part of Math-PlanePath.
#
# Math-PlanePath is free software; you can redistribute it and/or modify it
# under the terms of the GNU General Public License as published by the Free
# Software Foundation; either version 3, or (at your option) any later
# version.
#
# Math-PlanePath is distributed in the hope that it will be useful, but
# WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
# or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
# for more details.
#
# You should have received a copy of the GNU General Public License along
# with Math-PlanePath. If not, see <http://www.gnu.org/licenses/>.
use 5.004;
use strict;
use List::Util 'min', 'max';
use Math::PlanePath::HIndexing;
use Test;
plan tests => 35;
use lib 't','xt';
use MyTestHelpers;
BEGIN { MyTestHelpers::nowarnings(); }
use MyOEIS;
# uncomment this to run the ### lines
#use Smart::Comments '###';
#------------------------------------------------------------------------------
# area
sub points_to_area {
my ($points) = @_;
if (@$points < 3) {
return 0;
}
require Math::Geometry::Planar;
my $polygon = Math::Geometry::Planar->new;
$polygon->points($points);
return $polygon->area;
}
{
my $path = Math::PlanePath::HIndexing->new;
foreach my $level (0 .. 10) {
my $a = $path->_UNDOCUMENTED__level_to_area($level);
my $Y = $path->_UNDOCUMENTED__level_to_area_Y($level);
my $up = $path->_UNDOCUMENTED__level_to_area_up($level);
ok ($Y+$up, $a);
}
}
{
my $path = Math::PlanePath::HIndexing->new;
foreach my $level (0 .. 7) {
my $got_area = $path->_UNDOCUMENTED__level_to_area($level);
my @points;
my ($n_lo, $n_hi) = $path->level_to_n_range($level);
my $y_max = 0;
foreach my $n ($n_lo .. $n_hi) {
my ($x,$y) = $path->n_to_xy($n);
push @points, [$x,$y];
if ($y > $y_max) { $y_max = $y; }
}
push @points, [0,$y_max];
my $want_area = points_to_area(\@points);
ok ($got_area, $want_area);
# print "$want_area, ";
}
}
{
my $path = Math::PlanePath::HIndexing->new;
foreach my $level (0 .. 7) {
my $got_area = $path->_UNDOCUMENTED__level_to_area_up($level);
my @points;
my ($n_lo, $n_hi) = $path->level_to_n_range($level);
$n_lo = ($n_hi + 1)/2 - 1;
foreach my $n ($n_lo .. $n_hi) {
my ($x,$y) = $path->n_to_xy($n);
push @points, [$x,$y];
}
my $want_area = points_to_area(\@points);
ok ($got_area, $want_area);
}
}
{
my $path = Math::PlanePath::HIndexing->new;
foreach my $level (0 .. 7) {
my $got_area = $path->_UNDOCUMENTED__level_to_area_Y($level);
my @points;
my ($n_lo, $n_hi) = $path->level_to_n_range($level);
$n_hi = ($n_hi + 1)/2 - 1;
foreach my $n ($n_lo .. $n_hi) {
my ($x,$y) = $path->n_to_xy($n);
push @points, [$x,$y];
}
my $want_area = points_to_area(\@points);
ok ($got_area, $want_area);
}
}
#------------------------------------------------------------------------------
exit 0;
|
