/dports/math/cgal/CGAL-5.3/include/CGAL/internal/Surface_mesh_segmentation/ |
H A D | K_means_clustering.h | 324 for(std::vector<K_means_point>::iterator point_it = points.begin(); in fill_with_center_ids() local 325 point_it != points.end(); ++point_it) { in fill_with_center_ids() 326 point_it->calculate_new_center(centers); // find closest center in fill_with_center_ids() 327 data_centers.push_back(point_it->center_id); in fill_with_center_ids() 366 for(std::vector<K_means_point>::iterator point_it = points.begin(); in iterate() local 367 point_it != points.end(); ++point_it) { in iterate() 368 bool center_changed = point_it->calculate_new_center(centers); in iterate() 423 for(std::vector<K_means_point>::const_iterator point_it = points.begin(); in within_cluster_sum_of_squares() local 424 point_it != points.end(); ++point_it) { in within_cluster_sum_of_squares() 425 sum += CGAL::square(centers[point_it->center_id].mean - point_it->data); in within_cluster_sum_of_squares()
|
H A D | Expectation_maximization.h | 172 for(std::vector<double>::iterator point_it = points.begin(); in fill_with_center_ids() local 173 point_it != points.end(); ++point_it) { in fill_with_center_ids() 179 double likelihood = center_it->probability_with_coef(*point_it); in fill_with_center_ids()
|
/dports/cad/cura-engine/CuraEngine-fadb5d6b/src/utils/ |
H A D | PolygonProximityLinker.cpp | 85 ListPolyIt point_it(poly, it); in createLineGrid() local 86 line_grid.insert(point_it); in createLineGrid() 100 ListPolyIt point_it(poly, it); in findProximatePoints() local 101 if (new_points.find(point_it) == new_points.end()) in findProximatePoints() 120 line_grid.processNearby(point_it.p(), proximity_distance, process_func); in findProximatePoints() 123 … findProximatePoints(point_it, *nearby_line.poly, nearby_line, nearby_line.next()); in findProximatePoints()
|
/dports/math/cgal/CGAL-5.3/include/CGAL/ |
H A D | Arr_algebraic_segment_traits_2.h | 340 Point_2 point_it; in x_monotone_segment() local 344 point_it = left(*it_seg_p); in x_monotone_segment() 352 while (! on_arc(point_it, *it_seg_p)) { in x_monotone_segment() 369 Point_2 point_it; in x_monotone_segment() local 374 point_it=right(*it_seg_p); in x_monotone_segment() 382 while(! on_arc(point_it, *it_seg_p)) { in x_monotone_segment()
|
H A D | convex_hull_3.h | 591 typename std::list<Point>::iterator point_it, to_splice; 603 for (point_it = vis_outside_set.begin();point_it != vis_outside_set.end();){ 604 if( is_on_positive_side(*point_it) ) { 605 to_splice = point_it; 606 ++point_it; 609 ++point_it; 734 for (P3_iterator point_it = points.begin() ; point_it != points.end(); ) 736 if( is_on_positive_side(*point_it) ) { 737 P3_iterator to_splice = point_it; 738 ++point_it; [all …]
|
H A D | Min_annulus_d.h | 721 Point_iterator point_it = points_begin(); in is_valid() local 722 for ( ; point_it != points_end(); ++point_it) { in is_valid() 723 if ( has_on_unbounded_side( *point_it)) in is_valid()
|
/dports/math/dune-vtk/dune-vtk-38f79c23ef8f29210d41353a8380e42b78422f2f/dune/vtk/ |
H A D | vtkreader.hh | 126 auto point_it = pointData_.find("PointData." + name); in getPointData() local 127 VTK_ASSERT_MSG(data_it != dataArray_.end() && point_it != pointData_.end(), in getPointData() 131 return {*creator_, point_it->second, data_it->second.name, data_it->second.components, in getPointData()
|
/dports/graphics/inkscape/inkscape-1.1_2021-05-24_c4e8f9ed74/src/live_effects/parameter/ |
H A D | powerstrokepointarray.cpp | 58 for (auto point_it : _vector) in param_transform_multiply() local 61 Geom::Coord const A = point_it[Geom::Y] * postmul.descrim(); in param_transform_multiply() 62 result.emplace_back(point_it[Geom::X], A); in param_transform_multiply()
|
/dports/graphics/py-pyproj/pyproj-3.2.1/pyproj/ |
H A D | transformer.py | 823 point_it = iter(points) # point iterator 826 fst_pt = next(point_it) 840 fst_pt, (coords[c] for coords in point_it for c in range(stride))
|
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/recognition/include/pcl/recognition/impl/ |
H A D | implicit_shape_model.hpp | 1187 for (auto point_it = in_cloud->points.begin (); point_it != in_cloud->points.end (); point_it++) in shiftCloud() local 1189 point_it->x -= shift_point.x (); in shiftCloud() 1190 point_it->y -= shift_point.y (); in shiftCloud() 1191 point_it->z -= shift_point.z (); in shiftCloud()
|
/dports/misc/openmvg/openMVG-2.0/src/software/SfM/clustering/domSetLibrary/ |
H A D | domset.cc | 39 for (const auto & point_it : points) in normalizePointCloud() local 40 points_cpy.push_back(point_it.pos); in normalizePointCloud()
|
/dports/graphics/qgis/qgis-3.22.3/src/core/ |
H A D | qgsogcutils.cpp | 232 QgsPolylineXY::const_iterator point_it = pointCoordinate.constBegin(); in geometryFromGMLPoint() local 234 double x = point_it->x(); in geometryFromGMLPoint() 235 double y = point_it->y(); in geometryFromGMLPoint()
|
/dports/graphics/qgis-ltr/qgis-3.16.16/src/core/ |
H A D | qgsogcutils.cpp | 230 QgsPolylineXY::const_iterator point_it = pointCoordinate.constBegin(); in geometryFromGMLPoint() local 232 double x = point_it->x(); in geometryFromGMLPoint() 233 double y = point_it->y(); in geometryFromGMLPoint()
|
/dports/games/cataclysm-dda-tiles/Cataclysm-DDA-0.F/src/ |
H A D | iuse.cpp | 7491 for( std::vector<tripoint>::iterator point_it = trajectory.begin(); in camera() local 7492 point_it != trajectory.end(); in camera() 7493 ++point_it ) { in camera() 7494 const tripoint trajectory_point = *point_it; in camera() 7495 if( point_it != trajectory.end() ) { in camera() 7496 … const tripoint next_point = *( point_it + 1 ); // Trajectory ends on last visible tile in camera()
|
/dports/games/cataclysm-dda/Cataclysm-DDA-0.F/src/ |
H A D | iuse.cpp | 7491 for( std::vector<tripoint>::iterator point_it = trajectory.begin(); in camera() local 7492 point_it != trajectory.end(); in camera() 7493 ++point_it ) { in camera() 7494 const tripoint trajectory_point = *point_it; in camera() 7495 if( point_it != trajectory.end() ) { in camera() 7496 … const tripoint next_point = *( point_it + 1 ); // Trajectory ends on last visible tile in camera()
|