PrusaSlicer-NonPlainar/lib/Slic3r/Polyline.pm

224 lines
5.2 KiB
Perl
Raw Normal View History

2011-09-01 19:06:28 +00:00
package Slic3r::Polyline;
use strict;
use warnings;
2011-09-01 19:06:28 +00:00
use Scalar::Util qw(reftype);
2012-09-12 14:30:44 +00:00
use Slic3r::Geometry qw(A B X Y X1 X2 Y1 Y2 polyline_remove_parallel_continuous_edges polyline_remove_acute_vertices
polyline_lines move_points same_point);
# the constructor accepts an array(ref) of points
sub new {
my $class = shift;
my $self;
if (@_ == 1) {
$self = [ @{$_[0]} ];
} else {
$self = [ @_ ];
}
2012-07-20 12:41:27 +00:00
bless $self, $class;
bless $_, 'Slic3r::Point' for @$self;
$self;
}
2011-09-01 19:06:28 +00:00
sub clone {
my $self = shift;
return (ref $self)->new(map $_->clone, @$self);
}
sub serialize {
my $self = shift;
return pack 'l*', map @$_, @$self;
}
sub deserialize {
my $class = shift;
my ($s) = @_;
my @v = unpack '(l2)*', $s;
return $class->new(map [ $v[2*$_], $v[2*$_+1] ], 0 .. int($#v/2));
}
sub lines {
2011-09-01 19:06:28 +00:00
my $self = shift;
return polyline_lines($self);
2011-09-01 19:06:28 +00:00
}
sub boost_linestring {
my $self = shift;
return Boost::Geometry::Utils::linestring($self);
}
sub wkt {
my $self = shift;
return sprintf "LINESTRING((%s))", join ',', map "$_->[0] $_->[1]", @$self;
}
sub merge_continuous_lines {
2011-09-02 19:10:20 +00:00
my $self = shift;
polyline_remove_parallel_continuous_edges($self);
2011-10-09 20:18:06 +00:00
}
sub remove_acute_vertices {
my $self = shift;
polyline_remove_acute_vertices($self);
}
sub simplify {
my $self = shift;
my $tolerance = shift || 10;
my $simplified = Boost::Geometry::Utils::linestring_simplify($self, $tolerance);
return (ref $self)->new($simplified);
}
sub reverse {
my $self = shift;
@$self = CORE::reverse @$self;
}
2012-05-13 20:56:40 +00:00
sub length {
my $self = shift;
my $length = 0;
$length += $_->length for $self->lines;
return $length;
}
sub grow {
my $self = shift;
return Slic3r::Polygon->new(@$self, CORE::reverse @$self[1..($#$self-1)])->offset(@_);
}
sub nearest_point_to {
my $self = shift;
my ($point) = @_;
$point = Slic3r::Geometry::nearest_point($point, $self);
return Slic3r::Point->new($point);
}
sub nearest_point_index_to {
my $self = shift;
my ($point) = @_;
return Slic3r::Geometry::nearest_point_index($point, $self);
}
sub clip_with_polygon {
my $self = shift;
my ($polygon) = @_;
return $self->clip_with_expolygon(Slic3r::ExPolygon->new($polygon));
}
sub clip_with_expolygon {
my $self = shift;
my ($expolygon) = @_;
my $result = Boost::Geometry::Utils::polygon_multi_linestring_intersection($expolygon, [$self]);
bless $_, 'Slic3r::Polyline' for @$result;
bless $_, 'Slic3r::Point' for map @$_, @$result;
return @$result;
}
sub bounding_box {
my $self = shift;
return Slic3r::Geometry::bounding_box($self);
}
sub size {
my $self = shift;
2012-11-19 16:39:16 +00:00
return [ Slic3r::Geometry::size_2D($self) ];
2012-09-12 14:30:44 +00:00
}
sub align_to_origin {
my $self = shift;
my @bb = $self->bounding_box;
return $self->translate(-$bb[X1], -$bb[Y1]);
}
2012-04-16 09:55:14 +00:00
sub rotate {
my $self = shift;
my ($angle, $center) = @_;
@$self = Slic3r::Geometry::rotate_points($angle, $center, @$self);
bless $_, 'Slic3r::Point' for @$self;
2012-06-23 19:31:29 +00:00
return $self;
2012-04-16 09:55:14 +00:00
}
sub translate {
my $self = shift;
my ($x, $y) = @_;
2012-04-16 09:55:14 +00:00
@$self = Slic3r::Geometry::move_points([$x, $y], @$self);
bless $_, 'Slic3r::Point' for @$self;
2012-06-23 19:31:29 +00:00
return $self;
}
2012-09-12 14:30:44 +00:00
sub scale {
my $self = shift;
my ($factor) = @_;
return if $factor == 1;
# transform point coordinates
foreach my $point (@$self) {
$point->[$_] *= $factor for X,Y;
}
return $self;
}
sub clip_end {
my $self = shift;
my ($distance) = @_;
while ($distance > 0) {
my $last_point = pop @$self;
last if !@$self;
my $last_segment_length = $last_point->distance_to($self->[-1]);
if ($last_segment_length <= $distance) {
$distance -= $last_segment_length;
next;
}
my $new_point = Slic3r::Geometry::point_along_segment($last_point, $self->[-1], $distance);
push @$self, Slic3r::Point->new($new_point);
$distance = 0;
}
}
2012-10-30 12:59:33 +00:00
package Slic3r::Polyline::Collection;
use Moo;
has 'polylines' => (is => 'ro', default => sub { [] });
# If the second argument is provided, this method will return its items sorted
# instead of returning the actual sorted polylines.
# Note that our polylines will be reversed in place when necessary.
sub chained_path {
2012-10-30 12:59:33 +00:00
my $self = shift;
my ($start_near, $items) = @_;
$items ||= $self->polylines;
my %items_map = map { $self->polylines->[$_] => $items->[$_] } 0 .. $#{$self->polylines};
my @my_paths = @{$self->polylines};
my @paths = ();
my $start_at;
my $endpoints = [ map { $_->[0], $_->[-1] } @my_paths ];
while (@my_paths) {
# find nearest point
my $start_index = $start_near
? Slic3r::Geometry::nearest_point_index($start_near, $endpoints)
: 0;
my $path_index = int($start_index/2);
if ($start_index%2) { # index is end so reverse to make it the start
$my_paths[$path_index]->reverse;
}
push @paths, splice @my_paths, $path_index, 1;
splice @$endpoints, $path_index*2, 2;
$start_near = $paths[-1][-1];
}
return map $items_map{"$_"}, @paths;
}
2011-09-01 19:06:28 +00:00
1;