/usr/share/perl5/Math/PlanePath/KochelCurve.pm is in libmath-planepath-perl 117-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 | # Copyright 2011, 2012, 2013, 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/>.
package Math::PlanePath::KochelCurve;
use 5.004;
use strict;
#use List::Util 'max';
*max = \&Math::PlanePath::_max;
use vars '$VERSION', '@ISA';
$VERSION = 117;
use Math::PlanePath;
use Math::PlanePath::Base::NSEW;
@ISA = ('Math::PlanePath::Base::NSEW',
'Math::PlanePath');
use Math::PlanePath::Base::Generic
'is_infinite',
'round_nearest';
use Math::PlanePath::Base::Digits
'round_down_pow',
'digit_split_lowtohigh',
'digit_join_lowtohigh';
# uncomment this to run the ### lines
#use Smart::Comments;
use constant n_start => 0;
use constant class_x_negative => 0;
use constant class_y_negative => 0;
*xy_is_visited = \&Math::PlanePath::Base::Generic::xy_is_visited_quad1;
#------------------------------------------------------------------------------
# tables generated by tools/kochel-curve-table.pl
#
my @next_state = (63,72, 9, 99, 0,90, 36,99, 0, # 0
36,81,18, 72, 9,99, 45,72, 9, # 9
45,90,27, 81,18,72, 54,81,18, # 18
54,99, 0, 90,27,81, 63,90,27, # 27
36,81, 0, 72,36,81, 45,90,27, # 36
45,90, 9, 81,45,90, 54,99, 0, # 45
54,99,18, 90,54,99, 63,72, 9, # 54
63,72,27, 99,63,72, 36,81,18, # 63
63,72, 9, 99,90,99, 63,72, 9, # 72
36,81,18, 72,99,72, 36,81,18, # 81
45,90,27, 81,72,81, 45,90,27, # 90
54,99, 0, 90,81,90, 54,99, 0); # 99
my @digit_to_x = (0,0,0, 1,2,2, 1,1,2, # 0
2,1,0, 0,0,1, 1,2,2, # 9
2,2,2, 1,0,0, 1,1,0, # 18
0,1,2, 2,2,1, 1,0,0, # 27
2,1,1, 2,2,1, 0,0,0, # 36
2,2,1, 1,0,0, 0,1,2, # 45
0,1,1, 0,0,1, 2,2,2, # 54
0,0,1, 1,2,2, 2,1,0, # 63
0,0,0, 1,1,1, 2,2,2, # 72
2,1,0, 0,1,2, 2,1,0, # 81
2,2,2, 1,1,1, 0,0,0, # 90
0,1,2, 2,1,0, 0,1,2); # 99
my @digit_to_y = (0,1,2, 2,2,1, 1,0,0, # 0
0,0,0, 1,2,2, 1,1,2, # 9
2,1,0, 0,0,1, 1,2,2, # 18
2,2,2, 1,0,0, 1,1,0, # 27
0,0,1, 1,2,2, 2,1,0, # 36
2,1,1, 2,2,1, 0,0,0, # 45
2,2,1, 1,0,0, 0,1,2, # 54
0,1,1, 0,0,1, 2,2,2, # 63
0,1,2, 2,1,0, 0,1,2, # 72
0,0,0, 1,1,1, 2,2,2, # 81
2,1,0, 0,1,2, 2,1,0, # 90
2,2,2, 1,1,1, 0,0,0); # 99
my @xy_to_digit = (0,1,2, 7,6,3, 8,5,4, # 0
2,3,4, 1,6,5, 0,7,8, # 9
4,5,8, 3,6,7, 2,1,0, # 18
8,7,0, 5,6,1, 4,3,2, # 27
8,7,6, 1,2,5, 0,3,4, # 36
6,5,4, 7,2,3, 8,1,0, # 45
4,3,0, 5,2,1, 6,7,8, # 54
0,1,8, 3,2,7, 4,5,6, # 63
0,1,2, 5,4,3, 6,7,8, # 72
2,3,8, 1,4,7, 0,5,6, # 81
8,7,6, 3,4,5, 2,1,0, # 90
6,5,0, 7,4,1, 8,3,2); # 99
my @min_digit = (0,0,0,7,8,7, # 0
0,0,0,5,5,6,
0,0,0,3,4,3,
1,1,1,3,4,3,
2,2,2,3,4,3,
1,1,1,5,5,6,
2,1,0,0,0,1, # 36
2,1,0,0,0,1,
2,1,0,0,0,1,
3,3,3,5,7,5,
4,4,4,5,8,5,
3,3,3,6,7,6,
4,3,2,2,2,3, # 72
4,3,1,1,1,3,
4,3,0,0,0,3,
5,5,0,0,0,6,
8,7,0,0,0,7,
5,5,1,1,1,6,
8,5,4,4,4,5, # 108
7,5,3,3,3,5,
0,0,0,1,2,1,
0,0,0,1,2,1,
0,0,0,1,2,1,
7,6,3,3,3,6,
8,1,0,0,0,1, # 144
7,1,0,0,0,1,
6,1,0,0,0,1,
6,2,2,2,3,2,
6,5,4,4,4,5,
7,2,2,2,3,2,
6,6,6,7,8,7, # 180
5,2,1,1,1,2,
4,2,0,0,0,2,
4,2,0,0,0,2,
4,3,0,0,0,3,
5,2,1,1,1,2,
4,4,4,5,6,5, # 216
3,2,2,2,6,2,
0,0,0,1,6,1,
0,0,0,1,7,1,
0,0,0,1,8,1,
3,2,2,2,7,2,
0,0,0,3,4,3, # 252
0,0,0,2,4,2,
0,0,0,2,4,2,
1,1,1,2,5,2,
8,7,6,6,6,7,
1,1,1,2,5,2,
0,0,0,5,6,5, # 288
0,0,0,4,6,4,
0,0,0,3,6,3,
1,1,1,3,7,3,
2,2,2,3,8,3,
1,1,1,4,7,4,
2,1,0,0,0,1, # 324
2,1,0,0,0,1,
2,1,0,0,0,1,
3,3,3,4,5,4,
8,7,6,6,6,7,
3,3,3,4,5,4,
8,3,2,2,2,3, # 360
7,3,1,1,1,3,
6,3,0,0,0,3,
6,4,0,0,0,4,
6,5,0,0,0,5,
7,4,1,1,1,4,
6,6,6,7,8,7, # 396
5,4,3,3,3,4,
0,0,0,1,2,1,
0,0,0,1,2,1,
0,0,0,1,2,1,
5,4,3,3,3,4);
my @max_digit = (0,7,8,8,8,7, # 0
1,7,8,8,8,7,
2,7,8,8,8,7,
2,6,6,6,5,6,
2,3,4,4,4,3,
1,6,6,6,5,6,
2,2,2,1,0,1, # 36
3,6,7,7,7,6,
4,6,8,8,8,6,
4,6,8,8,8,6,
4,5,8,8,8,5,
3,6,7,7,7,6,
4,4,4,3,2,3, # 72
5,6,6,6,2,6,
8,8,8,7,2,7,
8,8,8,7,1,7,
8,8,8,7,0,7,
5,6,6,6,1,6,
8,8,8,5,4,5, # 108
8,8,8,6,4,6,
8,8,8,6,4,6,
7,7,7,6,3,6,
0,1,2,2,2,1,
7,7,7,6,3,6,
8,8,8,1,0,1, # 144
8,8,8,3,3,2,
8,8,8,5,4,5,
7,7,7,5,4,5,
6,6,6,5,4,5,
7,7,7,3,3,2,
6,7,8,8,8,7, # 180
6,7,8,8,8,7,
6,7,8,8,8,7,
5,5,5,3,1,3,
4,4,4,3,0,3,
5,5,5,2,1,2,
4,5,6,6,6,5, # 216
4,5,7,7,7,5,
4,5,8,8,8,5,
3,3,8,8,8,2,
0,1,8,8,8,1,
3,3,7,7,7,2,
0,3,4,4,4,3, # 252
1,3,5,5,5,3,
8,8,8,7,6,7,
8,8,8,7,6,7,
8,8,8,7,6,7,
1,2,5,5,5,2,
0,5,6,6,6,5, # 288
1,5,7,7,7,5,
2,5,8,8,8,5,
2,4,8,8,8,4,
2,3,8,8,8,3,
1,4,7,7,7,4,
2,2,2,1,0,1, # 324
3,4,5,5,5,4,
8,8,8,7,6,7,
8,8,8,7,6,7,
8,8,8,7,6,7,
3,4,5,5,5,4,
8,8,8,3,2,3, # 360
8,8,8,4,2,4,
8,8,8,5,2,5,
7,7,7,5,1,5,
6,6,6,5,0,5,
7,7,7,4,1,4,
6,7,8,8,8,7, # 396
6,7,8,8,8,7,
6,7,8,8,8,7,
5,5,5,4,3,4,
0,1,2,2,2,1,
5,5,5,4,3,4);
# state length 108 in each of 4 tables
sub n_to_xy {
my ($self, $n) = @_;
### KochelCurve n_to_xy(): $n
if ($n < 0) { return; }
if (is_infinite($n)) { return ($n,$n); }
my $int = int($n);
$n -= $int; # remaining fraction, preserve possible BigFloat/BigRat
my @digits = digit_split_lowtohigh($int,9);
my $len = ($int*0 + 3) ** scalar(@digits); # inherit bignum
### digits: join(', ',@digits)." count ".scalar(@digits)
### $len
my $state = 63;
my $dir = 1; # default if all $digit==8
my $x = 0;
my $y = 0;
while (@digits) {
$len /= 3;
$state += (my $digit = pop @digits);
if ($digit != 8) {
$dir = $state; # lowest non-8 digit
}
### $len
### $state
### digit_to_x: $digit_to_x[$state]
### digit_to_y: $digit_to_y[$state]
### next_state: $next_state[$state]
$x += $len * $digit_to_x[$state];
$y += $len * $digit_to_y[$state];
$state = $next_state[$state];
}
### $dir
### frac: $n
# with $n fractional part
return ($n * ($digit_to_x[$dir+1] - $digit_to_x[$dir]) + $x,
$n * ($digit_to_y[$dir+1] - $digit_to_y[$dir]) + $y);
}
sub xy_to_n {
my ($self, $x, $y) = @_;
### KochelCurve xy_to_n(): "$x, $y"
$x = round_nearest ($x);
$y = round_nearest ($y);
if ($x < 0 || $y < 0) {
return undef;
}
if (is_infinite($x)) {
return $x;
}
if (is_infinite($y)) {
return $y;
}
my @xdigits = digit_split_lowtohigh ($x, 3);
my @ydigits = digit_split_lowtohigh ($y, 3);
my $state = 63;
my @ndigits;
foreach my $i (reverse 0 .. max($#xdigits,$#ydigits)) { # high to low
my $ndigit = $xy_to_digit[$state
+ 3*($xdigits[$i]||0)
+ ($ydigits[$i]||0)];
$ndigits[$i] = $ndigit;
$state = $next_state[$state+$ndigit];
}
return digit_join_lowtohigh (\@ndigits, 9,
$x * 0 * $y); # bignum zero
}
# exact
sub rect_to_n_range {
my ($self, $x1,$y1, $x2,$y2) = @_;
### KochelCurve rect_to_n_range(): "$x1,$y1, $x2,$y2"
$x1 = round_nearest ($x1);
$x2 = round_nearest ($x2);
$y1 = round_nearest ($y1);
$y2 = round_nearest ($y2);
($x1,$x2) = ($x2,$x1) if $x1 > $x2;
($y1,$y2) = ($y2,$y1) if $y1 > $y2;
if ($x2 < 0 || $y2 < 0) {
return (1, 0);
}
my ($len, $level) = round_down_pow (max($x2,$y2), 3);
### $len
### $level
if (is_infinite($level)) {
return (0, $level);
}
# At this point an easy round-up range here would be:
# return (0, 9*$len*$len-1);
my $n_min = my $n_max
= my $x_min = my $y_min
= my $x_max = my $y_max
= ($x1 * 0 * $x2 * $y1 * $y2); # inherit bignum 0
my $min_state = my $max_state = 63;
# x__ 0
# xx_ 1
# xxx 2
# _xx 3
# __x 4
# _x_ 5
#
while ($level >= 0) {
my $l2 = 2*$len;
{
my $x_cmp1 = $x_min + $len;
my $y_cmp1 = $y_min + $len;
my $x_cmp2 = $x_min + $l2;
my $y_cmp2 = $y_min + $l2;
my $digit = $min_digit[4*$min_state # 4*9=36 apart
+ ($x1 >= $x_cmp2 ? 4
: $x1 >= $x_cmp1 ? ($x2 < $x_cmp2 ? 5 : 3)
: ($x2 < $x_cmp1 ? 0
: $x2 < $x_cmp2 ? 1 : 2))
+ ($y1 >= $y_cmp2 ? 6*4
: $y1 >= $y_cmp1 ? ($y2 < $y_cmp2 ? 6*5 : 6*3)
: ($y2 < $y_cmp1 ? 6*0
: $y2 < $y_cmp2 ? 6*1 : 6*2))];
# my $key = 4*$min_state # 4*9=36 apart
# + ($x1 >= $x_cmp2 ? 4
# : $x1 >= $x_cmp1 ? ($x2 < $x_cmp2 ? 5 : 3)
# : ($x2 < $x_cmp1 ? 0
# : $x2 < $x_cmp2 ? 1 : 2))
# + ($y1 >= $y_cmp2 ? 6*4
# : $y1 >= $y_cmp1 ? ($y2 < $y_cmp2 ? 6*5 : 6*3)
# : ($y2 < $y_cmp1 ? 6*0
# : $y2 < $y_cmp2 ? 6*1 : 6*2));
# ### $min_state
# ### $len
# ### $l2
# ### $key
# ### $x_cmp1
# ### $x_cmp2
# ### $digit
$n_min = 9*$n_min + $digit;
$min_state += $digit;
$x_min += $len * $digit_to_x[$min_state];
$y_min += $len * $digit_to_y[$min_state];
$min_state = $next_state[$min_state];
}
{
my $x_cmp1 = $x_max + $len;
my $y_cmp1 = $y_max + $len;
my $x_cmp2 = $x_max + $l2;
my $y_cmp2 = $y_max + $l2;
my $digit = $max_digit[4*$max_state # 4*9=36 apart
+ ($x1 >= $x_cmp2 ? 4
: $x1 >= $x_cmp1 ? ($x2 < $x_cmp2 ? 5 : 3)
: ($x2 < $x_cmp1 ? 0
: $x2 < $x_cmp2 ? 1 : 2))
+ ($y1 >= $y_cmp2 ? 6*4
: $y1 >= $y_cmp1 ? ($y2 < $y_cmp2 ? 6*5 : 6*3)
: ($y2 < $y_cmp1 ? 6*0
: $y2 < $y_cmp2 ? 6*1 : 6*2))];
# my $key = 4*$max_state # 4*9=36 apart
# + ($x1 >= $x_cmp2 ? 4
# : $x1 >= $x_cmp1 ? ($x2 < $x_cmp2 ? 5 : 3)
# : ($x2 < $x_cmp1 ? 0
# : $x2 < $x_cmp2 ? 1 : 2))
# + ($y1 >= $y_cmp2 ? 4
# : $y1 >= $y_cmp1 ? ($y2 < $y_cmp2 ? 5 : 3)
# : ($y2 < $y_cmp1 ? 0
# : $y2 < $y_cmp2 ? 1 : 2));
# ### $max_state
# ### $len
# ### $l2
# ### $x_key
# ### $key
# ### $x_max
# ### $y_max
# ### $x_cmp1
# ### $x_cmp2
# ### $y_cmp1
# ### $y_cmp2
# ### $digit
# ### max digit: $max_digit[$key]
$n_max = 9*$n_max + $digit;
$max_state += $digit;
$x_max += $len * $digit_to_x[$max_state];
$y_max += $len * $digit_to_y[$max_state];
$max_state = $next_state[$max_state];
}
$len = int($len/3);
$level--;
}
return ($n_min, $n_max);
}
#-----------------------------------------------------------------------------
# level_to_n_range()
use Math::PlanePath::SquareReplicate;
*level_to_n_range = \&Math::PlanePath::SquareReplicate::level_to_n_range;
*n_to_level = \&Math::PlanePath::SquareReplicate::n_to_level;
#-----------------------------------------------------------------------------
1;
__END__
=for stopwords eg Ryde ie Math-PlanePath Haverkort Haverkort's Rrev Frev Kochel Tilings
=head1 NAME
Math::PlanePath::KochelCurve -- 3x3 self-similar R and F
=head1 SYNOPSIS
use Math::PlanePath::KochelCurve;
my $path = Math::PlanePath::KochelCurve->new;
my ($x, $y) = $path->n_to_xy (123);
=head1 DESCRIPTION
X<Haverkort, Herman>This is an integer version of the Kochel curve by Herman
Haverkort. It fills the first quadrant in a 3x3 self-similar pattern made
from two base shapes.
=cut
# math-image --path=KochelCurve --all --output=numbers_dash
=pod
|
8 80--79 72--71--70--69 60--59--58
| | | | |
7 77--78 73 66--67--68 61 56--57
| | | | |
6 76--75--74 65--64--63--62 55--54
|
5 11--12 17--18--19--20 47--48 53
| | | | | | |
4 10 13 16 25--24 21 46 49 52
| | | | | | | | |
3 9 14--15 26 23--22 45 50--51
| | |
2 8-- 7-- 6 27--28--29 44--43--42
| | |
1 1-- 2 5 32--31--30 37--38 41
| | | | | | |
Y=0-> 0 3-- 4 33--34--35--36 39--40
X=0 1 2 3 4 5 6 7 8 9 10 11 12 13 14
The base shapes are an "R" and an "F". The R goes along an edge, the F goes
diagonally across.
R pattern F pattern ^
+------+-----+-----+ +------+-----+----|+
|2 | |3\ |4 | |2 | |3\ |8 ||
| R | | F | R | | R | | F | R ||
| | | \ |-----| | | | \ | ||
+------+-----+-----+ +------+-----+-----+
|1 / |6 |5 / | |1 / |4 / |7 / |
| F | Rrev| F | | F | F | F |
| / |-----| / | | / | / | / |
+------+-----+-----+ +------+-----+-----+
|0| |7\ |8 | |0| |5\ ||6 |
| |Rrev| F | R | | |Rrev| F ||Rrev|
| o | \ |------> | o | \ || |
+------+-----+-----+ +------+-----+-----+
"Rrev" means the R pattern followed in reverse, which is
+------+-----+-----+
|8<----|7\ |6 | Rrev pattern
| R | F | Rrev|
| | \ |-----| turned -90 degrees
+------+-----+-----+ so as to start at
|1 / ||2 |5 / | bottom left
| F || R | F |
| / || | / |
+------+-----+-----+
|0| |3\ ||4 |
| |Rrev| F ||Rrev|
| o | \ || |
+------+-----+-----+
The F pattern is symmetric, the same forward or reverse, including its
sub-parts taken in reverse, so there's no separate "Frev" pattern.
The initial N=0 to N=8 is the Rrev turned -90, then N=9 to N=17 is the F
shape. The next higher level N=0,N=9,N=18 to N=72 is the Rrev too, as is
any N=9^k to N=8*9^k.
=head2 Fractal
The curve is conceived by Haverkort for filling a unit square by descending
into ever-smaller replacements, like other space-filling curves. For that
the top-level can be any of the patterns. To descend any of the shapes can
be used for the start, but for the outward expanding version here the
starting pattern must occur at the start of its next higher level, which
means Rrev is the only choice as it's the only start in any of the three
patterns.
But all the patterns can be found in the path at any desired size. For
example the "1" part of Rrev is an F, which means F to a desired level can
be found at
NFstart = 1 * 9^level
NFlast = NFstart + 9^level - 1
= 2 * 9^level - 1
XFstart = 3^level
YFstart = 0
level=3 for N=729 to N=1457 is a 27x27 which is the level-three F shown in
Haverkort's paper, starting at XFstart=27,YFstart=0.
=head1 FUNCTIONS
See L<Math::PlanePath/FUNCTIONS> for behaviour common to all path classes.
=over 4
=item C<$path = Math::PlanePath::KochelCurve-E<gt>new ()>
Create and return a new path object.
=item C<($x,$y) = $path-E<gt>n_to_xy ($n)>
Return the X,Y coordinates of point number C<$n> on the path. Points begin
at 0 and if C<$n E<lt> 0> then the return is an empty list.
=back
=head2 Level Methods
=over
=item C<($n_lo, $n_hi) = $path-E<gt>level_to_n_range($level)>
Return C<(0, 9**$level - 1)>.
=back
=head1 SEE ALSO
L<Math::PlanePath>,
L<Math::PlanePath::PeanoCurve>,
L<Math::PlanePath::WunderlichMeander>
Herman Haverkort, "Recursive Tilings and Space-Filling Curves with Little
Fragmentation", Journal of Computational Geometry, 2(1), 92-127, 2011.
=over
L<http://jocg.org/index.php/jocg/article/view/68>
L<http://jocg.org/index.php/jocg/article/download/68/20>
L<http://arxiv.org/abs/1002.1843>
L<http://alexandria.tue.nl/openaccess/Metis239505.pdf>
(slides)
L<http://www.win.tue.nl/~hermanh/stack/h-rtslf-eurocg2010-talk.pdf>
(short form)
=back
=head1 HOME PAGE
L<http://user42.tuxfamily.org/math-planepath/index.html>
=head1 LICENSE
Copyright 2011, 2012, 2013, 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/>.
=cut
|