PrusaSlicer-NonPlainar/lib/Slic3r/STL.pm

167 lines
5.9 KiB
Perl
Raw Normal View History

2011-09-01 19:06:28 +00:00
package Slic3r::STL;
use Moo;
2011-09-01 19:06:28 +00:00
use CAD::Format::STL;
use XXX;
use constant X => 0;
use constant Y => 1;
use constant Z => 2;
use constant MIN => 0;
use constant MAX => 1;
2011-09-01 19:06:28 +00:00
sub parse_file {
my $self = shift;
my ($file) = @_;
2011-09-03 18:47:38 +00:00
# open STL file
2011-09-01 19:06:28 +00:00
my $stl = CAD::Format::STL->new->load($file);
# we only want to work with positive coordinates, so let's
# find our object extents to calculate coordinate displacements
my @extents = (map [99999999, -99999999], X,Y,Z);
foreach my $facet ($stl->part->facets) {
my ($normal, @vertices) = @$facet;
foreach my $vertex (@vertices) {
for (X,Y,Z) {
$extents[$_][MIN] = $vertex->[$_] if $vertex->[$_] < $extents[$_][MIN];
$extents[$_][MAX] = $vertex->[$_] if $vertex->[$_] > $extents[$_][MAX];
2011-09-01 19:06:28 +00:00
}
}
}
2011-09-03 18:47:38 +00:00
# initialize print job
my $print = Slic3r::Print->new(
x_length => ($extents[X][MAX] - $extents[X][MIN]) / $Slic3r::resolution,
y_length => ($extents[Y][MAX] - $extents[Y][MIN]) / $Slic3r::resolution,
);
2011-09-01 19:06:28 +00:00
# calculate the displacements needed to
# have lowest value for each axis at coordinate 0
my @shift = map -$extents[$_][MIN], X,Y,Z;
2011-09-01 19:06:28 +00:00
# process facets
foreach my $facet ($stl->part->facets) {
# transform vertex coordinates
my ($normal, @vertices) = @$facet;
foreach my $vertex (@vertices) {
$vertex->[$_] = sprintf('%.0f', ($vertex->[$_] + $shift[$_]) / $Slic3r::resolution)
for X,Y,Z;
}
$self->_facet($print, @$facet);
}
print "\n==> PROCESSING SLICES:\n";
foreach my $layer (@{ $print->layers }) {
printf "\nProcessing layer %d:\n", $layer->id;
2011-09-01 19:06:28 +00:00
# build polylines of lines which do not already belong to a surface
my $polylines = $layer->make_polylines;
# build surfaces of polylines (distinguishing contours from holes)
$layer->make_surfaces($polylines);
# merge surfaces having a common line
$layer->merge_contiguous_surfaces;
}
# detect which surfaces are near external layers
$print->discover_horizontal_shells;
2011-09-01 19:06:28 +00:00
return $print;
}
sub _facet {
my $self = shift;
my ($print, $normal, @vertices) = @_;
Slic3r::debugf "\n==> FACET (%f,%f,%f - %f,%f,%f - %f,%f,%f):\n", map @$_, @vertices
2011-09-05 11:33:09 +00:00
if $Slic3r::debug;
2011-09-01 19:06:28 +00:00
# find the vertical extents of the facet
my ($min_z, $max_z) = (99999999, -99999999);
foreach my $vertex (@vertices) {
$min_z = $vertex->[Z] if $vertex->[Z] < $min_z;
$max_z = $vertex->[Z] if $vertex->[Z] > $max_z;
}
2011-09-05 11:33:09 +00:00
Slic3r::debugf "z: min = %.0f, max = %.0f\n", $min_z, $max_z;
2011-09-01 19:06:28 +00:00
# calculate the layer extents
my ($min_layer, $max_layer) = map {$_ * $Slic3r::resolution / $Slic3r::layer_height} $min_z, $max_z;
2011-09-05 11:33:09 +00:00
Slic3r::debugf "layers: min = %.0f, max = %.0f\n", $min_layer, $max_layer;
2011-09-01 19:06:28 +00:00
# is the facet horizontal?
if ($min_layer == $max_layer) {
2011-09-05 11:33:09 +00:00
Slic3r::debugf "Facet is horizontal\n";
2011-09-01 19:06:28 +00:00
my $layer = $print->layer($min_layer);
my $surface = $layer->add_surface(@vertices);
# to determine whether the surface is a top or bottom let's recompute
# the normal using the right-hand rule
# (this relies on the STL to be well-formed)
# recompute the normal using the right-hand rule
my $clockwise = ($vertices[2]->[X] - $vertices[0]->[X]) * ($vertices[1]->[Y] - $vertices[0]->[Y])
- ($vertices[1]->[X] - $vertices[0]->[X]) * ($vertices[2]->[Y] - $vertices[0]->[Y]);
# defensive programming and/or input check
if (($normal->[Z] > 0 && $clockwise > 0) || ($normal->[Z] < 0 && $clockwise < 0)) {
YYY $normal;
die sprintf "STL normal (%.0f) and right-hand rule computation (%s) differ!\n",
$normal->[Z], $clockwise > 0 ? 'clockwise' : 'counter-clockwise';
2011-09-01 19:06:28 +00:00
}
if ($layer->id == 0 && $clockwise < 0) {
die "Right-hand rule gives bad result for facets on base layer!\n";
}
$surface->surface_type($clockwise < 0 ? 'top' : 'bottom');
return;
}
# build the three segments of the triangle facet
my @edges = (
[ $vertices[0], $vertices[1] ],
[ $vertices[1], $vertices[2] ],
[ $vertices[2], $vertices[0] ],
);
for (my $layer_id = $min_layer; $layer_id <= $max_layer; $layer_id++) {
my $layer = $print->layer($layer_id);
my $z = $layer->z;
my @intersection_points = ();
foreach my $edge (@edges) {
my ($a, $b) = @$edge;
if ($a->[Z] == $b->[Z] && $a->[Z] == $z) {
# edge is horizontal and belongs to the current layer
$layer->add_line([$a->[X], $a->[Y]], [$b->[X], $b->[Y]]);
} elsif (($a->[Z] < $z && $b->[Z] > $z) || ($b->[Z] < $z && $a->[Z] > $z)) {
# edge intersects the current layer; calculate intersection
push @intersection_points, Slic3r::Point->cast([
2011-09-01 19:06:28 +00:00
$b->[X] + ($a->[X] - $b->[X]) * ($z - $b->[Z]) / ($a->[Z] - $b->[Z]),
$b->[Y] + ($a->[Y] - $b->[Y]) * ($z - $b->[Z]) / ($a->[Z] - $b->[Z]),
]);
}
}
if (@intersection_points) {
# defensive programming:
die "Facets must intersect each plane 0 or 2 times" if @intersection_points != 2;
# check whether the two points coincide due to resolution rounding
if ($intersection_points[0]->coincides_with($intersection_points[1])) {
2011-09-05 11:33:09 +00:00
Slic3r::debugf "Points coincide; removing\n";
2011-09-01 19:06:28 +00:00
next;
}
# connect points:
$layer->add_line(@intersection_points);
}
}
}
1;