◆ AllIntersectionsVisitor() [1/2]
57 {
59 }
std::unordered_set< std::pair< size_t, size_t >, boost::hash< std::pair< size_t, size_t > > > intersection_set
Definition AvoidCrossingPerimeters.cpp:90
std::vector< Intersection > & intersections
Definition AvoidCrossingPerimeters.cpp:88
const EdgeGrid::Grid & grid
Definition AvoidCrossingPerimeters.cpp:87
References intersection_set, and intersections.
◆ AllIntersectionsVisitor() [2/2]
◆ operator()()
| bool Slic3r::AllIntersectionsVisitor::operator() |
( |
coord_t |
iy, |
|
|
coord_t |
ix |
|
) |
| |
|
inline |
72 {
73
75 for (auto it_contour_and_segment = cell_data_range.first; it_contour_and_segment != cell_data_range.second; ++it_contour_and_segment) {
76 Point intersection_point;
79 intersections.push_back({ it_contour_and_segment->first, it_contour_and_segment->second, intersection_point });
81 }
82 }
83
84 return true;
85 }
std::pair< std::vector< std::pair< size_t, size_t > >::const_iterator, std::vector< std::pair< size_t, size_t > >::const_iterator > cell_data_range(coord_t row, coord_t col) const
Definition EdgeGrid.hpp:336
Line line(const std::pair< size_t, size_t > &contour_and_segment_idx) const
Definition EdgeGrid.hpp:351
bool intersection(const Line &line, Point *intersection) const
Definition Line.cpp:92
Kernel::Point_2 Point
Definition point_areas.cpp:20
References Slic3r::EdgeGrid::Grid::cell_data_range(), grid, Slic3r::Line::intersection(), intersection_set, intersections, Slic3r::EdgeGrid::Grid::line(), and travel_line.
◆ reset()
| void Slic3r::AllIntersectionsVisitor::reset |
( |
| ) |
|
|
inline |
◆ grid
◆ intersection_set
| std::unordered_set<std::pair<size_t, size_t>, boost::hash<std::pair<size_t, size_t> > > Slic3r::AllIntersectionsVisitor::intersection_set |
◆ intersections
| std::vector<Intersection>& Slic3r::AllIntersectionsVisitor::intersections |
◆ travel_line
| Line Slic3r::AllIntersectionsVisitor::travel_line |
The documentation for this struct was generated from the following file: