Slic3r::IntersectionPoint Class Reference

Inheritance diagram for Slic3r::IntersectionPoint:

Collaboration diagram for Slic3r::IntersectionPoint:

Public Types
using	coord_type = coord_t

Public Member Functions
	IntersectionPoint ()=default
	IntersectionPoint (int point_id, int edge_id, const Point &pt)
	IntersectionPoint (const IntersectionReference &ir, const Point &pt)
Point &	operator+= (const Point &rhs)
Point &	operator-= (const Point &rhs)
Point &	operator*= (const double &rhs)
Point	operator* (const double &rhs)
bool	both_comp (const Point &rhs, const std::string &op)
bool	any_comp (const Point &rhs, const std::string &op)
void	rotate (double angle)
void	rotate (double cos_a, double sin_a)
void	rotate (double angle, const Point &center)
Point	rotated (double angle) const
Point	rotated (double cos_a, double sin_a) const
Point	rotated (double angle, const Point &center) const
Point	rotate_90_degree_ccw () const
int	nearest_point_index (const Points &points) const
int	nearest_point_index (const PointConstPtrs &points) const
int	nearest_point_index (const PointPtrs &points) const
bool	nearest_point (const Points &points, Point *point) const
double	ccw (const Point &p1, const Point &p2) const
double	ccw (const Line &line) const
double	ccw_angle (const Point &p1, const Point &p2) const
Point	projection_onto (const MultiPoint &poly) const
Point	projection_onto (const Line &line) const
double	distance_to (const Point &point) const

Static Public Member Functions
static Point	new_scale (coordf_t x, coordf_t y)
template<typename OtherDerived>
static Point	new_scale (const Eigen::MatrixBase< OtherDerived > &v)

Public Attributes
int	point_id { -1 }
int	edge_id { -1 }

Detailed Description

Member Typedef Documentation

coord_type

using Slic3r::Point::coord_type = coord_t

inherited

Constructor & Destructor Documentation

IntersectionPoint() [1/3]

Slic3r::IntersectionPoint::IntersectionPoint ( )

default

IntersectionPoint() [2/3]

Slic3r::IntersectionPoint::IntersectionPoint ( int point_id, int edge_id, const Point & pt )

inline

: IntersectionReference(point_id, edge_id), Point(pt) {}

References Slic3r::IntersectionReference::IntersectionReference(), Slic3r::Point::Point(), Slic3r::IntersectionReference::edge_id, and Slic3r::IntersectionReference::point_id.

Here is the call graph for this function:

IntersectionPoint() [3/3]

Slic3r::IntersectionPoint::IntersectionPoint ( const IntersectionReference & ir, const Point & pt )

inline

: IntersectionReference(ir), Point(pt) {}

References Slic3r::IntersectionReference::IntersectionReference(), and Slic3r::Point::Point().

Here is the call graph for this function:

Member Function Documentation

any_comp()

bool Slic3r::Point::any_comp ( const Point & rhs, const std::string & op )

inlineinherited

    {
        if (op == ">")
            return this->x() > rhs.x() || this->y() > rhs.y();
        else if (op == "<")
            return this->x() < rhs.x() || this->y() < rhs.y();
        return false;
    }

References Point().

Here is the call graph for this function:

both_comp()

bool Slic3r::Point::both_comp ( const Point & rhs, const std::string & op )

inlineinherited

                                                            { 
        if (op == ">")
            return this->x() > rhs.x() && this->y() > rhs.y();
        else if (op == "<")
            return this->x() < rhs.x() && this->y() < rhs.y();
        return false;
    }

References Point().

Here is the call graph for this function:

ccw() [1/2]

double Slic3r::Point::ccw ( const Line & line ) const

inherited

{
    return this->ccw(line.a, line.b);
}

References Slic3r::Line::a, Slic3r::Line::b, and ccw().

Here is the call graph for this function:

ccw() [2/2]

double Slic3r::Point::ccw ( const Point & p1, const Point & p2 ) const

inherited

{
    // static_assert(sizeof(coord_t) == 4, "Point::ccw() requires a 32 bit coord_t");
    // return cross2((p2 - p1).cast<int64_t>(), (*this - p1).cast<int64_t>());
   return cross2((p2 - p1).cast<double>(), (*this - p1).cast<double>());
}

References Point(), Slic3r::cast(), and Slic3r::cross2().

Referenced by Slic3r::Point3::ccw(), Slic3r::Point3::ccw(), and ccw().

Here is the call graph for this function:

Here is the caller graph for this function:

ccw_angle()

double Slic3r::Point::ccw_angle ( const Point & p1, const Point & p2 ) const

inherited

{
    //FIXME this calculates an atan2 twice! Project one vector into the other!
    double angle = atan2(p1.x() - (*this).x(), p1.y() - (*this).y())
                 - atan2(p2.x() - (*this).x(), p2.y() - (*this).y());
    // we only want to return only positive angles
    return angle <= 0 ? angle + 2*PI : angle;
}

References Point(), and Slic3r::angle().

Referenced by Slic3r::Point3::ccw_angle(), Slic3r::GCode::extrude_loop(), and Slic3r::wipe_on_loops_destination().

Here is the call graph for this function:

Here is the caller graph for this function:

distance_to()

double Slic3r::Point::distance_to ( const Point & point ) const

inlineinherited

{ return (point - *this).cast<double>().norm(); }

References Point().

Referenced by Slic3r::generate_spiral_insets(), and Slic3r::remove_overlapped().

Here is the call graph for this function:

Here is the caller graph for this function:

nearest_point()

bool Slic3r::Point::nearest_point ( const Points & points, Point * point ) const

inherited

{
    int idx = this->nearest_point_index(points);
    if (idx == -1) return false;
    *point = points.at(idx);
    return true;
}

References Point(), and nearest_point_index().

Referenced by Slic3r::Point3::nearest_point().

Here is the call graph for this function:

Here is the caller graph for this function:

nearest_point_index() [1/3]

int Slic3r::Point::nearest_point_index ( const PointConstPtrs & points ) const

inherited

{
    int idx = -1;
    double distance = -1;  // double because long is limited to 2147483647 on some platforms and it's not enough
    
    for (PointConstPtrs::const_iterator it = points.begin(); it != points.end(); ++it) {
        /* If the X distance of the candidate is > than the total distance of the
           best previous candidate, we know we don't want it */
        double d = sqr<double>((*this)(0) - (*it)->x());
        if (distance != -1 && d > distance) continue;
        
        /* If the Y distance of the candidate is > than the total distance of the
           best previous candidate, we know we don't want it */
        d += sqr<double>((*this)(1) - (*it)->y());
        if (distance != -1 && d > distance) continue;
        
        idx = it - points.begin();
        distance = d;
        
        if (distance < EPSILON) break;
    }
    
    return idx;
}

References EPSILON, and Slic3r::sqr().

Here is the call graph for this function:

nearest_point_index() [2/3]

int Slic3r::Point::nearest_point_index ( const PointPtrs & points ) const

inherited

{
    PointConstPtrs p;
    p.reserve(points.size());
    for (PointPtrs::const_iterator it = points.begin(); it != points.end(); ++it)
        p.push_back(*it);
    return this->nearest_point_index(p);
}

References nearest_point_index().

Here is the call graph for this function:

nearest_point_index() [3/3]

int Slic3r::Point::nearest_point_index ( const Points & points ) const

inherited

{
    PointConstPtrs p;
    p.reserve(points.size());
    for (Points::const_iterator it = points.begin(); it != points.end(); ++it)
        p.push_back(&*it);
    return this->nearest_point_index(p);
}

References nearest_point_index().

Referenced by Slic3r::FillConcentric::_fill_surface_single(), Slic3r::FillConcentric::_fill_surface_single(), Slic3r::FillConcentricInternal::fill_surface_extrusion(), Slic3r::generate_spiral_insets(), nearest_point(), Slic3r::Point3::nearest_point_index(), nearest_point_index(), and nearest_point_index().

Here is the call graph for this function:

Here is the caller graph for this function:

new_scale() [1/2]

template<typename OtherDerived>

Point Slic3r::Point::new_scale ( const Eigen::MatrixBase< OtherDerived > & v )

inlinestaticinherited

{ return Point(coord_t(scale_(v.x())), coord_t(scale_(v.y()))); }

References Point(), and scale_.

Here is the call graph for this function:

new_scale() [2/2]

Point Slic3r::Point::new_scale ( coordf_t x, coordf_t y )

inlinestaticinherited

{ return Point(coord_t(scale_(x)), coord_t(scale_(y))); }

References Point(), and scale_.

Referenced by Slic3r::PrintObject::PrintObject(), Slic3r::Geometry::circle_center_taubin_newton(), Slic3r::WipeTower2::cone_base_polygon(), libvgcode::convert_wipe_tower_to_vertices(), Slic3r::Geometry::convex_hull(), Slic3r::TriangleMesh::convex_hull(), Slic3r::detect_overhangs(), Slic3r::SupportSpotsGenerator::estimate_malformations(), Slic3r::WipeTower2::finish_layer(), Slic3r::FillAdaptive::generate_infill_lines_recursive(), Slic3r::WipeTower2::generate_rib_polygon(), Slic3r::WipeTower::generate_rib_polygon(), Slic3r::WipeTower2::generate_support_cone_wall(), Slic3r::FakeWipeTower::getFakeExtrusionPathsFromWipeTower2(), Slic3r::GUI::MeshClipper::is_projection_inside_cut(), Slic3r::GUI::Plater::priv::load_model_objects(), Slic3r::GCode::needs_retraction(), Slic3r::Polygon::new_scale(), Slic3r::Polyline::new_scale(), Slic3r::SeamPlacer::place_seam(), anonymous_namespace{OrcaSlicer_profile_validator.cpp}::place_wipe_tower(), Slic3r::GUI::MeshClipper::point_per_contour(), Slic3r::print_objects_from_model_object(), Slic3r::GUI::PartPlateList::set_default_wipe_tower_pos_for_plate(), Slic3r::sla_instances(), Slic3r::GCodeWriter::spiral_lift_fits_printable_area(), Slic3r::WipeTower2::toolchange_Change(), and Slic3r::AvoidCrossingPerimeters::travel_to().

Here is the call graph for this function:

Here is the caller graph for this function:

operator*()

Point Slic3r::Point::operator* ( const double & rhs )

inlineinherited

{ return Point(this->x() * rhs, this->y() * rhs); }

References Point().

Here is the call graph for this function:

operator*=()

Point & Slic3r::Point::operator*= ( const double & rhs )

inlineinherited

{ this->x() = coord_t(this->x() * rhs); this->y() = coord_t(this->y() * rhs); return *this; }

References Point().

Here is the call graph for this function:

operator+=()

Point & Slic3r::Point::operator+= ( const Point & rhs )

inlineinherited

{ this->x() += rhs.x(); this->y() += rhs.y(); return *this; }

References Point().

Here is the call graph for this function:

operator-=()

Point & Slic3r::Point::operator-= ( const Point & rhs )

inlineinherited

{ this->x() -= rhs.x(); this->y() -= rhs.y(); return *this; }

References Point().

Here is the call graph for this function:

projection_onto() [1/2]

Point Slic3r::Point::projection_onto ( const Line & line ) const

inherited

{
    if (line.a == line.b) return line.a;
    
    /*
        (Ported from VisiLibity by Karl J. Obermeyer)
        The projection of point_temp onto the line determined by
        line_segment_temp can be represented as an affine combination
        expressed in the form projection of
        Point = theta*line_segment_temp.first + (1.0-theta)*line_segment_temp.second.
        If theta is outside the interval [0,1], then one of the Line_Segment's endpoints
        must be closest to calling Point.
    */
    double lx = (double)(line.b(0) - line.a(0));
    double ly = (double)(line.b(1) - line.a(1));
    double theta = ( (double)(line.b(0) - (*this)(0))*lx + (double)(line.b(1)- (*this)(1))*ly ) 
          / ( sqr<double>(lx) + sqr<double>(ly) );
    
    if (0.0 <= theta && theta <= 1.0)
        return (theta * line.a.cast<coordf_t>() + (1.0-theta) * line.b.cast<coordf_t>()).cast<coord_t>();
    
    // Else pick closest endpoint.
    return ((line.a - *this).cast<double>().squaredNorm() < (line.b - *this).cast<double>().squaredNorm()) ? line.a : line.b;
}

References Point(), Slic3r::Line::a, Slic3r::Line::b, and Slic3r::sqr().

Here is the call graph for this function:

projection_onto() [2/2]

Point Slic3r::Point::projection_onto ( const MultiPoint & poly ) const

inherited

{
    Point running_projection = poly.first_point();
    double running_min = (running_projection - *this).cast<double>().norm();
    
    Lines lines = poly.lines();
    for (Lines::const_iterator line = lines.begin(); line != lines.end(); ++line) {
        Point point_temp = this->projection_onto(*line);
        if ((point_temp - *this).cast<double>().norm() < running_min) {
          running_projection = point_temp;
          running_min = (running_projection - *this).cast<double>().norm();
        }
    }
    return running_projection;
}

References Point(), Slic3r::cast(), and projection_onto().

Referenced by Slic3r::clip_extrusion(), Slic3r::foot_pt(), Slic3r::MultiPoint::has_boundary_point(), Slic3r::Point3::projection_onto(), projection_onto(), Slic3r::projection_onto(), Slic3r::Polyline3::split_at(), and Slic3r::Polyline::split_at().

Here is the call graph for this function:

Here is the caller graph for this function:

rotate() [1/3]

void Slic3r::Point::rotate ( double angle )

inlineinherited

{ this->rotate(std::cos(angle), std::sin(angle)); }

References Slic3r::angle(), and rotate().

Referenced by Slic3r::GCode::extrude_loop(), Slic3r::FillSupportBase::fill_surface(), Slic3r::TreeSupport::generate_contact_points(), rotate(), rotated(), rotated(), rotated(), and Slic3r::wipe_on_loops_destination().

Here is the call graph for this function:

Here is the caller graph for this function:

rotate() [2/3]

void Slic3r::Point::rotate ( double angle, const Point & center )

inherited

{
    Vec2d  cur = this->cast<double>();
    double s   = ::sin(angle);
    double c   = ::cos(angle);
    Vec2d  d   = cur - center.cast<double>();
    this->x() = fast_round_up<coord_t>(center.x() + c * d.x() - s * d.y());
    this->y() = fast_round_up<coord_t>(center.y() + s * d.x() + c * d.y());
}

References Point(), Slic3r::angle(), Slic3r::cast(), Slic3r::center(), and Slic3r::fast_round_up().

Here is the call graph for this function:

rotate() [3/3]

void Slic3r::Point::rotate ( double cos_a, double sin_a )

inlineinherited

                                              {
        double cur_x = (double)this->x();
        double cur_y = (double)this->y();
        this->x() = (coord_t)round(cos_a * cur_x - sin_a * cur_y);
        this->y() = (coord_t)round(cos_a * cur_y + sin_a * cur_x);
    }

rotate_90_degree_ccw()

Point Slic3r::Point::rotate_90_degree_ccw ( ) const

inlineinherited

{ return Point(-this->y(), this->x()); }

References Point().

Here is the call graph for this function:

rotated() [1/3]

Point Slic3r::Point::rotated ( double angle ) const

inlineinherited

{ Point res(*this); res.rotate(angle); return res; }

References Point(), Slic3r::angle(), and rotate().

Referenced by Slic3r::Geometry::VoronoiUtils::discretize_parabola(), Slic3r::FillRectilinear::fill_surface_by_lines(), and Slic3r::make_fill_lines().

Here is the call graph for this function:

Here is the caller graph for this function:

rotated() [2/3]

Point Slic3r::Point::rotated ( double angle, const Point & center ) const

inlineinherited

{ Point res(*this); res.rotate(angle, center); return res; }

References Point(), Slic3r::angle(), Slic3r::center(), and rotate().

Here is the call graph for this function:

rotated() [3/3]

Point Slic3r::Point::rotated ( double cos_a, double sin_a ) const

inlineinherited

{ Point res(*this); res.rotate(cos_a, sin_a); return res; }

References Point(), and rotate().

Here is the call graph for this function:

Member Data Documentation

edge_id

int Slic3r::IntersectionReference::edge_id { -1 }

inherited

{ -1 };

Referenced by Slic3r::IntersectionPoint::IntersectionPoint(), IntersectionReference(), Slic3r::chain_open_polylines_exact(), Slic3r::slice_facet(), and Slic3r::slice_facet_for_cut_mesh().

point_id

int Slic3r::IntersectionReference::point_id { -1 }

inherited

{ -1 };

Referenced by Slic3r::IntersectionPoint::IntersectionPoint(), IntersectionReference(), Slic3r::chain_open_polylines_exact(), Slic3r::slice_facet(), and Slic3r::slice_facet_for_cut_mesh().

---

The documentation for this class was generated from the following file:

• /home/runner/work/OrcaSlicer/OrcaSlicer/src/libslic3r/TriangleMeshSlicer.cpp