/dports/graphics/photoflow/PhotoFlow-8472024f/src/base/ |
H A D | splinecurve.cc | 197 points2[0].first = points2[0].first - 1.0f; in update_spline() 198 points2[1].first = points2[1].first - 1.0f; in update_spline() 211 points2[points2.size()-2].first += 1.0f; in update_spline() 212 points2[points2.size()-1].first += 1.0f; in update_spline() 216 points2 = points; in update_spline() 228 N = points2.size(); in update_spline() 239 …double sig = (points2[i].first - points2[i - 1].first) / (points2[i + 1].first - points2[i - 1].fi… in update_spline() 242 u[i] = ((points2[i + 1].second - points2[i].second) in update_spline() 243 …/ (points2[i + 1].first - points2[i].first) - (points2[i].second - points2[i - 1].second) / (point… in update_spline() 267 if( x <= points2[0].first ) return points2[0].second; in get_value() [all …]
|
/dports/devel/vcglib/vcglib-2020.09/vcg/space/ |
H A D | planar_polygon_tessellation.h | 55 for(size_t i = 0; i < points2.size();++i) in Intersect() 57 if( Cross(points2[cur], points2[v2],points2[i],points2[next[i]])) in Intersect() 70 for(size_t i = 0; i < points2.size(); ++i) next.push_back((i+1)%points2.size()); in TessellatePlanarPolygon2() 71 for(size_t i = 0; i < points2.size(); ++i) prev.push_back((i+points2.size()-1)%points2.size()); in TessellatePlanarPolygon2() 78 orient+= (points2[v1] - points2[0]) ^ (points2[v2] - points2[0]); in TessellatePlanarPolygon2() 83 while(output.size()<3*(points2.size()-2)){ in TessellatePlanarPolygon2() 86 if( ( (orient*((points2[v1] - points2[cur]) ^ (points2[v2] - points2[cur]))) >= 0.0) && in TessellatePlanarPolygon2() 87 !Intersect(cur, v2,next,points2)) in TessellatePlanarPolygon2() 131 std::vector<Point2<S> > points2; in TessellatePlanarPolygon3() local 134 points2.push_back(Point2<S>(p*u,p*v)); in TessellatePlanarPolygon3() [all …]
|
/dports/graphics/wdune/wdune-1.926/vcglib/vcg/space/ |
H A D | planar_polygon_tessellation.h | 55 for(size_t i = 0; i < points2.size();++i) in Intersect() 57 if( Cross(points2[cur], points2[v2],points2[i],points2[next[i]])) in Intersect() 70 for(size_t i = 0; i < points2.size(); ++i) next.push_back((i+1)%points2.size()); in TessellatePlanarPolygon2() 71 for(size_t i = 0; i < points2.size(); ++i) prev.push_back((i+points2.size()-1)%points2.size()); in TessellatePlanarPolygon2() 78 orient+= (points2[v1] - points2[0]) ^ (points2[v2] - points2[0]); in TessellatePlanarPolygon2() 83 while(output.size()<3*(points2.size()-2)){ in TessellatePlanarPolygon2() 86 if( ( (orient*((points2[v1] - points2[cur]) ^ (points2[v2] - points2[cur]))) >= 0.0) && in TessellatePlanarPolygon2() 87 !Intersect(cur, v2,next,points2)) in TessellatePlanarPolygon2() 131 std::vector<Point2<S> > points2; in TessellatePlanarPolygon3() local 134 points2.push_back(Point2<S>(p*u,p*v)); in TessellatePlanarPolygon3() [all …]
|
/dports/graphics/opencv/opencv-4.5.3/contrib/modules/xfeatures2d/src/pct_signatures/ |
H A D | distance.hpp | 76 const Mat& points2, int idx2) in distanceL0_25() argument 91 const Mat& points2, int idx2) in distanceL0_5() argument 105 const Mat& points2, int idx2) in distanceL1() argument 119 const Mat& points2, int idx2) in distanceL2() argument 133 const Mat& points2, int idx2) in distanceL2Squared() argument 147 const Mat& points2, int idx2) in distanceL5() argument 161 const Mat& points2, int idx2) in distanceLInfinity() argument 189 const Mat& points2, int idx2) in computeDistance() argument 198 return distanceL1(points1, idx1, points2, idx2); in computeDistance() 200 return distanceL2(points1, idx1, points2, idx2); in computeDistance() [all …]
|
H A D | similarity.hpp | 77 const Mat& points2, int idx2) in minusSimilarity() argument 79 return -computeDistance(distancefunction, points1, idx1, points2, idx2); in minusSimilarity() 87 const Mat& points2, int idx2) in gaussianSimilarity() argument 89 float distance = computeDistance(distancefunction, points1, idx1, points2, idx2); in gaussianSimilarity() 98 const Mat& points2, int idx2) in heuristicSimilarity() argument 100 … return 1 / (alpha + computeDistance(distancefunction, points1, idx1, points2, idx2)); in heuristicSimilarity() 110 const Mat& points2, int idx2) in computeSimilarity() argument 115 return minusSimilarity(distancefunction, points1, idx1, points2, idx2); in computeSimilarity() 117 … return gaussianSimilarity(distancefunction, similarityParameter, points1, idx1, points2, idx2); in computeSimilarity() 119 … return heuristicSimilarity(distancefunction, similarityParameter, points1, idx1, points2, idx2); in computeSimilarity()
|
/dports/misc/vxl/vxl-3.3.2/contrib/oxl/mvl/ |
H A D | FMatrixComputeLinear.cxx | 45 std::vector<HomgPoint2D> points2(matches.count()); in compute() local 46 matches.extract_matches(points1, points2); in compute() 47 return compute(points1, points2, F); in compute() 54 if (points1.size() < 8 || points2.size() < 8) { in compute() 63 HomgNorm2D conditioned2(points2); in compute() 73 compute_preconditioned(points1, points2, F); in compute() 82 if (points1.size() < 8 || points2.size() < 8) { in compute() 91 HomgNorm2D conditioned2(points2); in compute() 101 compute_preconditioned(points1, points2, F); in compute() 112 FDesignMatrix design(points1, points2); in compute_preconditioned() [all …]
|
H A D | FMatrixCompute.cxx | 43 std::vector<HomgPoint2D> points2(matches.count()); in compute() local 44 matches.extract_matches(points1, points2); in compute() 45 return compute(points1, points2, F_out); in compute() 49 std::vector<vgl_homg_point_2d<double> >& points2, in compute() 52 if (points1.size() != points2.size()) in compute() 54 assert(points1.size() <= points2.size()); in compute() 56 HomgInterestPointSet p2(points2,nullptr); in compute() 68 std::vector<HomgPoint2D>& points2, in compute() argument 71 if (points1.size() != points2.size()) in compute() 73 assert(points1.size() <= points2.size()); in compute() [all …]
|
H A D | FMPlanarComputeNonLinear.cxx | 32 return compute_planar(inliers.points1, inliers.points2, F); in compute_planar() 37 std::vector<HomgPoint2D>& points2, in compute_planar() argument 41 …narNonLinFun computor(image_metric1_, image_metric2_, outlier_distance_squared_, points1, points2); in compute_planar() 47 std::vector<vgl_homg_point_2d<double> >& points2, in compute_planar() 51 …narNonLinFun computor(image_metric1_, image_metric2_, outlier_distance_squared_, points1, points2); in compute_planar() 68 std::vector<HomgPoint2D>& points2, in compute() argument 73 if (!compute_planar(points1, points2, &fplanar)) in compute() 82 std::vector<vgl_homg_point_2d<double> >& points2, in compute() 87 if (!compute_planar(points1, points2, fplanar)) in compute()
|
H A D | HMatrix1DCompute3Point.cxx | 44 const std::vector<vgl_homg_point_1d<double> >& points2, in compute_cool_homg() 48 assert(points2.size() == 3); in compute_cool_homg() 54 points2[0].x() , points2[1].x() , points2[2].x(), in compute_cool_homg() 55 points2[0].w() , points2[1].w() , points2[2].w()); in compute_cool_homg()
|
H A D | FMatrixCompute7Point.cxx | 42 std::vector<HomgPoint2D> points2(matches.count()); in compute() local 43 matches.extract_matches(points1, points2); in compute() 44 return compute(points1, points2, F); in compute() 50 std::vector<vgl_homg_point_2d<double>> &points2, in compute() argument 52 if (points1.size() < 7 || points2.size() < 7) { in compute() 61 HomgNorm2D conditioned2(points2); in compute() 77 if (!compute_preconditioned(points1, points2, F)) in compute() 87 if (points1.size() < 7 || points2.size() < 7) { in compute() 96 HomgNorm2D conditioned2(points2); in compute() 121 FDesignMatrix design(points1, points2); in compute_preconditioned() [all …]
|
/dports/misc/vxl/vxl-3.3.2/core/vgl/algo/tests/ |
H A D | test_h_matrix_1d.cxx | 85 points2.push_back(p20); in test_compute_svd() 86 points2.push_back(p21); in test_compute_svd() 87 points2.push_back(p22); in test_compute_svd() 88 points2.push_back(p23); in test_compute_svd() 112 points2.push_back(p20); in test_compute_linear() 113 points2.push_back(p21); in test_compute_linear() 114 points2.push_back(p22); in test_compute_linear() 115 points2.push_back(p23); in test_compute_linear() 142 points2.push_back(p20); in test_compute_3point() 143 points2.push_back(p21); in test_compute_3point() [all …]
|
H A D | test_compute_rigid_3d.cxx | 41 …nst std::vector<vgl_point_3d<double>> & points1, const std::vector<vgl_point_3d<double>> & points2) in alignment_error() argument 46 error += (points1[i] - points2[i]).sqr_length(); in alignment_error() 66 …std::vector<vgl_point_3d<double>> points2 = vgl_test_compute_rigid_3d::transform_points(points1, R… in test_compute_rigid_3d() local 68 vgl_compute_rigid_3d<double> est_sim(points1, points2); in test_compute_rigid_3d() 75 …t_compute_rigid_3d::transform_points(points1, est_sim.rotation(), est_sim.translation()), points2), in test_compute_rigid_3d() 82 vgl_test_compute_rigid_3d::add_noise(points2, sigma); in test_compute_rigid_3d() 84 vgl_compute_rigid_3d<double> est_sim2(points1, points2); in test_compute_rigid_3d() 92 …compute_rigid_3d::transform_points(points1, est_sim2.rotation(), est_sim2.translation()), points2), in test_compute_rigid_3d()
|
H A D | test_compute_similarity_3d.cxx | 41 …nst std::vector<vgl_point_3d<double>> & points1, const std::vector<vgl_point_3d<double>> & points2) in alignment_error() argument 46 error += (points1[i] - points2[i]).sqr_length(); in alignment_error() 67 std::vector<vgl_point_3d<double>> points2 = transform_points(points1, s, R, t); in test_compute_similarity_3d() local 69 vgl_compute_similarity_3d<double> est_sim(points1, points2); in test_compute_similarity_3d() 77 …or(transform_points(points1, est_sim.scale(), est_sim.rotation(), est_sim.translation()), points2), in test_compute_similarity_3d() 84 add_noise(points2, sigma); in test_compute_similarity_3d() 86 vgl_compute_similarity_3d<double> est_sim2(points1, points2); in test_compute_similarity_3d() 94 …transform_points(points1, est_sim2.scale(), est_sim2.rotation(), est_sim2.translation()), points2), in test_compute_similarity_3d()
|
/dports/math/cgal/CGAL-5.3/examples/Arrangement_on_surface_2/ |
H A D | polylines.cpp | 48 std::list<Point_2> points2; in main() local 49 points2.push_back(Point_2(1, 3)); in main() 50 points2.push_back(Point_2(0, 2)); in main() 51 points2.push_back(Point_2(1, 0)); in main() 52 points2.push_back(Point_2(2, 1)); in main() 53 points2.push_back(Point_2(3, 0)); in main() 54 points2.push_back(Point_2(4, 1)); in main() 55 points2.push_back(Point_2(5, 0)); in main() 56 points2.push_back(Point_2(6, 2)); in main() 57 points2.push_back(Point_2(5, 3)); in main() [all …]
|
/dports/math/ngraph/Ngraph-6.3.54-src/src/ |
H A D | oline.c | 121 int *points2; in arrowdraw() local 167 x0=points2[0]; in arrowdraw() 168 y0=points2[1]; in arrowdraw() 169 x1=points2[2]; in arrowdraw() 170 y1=points2[3]; in arrowdraw() 209 x=points2[0]; in arrowdraw() 210 y=points2[1]; in arrowdraw() 244 int *points2; in arrowbbox() local 277 x0=points2[0]; in arrowbbox() 278 y0=points2[1]; in arrowbbox() [all …]
|
/dports/graphics/p5-Geo-GDAL/gdal-3.3.3/swig/perl/t/ |
H A D | geom.t | 13 my $points2 = $geom->Points; 14 ok(is_deeply($points, $points2), "Set and get points of a $type"); 28 my $points2 = $geom1->Points; 37 my $points2 = $geom->Points; 38 ok(is_deeply($points, $points2), "Set and get points of a $type"); 46 my $points2 = $geom->Points; 47 ok(is_deeply($points, $points2), "Set and get points of a $type"); 55 my $points2 = $geom->Points; 56 ok(is_deeply($points, $points2), "Set and get points of a $type"); 64 my $points2 = $geom->Points; [all …]
|
/dports/graphics/gdal/gdal-3.3.3/swig/perl/t/ |
H A D | geom.t | 13 my $points2 = $geom->Points; 14 ok(is_deeply($points, $points2), "Set and get points of a $type"); 28 my $points2 = $geom1->Points; 37 my $points2 = $geom->Points; 38 ok(is_deeply($points, $points2), "Set and get points of a $type"); 46 my $points2 = $geom->Points; 47 ok(is_deeply($points, $points2), "Set and get points of a $type"); 55 my $points2 = $geom->Points; 56 ok(is_deeply($points, $points2), "Set and get points of a $type"); 64 my $points2 = $geom->Points; [all …]
|
/dports/graphics/py-gdal/gdal-3.3.3/swig/perl/t/ |
H A D | geom.t | 13 my $points2 = $geom->Points; 14 ok(is_deeply($points, $points2), "Set and get points of a $type"); 28 my $points2 = $geom1->Points; 37 my $points2 = $geom->Points; 38 ok(is_deeply($points, $points2), "Set and get points of a $type"); 46 my $points2 = $geom->Points; 47 ok(is_deeply($points, $points2), "Set and get points of a $type"); 55 my $points2 = $geom->Points; 56 ok(is_deeply($points, $points2), "Set and get points of a $type"); 64 my $points2 = $geom->Points; [all …]
|
/dports/misc/vxl/vxl-3.3.2/contrib/mul/msm/tests/ |
H A D | test_aligners.cxx | 49 msm_points points2; in test_generic_aligner() local 50 aligner.apply_transform(points1,inv_pose0,points2); in test_generic_aligner() 99 TEST("Composition",points2==points3,true); in test_generic_aligner() 189 msm_points points2; in test_zoom_aligner() local 272 msm_points points2; in test_similarity_aligner() local 278 aligner.apply_transform(points0,pose1,points2); in test_similarity_aligner() 295 aligner.apply_transform(points0,pose1,points2); in test_similarity_aligner() 318 points2.vector()),1.0,1e-6); in test_similarity_aligner() 347 msm_points points2; in test_affine_aligner() local 348 aligner.apply_transform(points0,pose1,points2); in test_affine_aligner() [all …]
|
/dports/misc/vxl/vxl-3.3.2/contrib/oxl/mvl/examples/ |
H A D | compute_FMatrix_example.cxx | 21 std::vector<vgl_homg_point_2d<double> > points2; in main() local 29 points2.emplace_back(x,y,w); in main() 36 FMatrix f = computor.compute(points1, points2); in main() 43 d += f.image1_epipolar_distance_squared(points1[i], points2[i]); in main() 52 computor.compute(points1, points2, l); in main() 59 d += f.image1_epipolar_distance_squared(points1[i], points2[i]); in main() 66 FMatrix f = computor.compute(points1, points2); in main() 73 d += f.image1_epipolar_distance_squared(points1[i], points2[i]); in main() 80 FMatrix f = computor.compute(points1, points2); in main() 87 d += f.image1_epipolar_distance_squared(points1[i], points2[i]); in main() [all …]
|
/dports/misc/valentina/valentina-5b7e98bf48a86e3c444423a9f03533440a39aad9/src/test/ValentinaTest/ |
H A D | tst_findpoint.cpp | 55 QVector<QPointF> points2; in TestPointOfIntersectionCurves_data() local 68 points2.clear(); in TestPointOfIntersectionCurves_data() 69 points2.append(QPointF(30, 10)); in TestPointOfIntersectionCurves_data() 70 points2.append(QPointF(25, 20)); in TestPointOfIntersectionCurves_data() 71 points2.append(QPointF(30, 30)); in TestPointOfIntersectionCurves_data() 79 points2.clear(); in TestPointOfIntersectionCurves_data() 80 points2.append(QPointF(30, 10)); in TestPointOfIntersectionCurves_data() 81 points2.append(QPointF(20, 20)); in TestPointOfIntersectionCurves_data() 82 points2.append(QPointF(30, 30)); in TestPointOfIntersectionCurves_data() 92 points2.clear(); in TestPointOfIntersectionCurves_data() [all …]
|
/dports/graphics/colmap/colmap-3.6/src/estimators/ |
H A D | translation_transform.h | 64 const std::vector<Y_t>& points2); 73 const std::vector<Y_t>& points2, const M_t& translation, 84 const std::vector<Y_t>& points2) { in Estimate() argument 85 CHECK_EQ(points1.size(), points2.size()); in Estimate() 92 mean_dst += points2[i]; in Estimate() 96 mean_dst /= points2.size(); in Estimate() 106 const std::vector<X_t>& points1, const std::vector<Y_t>& points2, in Residuals() argument 108 CHECK_EQ(points1.size(), points2.size()); in Residuals() 113 const M_t diff = points2[i] - points1[i] - translation; in Residuals()
|
/dports/misc/vxl/vxl-3.3.2/core/vgl/algo/ |
H A D | vgl_h_matrix_1d_compute_3point.cxx | 52 … const std::vector<vgl_homg_point_1d<double>> & points2, in compute_cool_homg() argument 56 assert(points2.size() == 3); in compute_cool_homg() 66 points2[0].x(), in compute_cool_homg() 67 points2[1].x(), in compute_cool_homg() 68 points2[2].x(), in compute_cool_homg() 69 points2[0].w(), in compute_cool_homg() 70 points2[1].w(), in compute_cool_homg() 71 points2[2].w()); in compute_cool_homg()
|
/dports/math/apache-commons-math/commons-math3-3.6.1-src/src/test/java/org/apache/commons/math3/distribution/ |
H A D | TriangularDistributionTest.java | 101 double[] points2 = new double[points.length-2]; in makeInverseCumulativeTestPoints() local 102 System.arraycopy(points, 1, points2, 0, points2.length); in makeInverseCumulativeTestPoints() 103 return points2; in makeInverseCumulativeTestPoints() 117 double[] points2 = new double[points.length-2]; in makeInverseCumulativeTestValues() local 118 System.arraycopy(points, 1, points2, 0, points2.length); in makeInverseCumulativeTestValues() 119 return points2; in makeInverseCumulativeTestValues()
|
/dports/science/py-qcelemental/qcelemental-0.24.0/qcelemental/util/ |
H A D | misc.py | 186 def compute_distance(points1, points2) -> np.ndarray: argument 214 points2 = np.atleast_2d(points2) 216 return _norm(points1 - points2) 219 def compute_angle(points1, points2, points3, *, degrees: bool = False) -> np.ndarray: argument 245 points2 = np.atleast_2d(points2) 248 v12 = points1 - points2 249 v23 = points2 - points3 262 def compute_dihedral(points1, points2, points3, points4, *, degrees: bool = False) -> np.ndarray: argument 292 points2 = np.atleast_2d(points2) 297 v1 = -1.0 * (points2 - points1) [all …]
|