Home
last modified time | relevance | path

Searched refs:point_idx (Results 1 – 25 of 150) sorted by relevance

123456

/dports/cad/cura-engine/CuraEngine-fadb5d6b/src/pathPlanning/
H A DLinePolygonsCrossings.cpp16 , point_idx(point_idx) in Crossing()
26 for(unsigned int point_idx = 0; point_idx < poly.size(); point_idx++) in calcScanlineCrossings() local
153 for (unsigned int point_idx = min.point_idx in generateBasicCombingPath() local
154 ; point_idx != max.point_idx in generateBasicCombingPath()
155 ; point_idx = (point_idx < poly.size() - 1) ? (point_idx + 1) : (0)) in generateBasicCombingPath()
174 unsigned int min_idx = (min.point_idx == 0)? poly.size() - 1 : min.point_idx - 1; in generateBasicCombingPath()
175 unsigned int max_idx = (max.point_idx == 0)? poly.size() - 1 : max.point_idx - 1; in generateBasicCombingPath()
177 ; point_idx != max_idx in generateBasicCombingPath()
178 ; point_idx = (point_idx > 0) ? (point_idx - 1) : (poly.size() - 1)) in generateBasicCombingPath()
207 for(unsigned int point_idx = 1; point_idx<comb_path.size(); point_idx++) in optimizePath() local
[all …]
/dports/cad/cura-engine/CuraEngine-fadb5d6b/src/utils/
H A DPolygonsPointIndex.h29 …unsigned int point_idx; //!< The index of the point in the polygon in \ref PolygonsPointIndex::pol… variable
41 , point_idx(0) in PolygonsPointIndex()
51 PolygonsPointIndex(const Polygons* polygons, unsigned int poly_idx, unsigned int point_idx) in PolygonsPointIndex() argument
54 , point_idx(point_idx) in PolygonsPointIndex()
69 return (*polygons)[poly_idx][point_idx]; in p()
92 … return polygons == other.polygons && poly_idx == other.poly_idx && point_idx == other.point_idx;
102 point_idx = other.point_idx;
108 point_idx = (point_idx + 1) % (*polygons)[poly_idx].size();
114 if (point_idx == 0)
116 point_idx = (*polygons)[poly_idx].size();
[all …]
H A DpolygonUtils.cpp29 for (unsigned int point_idx = 1; point_idx <= poly.size(); point_idx++) in segmentLength() local
31 unsigned int vert_idx = (start.point_idx + point_idx) % poly.size(); in segmentLength()
105 for (p2_idx = point_idx + 1; p2_idx != point_idx; p2_idx = p2_idx + 1) in getVertexInwardNormal()
127 return poly[point_idx] + normal(getVertexInwardNormal(poly, point_idx), -offset); in getBoundaryPointWithOffset()
473 unsigned int point_idx = cpp.point_idx; in moveInside() local
478 for (p2_idx = point_idx + 1; p2_idx != point_idx; p2_idx = p2_idx + 1) in moveInside()
632 for (size_t point_idx = 0; point_idx < poly1.size(); point_idx++) in findConnection() local
712 if (poly1_result.point_idx == NO_INDEX || poly2_result.point_idx == NO_INDEX) in walkToNearestSmallestConnection()
903 for (unsigned int point_idx = 0; point_idx < poly.size(); point_idx++) in findNearestVert() local
920 for (unsigned int point_idx = 0; point_idx < poly.size(); point_idx++) in findNearestVert() local
[all …]
H A DpolygonUtils.h27 …unsigned int point_idx; //!< Index to the first point in the polygon of the line segment on which … member
28 …, int pos, ConstPolygonRef poly) : location(p), poly(poly), poly_idx(NO_INDEX), point_idx(pos) {}; in ClosestPolygonPoint()
29 …stPolygonRef poly, int poly_idx) : location(p), poly(poly), poly_idx(poly_idx), point_idx(pos) {}; in ClosestPolygonPoint()
30 …ClosestPolygonPoint(ConstPolygonRef poly) : poly(poly), poly_idx(NO_INDEX), point_idx(NO_INDEX) {}; in ClosestPolygonPoint()
31 ClosestPolygonPoint() : poly_idx(NO_INDEX), point_idx(NO_INDEX) {}; in ClosestPolygonPoint()
38 return point_idx != NO_INDEX; in isValid()
44 return poly == rhs.poly && point_idx == rhs.point_idx && location == rhs.location;
96 Point start = poly[val.point_idx];
97 unsigned int next_point_idx = (val.point_idx + 1) % poly.size();
146 static Point getVertexInwardNormal(ConstPolygonRef poly, unsigned int point_idx);
[all …]
/dports/graphics/opencv/opencv-4.5.3/modules/calib3d/src/usac/
H A Dlocal_optimization.cpp122 for (int point_idx = 0; point_idx < points_size; ++point_idx) { in labeling() local
123 energy = energies[point_idx]; in labeling()
127 if (actual_neighbor_idx == point_idx || in labeling()
137 graph.addTermWeights(point_idx, d, a); in labeling()
142 graph.addTermWeights(point_idx, 0, b); in labeling()
146 graph.addTermWeights(point_idx, 0, -c); in labeling()
150 graph.addEdges(point_idx, actual_neighbor_idx, b, c); in labeling()
436 for (int point_idx = 0; point_idx < points_size; ++point_idx) { in refineModel() local
438 const auto residual = sqrtf(errors[point_idx]); in refineModel()
452 for (int point_idx = 0; point_idx < points_size; ++point_idx) { in refineModel() local
[all …]
H A Destimator.cpp257 const int smpl = 4*point_idx; in getError()
269 for (int point_idx = 0; point_idx < points_mat->rows; point_idx++) { in getErrors() local
318 const int smpl = 4*point_idx; in getError()
327 for (int point_idx = 0; point_idx < points_mat->rows; point_idx++) { in getErrors() local
383 const int smpl = 4*point_idx; in getError()
395 for (int point_idx = 0; point_idx < points_mat->rows; point_idx++) { in getErrors() local
444 const int smpl = 4*point_idx; in getError()
460 for (int point_idx = 0; point_idx < points_mat->rows; point_idx++) { in getErrors() local
508 const int smpl = 5*point_idx; in getError()
518 for (int point_idx = 0; point_idx < points_mat->rows; point_idx++) { in getErrors() local
[all …]
/dports/cad/cura-engine/CuraEngine-fadb5d6b/src/
H A DpathOrderOptimizer.cpp153 for (unsigned int point_idx = 0; point_idx < poly.size(); point_idx++) in getClosestPointInPolygon() local
155 const Point& p1 = poly[point_idx]; in getClosestPointInPolygon()
156 const Point& p2 = poly[(point_idx + 1) % poly.size()]; in getClosestPointInPolygon()
215 best_point_idx = point_idx; in getClosestPointInPolygon()
250 …for (unsigned int point_idx = 0; point_idx < poly.size(); point_idx++) /// get closest point from … in optimize() local
252 float dist = vSize2f(poly[point_idx] - startPoint); in optimize()
255 best_point_idx = point_idx; in optimize()
285 for (unsigned point_idx = 0; point_idx < 2; ++point_idx) in optimize() local
288 num_joined_lines[point_idx] = 0; in optimize()
289 const Point& p = (*polygons[poly_idx])[point_idx]; in optimize()
[all …]
H A DLayerPlan.cpp542 for (unsigned int point_idx = 1; point_idx < polygon.size(); point_idx++) in addPolygon() local
559 for (unsigned int point_idx = 1; ; point_idx++) in addPolygon() local
829 for (unsigned point_idx = current_index; point_idx < wall.size(); ++point_idx) in addWall() local
909 for (unsigned int point_idx = 1; point_idx < wall.size(); point_idx++) in addWall() local
975 for (unsigned int point_idx = 1; ; point_idx++) in addWall() local
1650 for(unsigned int point_idx = 0; point_idx < path.points.size(); point_idx++) in writeGCode() local
1671 for(unsigned int point_idx = 0; point_idx < path.points.size(); point_idx++) in writeGCode() local
1686 for (unsigned int point_idx = 0; point_idx < _path.points.size(); point_idx++) in writeGCode() local
1700 for (unsigned int point_idx = 0; point_idx < path.points.size(); point_idx++) in writeGCode() local
1878 for(size_t point_idx = 0; point_idx <= point_idx_before_start; point_idx++) in writePathWithCoasting() local
[all …]
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/registration/src/
H A Dgicp6d.cpp64 for (std::size_t point_idx = 0; point_idx < cloud->size(); ++point_idx) { in setInputSource() local
65 PointXYZRGBtoXYZLAB((*cloud)[point_idx], (*cloud_lab_)[point_idx]); in setInputSource()
78 for (std::size_t point_idx = 0; point_idx < target->size(); ++point_idx) { in setInputTarget() local
79 PointXYZRGBtoXYZLAB((*target)[point_idx], (*target_lab_)[point_idx]); in setInputTarget()
/dports/cad/cura-engine/CuraEngine-fadb5d6b/tests/utils/
H A DPolygonUtilsTest.cpp61 << "\tclosest_point = " << cpp.location << " at index " << cpp.point_idx << "."; in TEST_P()
99 << "\tclosest point = " << cpp.location << " at index " << cpp.point_idx << "."; in TEST_F()
117 << "\tclosest point = " << cpp.location << " at index " << cpp.point_idx << "."; in TEST_F()
132 << "\tclosest point = " << cpp.location << " at index " << cpp.point_idx << "."; in TEST_F()
159 ASSERT_NE(cpp.point_idx, NO_INDEX) << "Couldn't ensure point inside close to " << from << "."; in TEST_F()
173 ASSERT_NE(cpp.point_idx, NO_INDEX) << "Couldn't ensure point inside close to " << from << "."; in TEST_F()
187 ASSERT_NE(cpp.point_idx, NO_INDEX) << "Couldn't ensure point inside close to " << from << "."; in TEST_F()
320 for (size_t point_idx = 0; point_idx < result.size(); point_idx++) in TEST_F() local
322 EXPECT_EQ(result[point_idx].p(), supposed[point_idx].p()); in TEST_F()
342 for (size_t point_idx = 0; point_idx < result.size(); point_idx++) in TEST_F() local
[all …]
/dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/libslic3r/Fill/
H A DFillBase.cpp162 size_t point_idx; member
399 take(pl1, pl2, contour, cp_start->point_idx, cp_end->point_idx, clockwise); in take()
442 int new_points = int(cp_end->point_idx) - int(cp_start->point_idx) - 1; in take_limited()
459 … take_ccw_limited(pl1, contour, params, cp_start->point_idx, cp_start->point_idx, length_to_go); in take_limited()
479 take_cw_full(pl1, contour, cp->point_idx, cp->prev_on_contour->point_idx); in take_limited()
500 take_ccw_full(pl1, contour, cp->point_idx, cp->next_on_contour->point_idx); in take_limited()
754 take_ccw_full(pl, contour, ip->point_idx, ip->next_on_contour->point_idx); in export_infill_to_svg()
766 take_cw_full(pl, contour, ip->point_idx, ip->prev_on_contour->point_idx); in export_infill_to_svg()
1010 …for (size_t point_idx = start_point.idx_segment; point_idx <= end_point.idx_segment; ++ point_idx)… in mark_boundary_segments_touching_infill() local
1019 pt1 = polyline.points[point_idx]; in mark_boundary_segments_touching_infill()
[all …]
/dports/cad/cura-engine/CuraEngine-fadb5d6b/src/infill/
H A DZigzagConnectorProcessor.cpp142 for (size_t point_idx = 1; point_idx <= points.size() - 2; ++point_idx) in addZagConnector() local
144 addLine(points[point_idx - 1], points[point_idx]); in addZagConnector()
/dports/devel/stylua/StyLua-0.11.0/cargo-crates/plotters-0.3.1/src/series/
H A Dline_series.rs11 point_idx: usize, field
20 if self.point_size > 0 && self.point_idx < self.data.len() { in next()
21 let idx = self.point_idx; in next()
22 self.point_idx += 1; in next()
43 point_idx: 0, in new()
/dports/multimedia/librav1e/rav1e-0.5.1/cargo-crates/plotters-0.3.1/src/series/
H A Dline_series.rs11 point_idx: usize, field
20 if self.point_size > 0 && self.point_idx < self.data.len() { in next()
21 let idx = self.point_idx; in next()
22 self.point_idx += 1; in next()
43 point_idx: 0, in new()
/dports/multimedia/rav1e/rav1e-0.5.1/cargo-crates/plotters-0.3.1/src/series/
H A Dline_series.rs11 point_idx: usize, field
20 if self.point_size > 0 && self.point_idx < self.data.len() { in next()
21 let idx = self.point_idx; in next()
22 self.point_idx += 1; in next()
43 point_idx: 0, in new()
/dports/net-im/zkgroup/zkgroup-0.7.4/cargo-crates/plotters-0.3.1/src/series/
H A Dline_series.rs11 point_idx: usize, field
20 if self.point_size > 0 && self.point_idx < self.data.len() { in next()
21 let idx = self.point_idx; in next()
22 self.point_idx += 1; in next()
43 point_idx: 0, in new()
/dports/sysutils/vector/vector-0.10.0/cargo-crates/plotters-0.2.12/src/series/
H A Dline_series.rs11 point_idx: usize, field
20 if self.point_size > 0 && self.point_idx < self.data.len() { in next()
21 let idx = self.point_idx; in next()
22 self.point_idx += 1; in next()
43 point_idx: 0, in new()
/dports/net-im/libsignal-client/libsignal-client-0.9.6/cargo-crates/plotters-0.3.0/src/series/
H A Dline_series.rs11 point_idx: usize, field
20 if self.point_size > 0 && self.point_idx < self.data.len() { in next()
21 let idx = self.point_idx; in next()
22 self.point_idx += 1; in next()
43 point_idx: 0, in new()
/dports/misc/xplr/xplr-0.17.0/cargo-crates/plotters-0.3.1/src/series/
H A Dline_series.rs11 point_idx: usize, field
20 if self.point_size > 0 && self.point_idx < self.data.len() { in next()
21 let idx = self.point_idx; in next()
22 self.point_idx += 1; in next()
43 point_idx: 0, in new()
/dports/textproc/jql/jql-3.0.6/cargo-crates/plotters-0.3.1/src/series/
H A Dline_series.rs11 point_idx: usize, field
20 if self.point_size > 0 && self.point_idx < self.data.len() { in next()
21 let idx = self.point_idx; in next()
22 self.point_idx += 1; in next()
43 point_idx: 0, in new()
/dports/graphics/pastel/pastel-0.8.1/cargo-crates/plotters-0.3.1/src/series/
H A Dline_series.rs11 point_idx: usize, field
20 if self.point_size > 0 && self.point_idx < self.data.len() { in next()
21 let idx = self.point_idx; in next()
22 self.point_idx += 1; in next()
43 point_idx: 0, in new()
/dports/benchmarks/inferno/inferno-0.10.9/cargo-crates/plotters-0.3.1/src/series/
H A Dline_series.rs11 point_idx: usize, field
20 if self.point_size > 0 && self.point_idx < self.data.len() { in next()
21 let idx = self.point_idx; in next()
22 self.point_idx += 1; in next()
43 point_idx: 0, in new()
/dports/textproc/angle-grinder/angle-grinder-0.18.0/cargo-crates/plotters-0.3.0/src/series/
H A Dline_series.rs11 point_idx: usize, field
20 if self.point_size > 0 && self.point_idx < self.data.len() { in next()
21 let idx = self.point_idx; in next()
22 self.point_idx += 1; in next()
43 point_idx: 0, in new()
/dports/graphics/librsvg2-rust/librsvg-2.52.8/vendor/plotters/src/series/
H A Dline_series.rs11 point_idx: usize, field
20 if self.point_size > 0 && self.point_idx < self.data.len() { in next()
21 let idx = self.point_idx; in next()
22 self.point_idx += 1; in next()
43 point_idx: 0, in new()
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/features/include/pcl/features/impl/
H A Dflare.hpp246 for (std::size_t point_idx = 0; point_idx < indices_->size (); ++point_idx) in computeFeature() local
249 PointOutT &rf = output[point_idx]; in computeFeature()
251 …signed_distances_from_highest_points_[point_idx] = computePointLRF ((*indices_)[point_idx], curren… in computeFeature()
252 …if (signed_distances_from_highest_points_[point_idx] == std::numeric_limits<SignedDistanceT>::max … in computeFeature()

123456