cc44089440
circular, convex, concave) and performs efficient collision detection agains these build volumes. As of now, collision detection is performed against a convex hull of a concave build volume for efficency. GCodeProcessor::Result renamed out of GCodeProcessor to GCodeProcessorResult, so it could be forward declared. Plater newly exports BuildVolume, not Bed3D. Bed3D is a rendering class, while BuildVolume is a purely geometric class. Reduced usage of global wxGetApp, the Bed3D is passed as a parameter to View3D/Preview/GLCanvas. Convex hull code was extracted from Geometry.cpp/hpp to Geometry/ConvexHulll.cpp,hpp. New test inside_convex_polygon(). New efficent point inside polygon test: Decompose convex hull to bottom / top parts and use the decomposition to detect point inside a convex polygon in O(log n). decompose_convex_polygon_top_bottom(), inside_convex_polygon(). New Circle constructing functions: circle_ransac() and circle_taubin_newton(). New polygon_is_convex() test with unit tests.
114 lines
2.2 KiB
Plaintext
114 lines
2.2 KiB
Plaintext
%module{Slic3r::XS};
|
|
|
|
%{
|
|
#include <xsinit.h>
|
|
#include "libslic3r/Geometry.hpp"
|
|
#include "libslic3r/Geometry/ConvexHull.hpp"
|
|
#include "libslic3r/ShortestPath.hpp"
|
|
%}
|
|
|
|
|
|
%package{Slic3r::Geometry};
|
|
|
|
Pointfs arrange(size_t total_parts, Vec2d* part, coordf_t dist, BoundingBoxf* bb = NULL)
|
|
%code{%
|
|
Pointfs points;
|
|
if (! Slic3r::Geometry::arrange(total_parts, *part, dist, bb, points))
|
|
CONFESS("%zu parts won't fit in your print area!\n", total_parts);
|
|
RETVAL = points;
|
|
%};
|
|
|
|
%{
|
|
|
|
bool
|
|
directions_parallel(angle1, angle2)
|
|
double angle1
|
|
double angle2
|
|
CODE:
|
|
RETVAL = Slic3r::Geometry::directions_parallel(angle1, angle2);
|
|
OUTPUT:
|
|
RETVAL
|
|
|
|
bool
|
|
directions_parallel_within(angle1, angle2, max_diff)
|
|
double angle1
|
|
double angle2
|
|
double max_diff
|
|
CODE:
|
|
RETVAL = Slic3r::Geometry::directions_parallel(angle1, angle2, max_diff);
|
|
OUTPUT:
|
|
RETVAL
|
|
|
|
Clone<Polygon>
|
|
convex_hull(points)
|
|
Points points
|
|
CODE:
|
|
RETVAL = Slic3r::Geometry::convex_hull(points);
|
|
OUTPUT:
|
|
RETVAL
|
|
|
|
std::vector<Points::size_type>
|
|
chained_path(points)
|
|
Points points
|
|
CODE:
|
|
RETVAL = chain_points(points);
|
|
OUTPUT:
|
|
RETVAL
|
|
|
|
std::vector<Points::size_type>
|
|
chained_path_from(points, start_from)
|
|
Points points
|
|
Point* start_from
|
|
CODE:
|
|
RETVAL = chain_points(points, start_from);
|
|
OUTPUT:
|
|
RETVAL
|
|
|
|
double
|
|
rad2deg(angle)
|
|
double angle
|
|
CODE:
|
|
RETVAL = Slic3r::Geometry::rad2deg(angle);
|
|
OUTPUT:
|
|
RETVAL
|
|
|
|
double
|
|
rad2deg_dir(angle)
|
|
double angle
|
|
CODE:
|
|
RETVAL = Slic3r::Geometry::rad2deg_dir(angle);
|
|
OUTPUT:
|
|
RETVAL
|
|
|
|
double
|
|
deg2rad(angle)
|
|
double angle
|
|
CODE:
|
|
RETVAL = Slic3r::Geometry::deg2rad(angle);
|
|
OUTPUT:
|
|
RETVAL
|
|
|
|
Polygons
|
|
simplify_polygons(polygons, tolerance)
|
|
Polygons polygons
|
|
double tolerance
|
|
CODE:
|
|
Slic3r::Geometry::simplify_polygons(polygons, tolerance, &RETVAL);
|
|
OUTPUT:
|
|
RETVAL
|
|
|
|
|
|
IV
|
|
_constant()
|
|
ALIAS:
|
|
X = X
|
|
Y = Y
|
|
Z = Z
|
|
PROTOTYPE:
|
|
CODE:
|
|
RETVAL = ix;
|
|
OUTPUT: RETVAL
|
|
|
|
%}
|
|
|