179 lines
4.8 KiB
Perl
179 lines
4.8 KiB
Perl
package Slic3r::Polyline;
|
|
use strict;
|
|
use warnings;
|
|
|
|
use Slic3r::Geometry qw(A B X Y X1 X2 Y1 Y2 polyline_remove_parallel_continuous_edges polyline_remove_acute_vertices);
|
|
use Slic3r::Geometry::Clipper qw(JT_SQUARE);
|
|
use Storable qw();
|
|
|
|
sub wkt {
|
|
my $self = shift;
|
|
return sprintf "LINESTRING((%s))", join ',', map "$_->[0] $_->[1]", @$self;
|
|
}
|
|
|
|
sub merge_continuous_lines {
|
|
my $self = shift;
|
|
polyline_remove_parallel_continuous_edges($self);
|
|
}
|
|
|
|
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->pp, $tolerance);
|
|
return (ref $self)->new(@$simplified);
|
|
}
|
|
|
|
sub length {
|
|
my $self = shift;
|
|
return Boost::Geometry::Utils::linestring_length($self->pp);
|
|
}
|
|
|
|
sub grow {
|
|
my $self = shift;
|
|
my ($distance, $scale, $joinType, $miterLimit) = @_;
|
|
$joinType //= JT_SQUARE;
|
|
|
|
return map Slic3r::Polygon->new(@$_),
|
|
Slic3r::Geometry::Clipper::offset(
|
|
[ [ @$self, CORE::reverse @$self[1..($#$self-1)] ] ],
|
|
$distance, $scale, $joinType, $miterLimit,
|
|
);
|
|
}
|
|
|
|
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->pp, [$self->pp]);
|
|
return @$result;
|
|
}
|
|
|
|
sub bounding_box {
|
|
my $self = shift;
|
|
return Slic3r::Geometry::BoundingBox->new_from_points($self);
|
|
}
|
|
|
|
sub size {
|
|
my $self = shift;
|
|
return [ Slic3r::Geometry::size_2D($self) ];
|
|
}
|
|
|
|
sub align_to_origin {
|
|
my $self = shift;
|
|
my $bb = $self->bounding_box;
|
|
return $self->translate(-$bb->x_min, -$bb->y_min);
|
|
}
|
|
|
|
# removes the given distance from the end of the polyline
|
|
sub clip_end {
|
|
my $self = shift;
|
|
my ($distance) = @_;
|
|
|
|
while ($distance > 0) {
|
|
my $last_point = $self->[-1];
|
|
$self->pop_back;
|
|
last if @$self == 0;
|
|
|
|
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);
|
|
$self->append(Slic3r::Point->new($new_point));
|
|
$distance = 0;
|
|
}
|
|
}
|
|
|
|
# only keeps the given distance at the beginning of the polyline
|
|
sub clip_start {
|
|
my $self = shift;
|
|
my ($distance) = @_;
|
|
|
|
my $points = [ $self->[0] ];
|
|
|
|
for (my $i = 1; $distance > 0 && $i <= $#$self; $i++) {
|
|
my $point = $self->[$i];
|
|
my $segment_length = $point->distance_to($self->[$i-1]);
|
|
if ($segment_length <= $distance) {
|
|
$distance -= $segment_length;
|
|
push @$points, $point;
|
|
next;
|
|
}
|
|
|
|
my $new_point = Slic3r::Geometry::point_along_segment($self->[$i-1], $point, $distance);
|
|
push @$points, Slic3r::Point->new($new_point);
|
|
$distance = 0;
|
|
}
|
|
|
|
return (ref $self)->new($points);
|
|
}
|
|
|
|
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 {
|
|
my $self = shift;
|
|
my ($start_near, $items, $no_reverse) = @_;
|
|
|
|
$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 = $no_reverse
|
|
? [ map { $_->[0], $_->[0] } @my_paths ]
|
|
: [ map { $_->[0], $_->[-1] } @my_paths ];
|
|
while (@my_paths) {
|
|
# find nearest point
|
|
my $start_index = defined $start_near
|
|
? Slic3r::Geometry::nearest_point_index($start_near, $endpoints)
|
|
: 0;
|
|
|
|
my $path_index = int($start_index/2);
|
|
if ($start_index % 2 && !$no_reverse) { # 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;
|
|
}
|
|
|
|
1;
|