package Slic3r::Polygon; use strict; use warnings; # a polygon is a closed polyline. use parent 'Slic3r::Polyline'; use Slic3r::Geometry qw(polygon_remove_parallel_continuous_edges polygon_remove_acute_vertices polygon_segment_having_point PI X1 X2 Y1 Y2 epsilon); sub wkt { my $self = shift; return sprintf "POLYGON((%s))", join ',', map "$_->[0] $_->[1]", @$self; } sub merge_continuous_lines { my $self = shift; my $p = $self->pp; polygon_remove_parallel_continuous_edges($p); return __PACKAGE__->new(@$p); } sub remove_acute_vertices { my $self = shift; polygon_remove_acute_vertices($self); } sub encloses_point { my $self = shift; my ($point) = @_; return Boost::Geometry::Utils::point_covered_by_polygon($point->pp, [$self->pp]); } sub grow { my $self = shift; return $self->split_at_first_point->grow(@_); } # NOTE that this will turn the polygon to ccw regardless of its # original orientation sub simplify { my $self = shift; return @{Slic3r::Geometry::Clipper::simplify_polygons([ $self->SUPER::simplify(@_) ])}; } # 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) = @_; for (my $i = 0; $i <= $#$self; $i++) { my $len = Slic3r::Geometry::line_length([ $self->[$i-1], $self->[$i] ]); my $num_points = int($len / $max_length) - 1; $num_points++ if $len % $max_length; # $num_points is the number of points to add between $i-1 and $i next if $num_points == -1; my $spacing = $len / ($num_points + 1); my @new_points = map Slic3r::Point->new($_), map Slic3r::Geometry::point_along_segment($self->[$i-1], $self->[$i], $spacing * $_), 1..$num_points; splice @$self, $i, 0, @new_points; $i += @new_points; } } # for cw polygons this will return convex points! sub concave_points { my $self = shift; my @points = @{$self->pp}; return map $self->[$_], grep Slic3r::Geometry::angle3points(@points[$_, $_-1, $_+1]) < PI - epsilon, -1 .. ($#points-1); } 1;