2011-10-15 09:36:05 +00:00
|
|
|
package Slic3r::Polygon;
|
|
|
|
use strict;
|
|
|
|
use warnings;
|
|
|
|
|
|
|
|
# a polygon is a closed polyline.
|
2011-12-30 18:59:51 +00:00
|
|
|
use parent 'Slic3r::Polyline';
|
2011-10-15 09:36:05 +00:00
|
|
|
|
2013-07-16 07:49:34 +00:00
|
|
|
use Slic3r::Geometry qw(polygon_remove_parallel_continuous_edges
|
|
|
|
polygon_remove_acute_vertices polygon_segment_having_point
|
2013-06-22 22:20:52 +00:00
|
|
|
PI X1 X2 Y1 Y2 epsilon);
|
2011-10-15 09:36:05 +00:00
|
|
|
|
2012-11-06 19:31:50 +00:00
|
|
|
sub wkt {
|
|
|
|
my $self = shift;
|
|
|
|
return sprintf "POLYGON((%s))", join ',', map "$_->[0] $_->[1]", @$self;
|
|
|
|
}
|
|
|
|
|
2011-12-30 18:59:51 +00:00
|
|
|
sub merge_continuous_lines {
|
|
|
|
my $self = shift;
|
|
|
|
|
2013-07-16 07:49:34 +00:00
|
|
|
my $p = $self->pp;
|
|
|
|
polygon_remove_parallel_continuous_edges($p);
|
2013-09-03 17:26:58 +00:00
|
|
|
return __PACKAGE__->new(@$p);
|
2011-12-30 18:59:51 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
sub remove_acute_vertices {
|
|
|
|
my $self = shift;
|
|
|
|
polygon_remove_acute_vertices($self);
|
2011-10-15 09:36:05 +00:00
|
|
|
}
|
|
|
|
|
2011-11-13 17:14:02 +00:00
|
|
|
sub encloses_point {
|
|
|
|
my $self = shift;
|
|
|
|
my ($point) = @_;
|
2013-07-16 15:13:01 +00:00
|
|
|
return Boost::Geometry::Utils::point_covered_by_polygon($point->pp, [$self->pp]);
|
2011-11-13 17:14:02 +00:00
|
|
|
}
|
|
|
|
|
2013-03-09 16:07:11 +00:00
|
|
|
sub grow {
|
|
|
|
my $self = shift;
|
|
|
|
return $self->split_at_first_point->grow(@_);
|
|
|
|
}
|
|
|
|
|
2013-07-20 10:22:41 +00:00
|
|
|
# NOTE that this will turn the polygon to ccw regardless of its
|
|
|
|
# original orientation
|
2013-03-16 17:42:56 +00:00
|
|
|
sub simplify {
|
|
|
|
my $self = shift;
|
2014-01-14 11:49:07 +00:00
|
|
|
my $tolerance = shift || 10;
|
|
|
|
|
|
|
|
my $simplified = Boost::Geometry::Utils::linestring_simplify($self->pp, $tolerance);
|
|
|
|
return @{Slic3r::Geometry::Clipper::simplify_polygons([ $simplified ])};
|
2013-03-16 17:42:56 +00:00
|
|
|
}
|
|
|
|
|
2011-12-30 16:17:37 +00:00
|
|
|
# this method subdivides the polygon segments to that no one of them
|
|
|
|
# is longer than the length provided
|
|
|
|
sub subdivide {
|
|
|
|
my $self = shift;
|
|
|
|
my ($max_length) = @_;
|
|
|
|
|
2013-09-16 15:44:30 +00:00
|
|
|
my @points = @$self;
|
|
|
|
push @points, $points[0]; # append first point as this is a polygon
|
|
|
|
my @new_points = shift @points;
|
|
|
|
while (@points) {
|
|
|
|
while ($new_points[-1]->distance_to($points[0]) > $max_length) {
|
|
|
|
push @new_points, map Slic3r::Point->new(@$_),
|
|
|
|
Slic3r::Geometry::point_along_segment($new_points[-1], $points[0], $max_length);
|
|
|
|
}
|
|
|
|
push @new_points, shift @points;
|
2011-12-30 16:17:37 +00:00
|
|
|
}
|
2013-09-16 15:44:30 +00:00
|
|
|
pop @new_points; # remove last point as it coincides with first one
|
|
|
|
return Slic3r::Polygon->new(@new_points);
|
2011-12-30 16:17:37 +00:00
|
|
|
}
|
|
|
|
|
2013-06-22 13:22:58 +00:00
|
|
|
# for cw polygons this will return convex points!
|
2013-06-21 17:43:15 +00:00
|
|
|
sub concave_points {
|
|
|
|
my $self = shift;
|
|
|
|
|
2013-09-16 16:42:28 +00:00
|
|
|
my @points = @$self;
|
|
|
|
my @points_pp = @{$self->pp};
|
|
|
|
return map $points[$_],
|
|
|
|
grep Slic3r::Geometry::angle3points(@points_pp[$_, $_-1, $_+1]) < PI - epsilon,
|
2013-07-16 15:13:01 +00:00
|
|
|
-1 .. ($#points-1);
|
2013-06-21 17:43:15 +00:00
|
|
|
}
|
|
|
|
|
2011-10-15 09:36:05 +00:00
|
|
|
1;
|