PrusaSlicer-NonPlainar/lib/Slic3r/ExPolygon.pm

275 lines
8.5 KiB
Perl
Raw Normal View History

package Slic3r::ExPolygon;
use strict;
use warnings;
# an ExPolygon is a polygon with holes
use Boost::Geometry::Utils;
use List::Util qw(first);
2011-12-30 16:17:37 +00:00
use Math::Geometry::Voronoi;
2013-11-06 18:38:10 +00:00
use Slic3r::Geometry qw(X Y A B point_in_polygon epsilon scaled_epsilon);
2013-08-26 23:26:44 +00:00
use Slic3r::Geometry::Clipper qw(union_ex);
2013-01-27 23:02:34 +00:00
sub wkt {
my $self = shift;
return sprintf "POLYGON(%s)",
join ',', map "($_)", map { join ',', map "$_->[0] $_->[1]", @$_ } @$self;
}
sub dump_perl {
my $self = shift;
return sprintf "[%s]",
join ',', map "[$_]", map { join ',', map "[$_->[0],$_->[1]]", @$_ } @$self;
}
sub offset {
my $self = shift;
2013-07-16 22:48:29 +00:00
return Slic3r::Geometry::Clipper::offset(\@$self, @_);
}
sub offset_ex {
my $self = shift;
return Slic3r::Geometry::Clipper::offset_ex(\@$self, @_);
}
sub noncollapsing_offset_ex {
my $self = shift;
my ($distance, @params) = @_;
return $self->offset_ex($distance + 1, @params);
}
sub encloses_point {
my $self = shift;
my ($point) = @_;
return Boost::Geometry::Utils::point_covered_by_polygon($point->pp, $self->pp);
}
# A version of encloses_point for use when hole borders do not matter.
# Useful because point_on_segment is probably slower (this was true
# before the switch to Boost.Geometry, not sure about now)
sub encloses_point_quick {
my $self = shift;
my ($point) = @_;
return Boost::Geometry::Utils::point_within_polygon($point->pp, $self->pp);
}
2012-03-04 10:26:11 +00:00
sub encloses_line {
my $self = shift;
my ($line, $tolerance) = @_;
2012-03-04 10:26:11 +00:00
my $clip = $self->clip_line($line);
if (!defined $tolerance) {
# optimization
2013-11-06 18:38:10 +00:00
return @$clip == 1 && $clip->[0]->coincides_with($line);
} else {
2013-11-06 18:38:10 +00:00
return @$clip == 1 && abs($clip->[0]->length - $line->length) < $tolerance;
}
2012-03-04 10:26:11 +00:00
}
sub bounding_box {
my $self = shift;
return $self->contour->bounding_box;
}
sub clip_line {
my $self = shift;
2012-02-25 21:15:34 +00:00
my ($line) = @_; # line must be a Slic3r::Line object
2013-07-16 15:13:01 +00:00
return [
map Slic3r::Line->new(@$_),
@{Boost::Geometry::Utils::polygon_multi_linestring_intersection($self->pp, [$line->pp])}
];
}
sub simplify_as_polygons {
my $self = shift;
my ($tolerance) = @_;
# it would be nice to have a multilinestring_simplify method in B::G::U
return @{Slic3r::Geometry::Clipper::simplify_polygons(
[ map Boost::Geometry::Utils::linestring_simplify($_, $tolerance), @{$self->pp} ],
)};
}
sub simplify {
my $self = shift;
my ($tolerance) = @_;
return @{ Slic3r::Geometry::Clipper::union_ex([ $self->simplify_as_polygons($tolerance) ]) };
}
2011-12-30 16:17:37 +00:00
# this method only works for expolygons having only a contour or
# a contour and a hole, and not being thicker than the supplied
# width. it returns a polyline or a polygon
sub medial_axis {
my ($self, $width) = @_;
return $self->_medial_axis_voronoi($width);
}
sub _medial_axis_clip {
my ($self, $width) = @_;
my $grow = sub {
my ($line, $distance) = @_;
my $line_clone = $line->clone;
$line_clone->clip_start(scaled_epsilon);
return () if !$line_clone->is_valid;
$line_clone->clip_end(scaled_epsilon);
return () if !$line_clone->is_valid;
my ($a, $b) = @$line_clone;
my $dx = $a->x - $b->x;
my $dy = $a->y - $b->y; #-
my $dist = sqrt($dx*$dx + $dy*$dy);
$dx /= $dist;
$dy /= $dist;
return Slic3r::Polygon->new(
Slic3r::Point->new($a->x + $distance*$dy, $a->y - $distance*$dx), #--
Slic3r::Point->new($b->x + $distance*$dy, $b->y - $distance*$dx), #--
Slic3r::Point->new($b->x - $distance*$dy, $b->y + $distance*$dx), #++
Slic3r::Point->new($a->x - $distance*$dy, $a->y + $distance*$dx), #++
);
};
my @result = ();
my $covered = [];
foreach my $polygon (@$self) {
my @polylines = ();
foreach my $line (@{$polygon->lines}) {
# remove the areas that are already covered from this line
my $clipped = Boost::Geometry::Utils::multi_linestring_multi_polygon_difference([$line->pp], [ map $_->pp, @{union_ex($covered)} ]);
# skip very short segments/dots
@$clipped = grep $_->length > $width/10, map Slic3r::Polyline->new(@$_), @$clipped;
# grow the remaining lines and add them to the covered areas
push @$covered, map $grow->($_, $width*1.1), @$clipped;
# if the first remaining segment is connected to the last polyline, append it
# to that -- NOTE: this assumes that multi_linestring_multi_polygon_difference()
# preserved the orientation of the input linestring
if (@polylines && @$clipped && $clipped->[0]->first_point->distance_to($polylines[-1]->last_point) <= $width/10) {
$polylines[-1]->append_polyline(shift @$clipped);
}
push @polylines, @$clipped;
}
foreach my $polyline (@polylines) {
# if this polyline looks like a closed loop, return it as a polygon
if ($polyline->first_point->coincides_with($polyline->last_point)) {
next if @$polyline == 2;
$polyline->pop_back;
push @result, Slic3r::Polygon->new(@$polyline);
} else {
push @result, $polyline;
}
}
}
return @result;
}
my $voronoi_lock :shared;
sub _medial_axis_voronoi {
my ($self, $width) = @_;
2011-12-30 16:17:37 +00:00
lock($voronoi_lock);
2013-09-16 17:15:30 +00:00
my $voronoi;
{
my @points = ();
foreach my $polygon (@$self) {
{
my $p = $polygon->pp;
Slic3r::Geometry::polyline_remove_short_segments($p, $width / 2);
$polygon = Slic3r::Polygon->new(@$p);
}
# subdivide polygon segments so that we don't have anyone of them
# being longer than $width / 2
$polygon = $polygon->subdivide($width/2);
push @points, @{$polygon->pp};
2013-08-26 14:25:42 +00:00
}
2013-09-16 17:15:30 +00:00
$voronoi = Math::Geometry::Voronoi->new(points => \@points);
2011-12-30 16:17:37 +00:00
}
$voronoi->compute;
2013-09-16 17:15:30 +00:00
my $vertices = $voronoi->vertices;
2011-12-30 16:17:37 +00:00
my @skeleton_lines = ();
2013-09-16 17:15:30 +00:00
foreach my $edge (@{ $voronoi->edges }) {
2011-12-30 16:17:37 +00:00
# ignore lines going to infinite
next if $edge->[1] == -1 || $edge->[2] == -1;
next if !$self->encloses_point_quick(Slic3r::Point->new(@{$vertices->[$edge->[1]]}))
|| !$self->encloses_point_quick(Slic3r::Point->new(@{$vertices->[$edge->[2]]}));
2011-12-30 16:17:37 +00:00
push @skeleton_lines, [$edge->[1], $edge->[2]];
}
2012-06-07 13:31:51 +00:00
return () if !@skeleton_lines;
2011-12-30 16:17:37 +00:00
# now walk along the medial axis and build continuos polylines or polygons
my @polylines = ();
2011-12-30 16:17:37 +00:00
{
2013-09-16 15:44:30 +00:00
my @lines = @skeleton_lines;
push @polylines, [ map @$_, shift @lines ];
CYCLE: while (@lines) {
for my $i (0..$#lines) {
if ($lines[$i][0] == $polylines[-1][-1]) {
push @{$polylines[-1]}, $lines[$i][1];
} elsif ($lines[$i][1] == $polylines[-1][-1]) {
push @{$polylines[-1]}, $lines[$i][0];
} elsif ($lines[$i][1] == $polylines[-1][0]) {
unshift @{$polylines[-1]}, $lines[$i][0];
} elsif ($lines[$i][0] == $polylines[-1][0]) {
unshift @{$polylines[-1]}, $lines[$i][1];
} else {
next;
}
2013-09-16 15:44:30 +00:00
splice @lines, $i, 1;
next CYCLE;
2011-12-30 16:17:37 +00:00
}
2013-09-16 15:44:30 +00:00
push @polylines, [ map @$_, shift @lines ];
2011-12-30 16:17:37 +00:00
}
}
my @result = ();
foreach my $polyline (@polylines) {
next unless @$polyline >= 2;
2011-12-30 16:17:37 +00:00
# now replace point indexes with coordinates
my @points = map Slic3r::Point->new(@{$vertices->[$_]}), @$polyline;
2011-12-30 16:17:37 +00:00
if ($points[0]->coincides_with($points[-1])) {
next if @points == 2;
push @result, Slic3r::Polygon->new(@points[0..$#points-1]);
} else {
push @result, Slic3r::Polyline->new(@points);
2011-12-30 16:17:37 +00:00
}
$result[-1]->simplify($width / 7);
2011-12-30 16:17:37 +00:00
}
return @result;
2011-12-30 16:17:37 +00:00
}
package Slic3r::ExPolygon::Collection;
use Slic3r::Geometry qw(X1 Y1);
sub align_to_origin {
my $self = shift;
my @bb = Slic3r::Geometry::bounding_box([ map @$_, map @$_, @$self ]);
$self->translate(-$bb[X1], -$bb[Y1]);
$self;
}
sub size {
my $self = shift;
return [ Slic3r::Geometry::size_2D([ map @$_, map @$_, @$self ]) ];
}
1;