/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/features/include/pcl/features/impl/ |
H A D | esf.hpp | 88 for (std::size_t nn_idx = 0; nn_idx < sample_size; ++nn_idx) in computeESF() local 97 nn_idx--; in computeESF() 112 nn_idx--; in computeESF() 126 nn_idx--; in computeESF() 131 nn_idx--; in computeESF() 136 nn_idx--; in computeESF() 219 for (std::size_t nn_idx = 0; nn_idx < sample_size; ++nn_idx) in computeESF() local 223 maxd2 = d2v[nn_idx]; in computeESF() 229 maxd3 = d3v[nn_idx]; in computeESF() 234 for (std::size_t nn_idx = 0; nn_idx < sample_size; ++nn_idx) in computeESF() local [all …]
|
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/kdtree/include/pcl/kdtree/impl/ |
H A D | io.hpp | 55 Indices nn_idx (1); in getApproximateIndices() local 60 tree.nearestKSearchT ((*cloud_in)[i], 1, nn_idx, nn_dists); in getApproximateIndices() 61 indices[i] = nn_idx[0]; in getApproximateIndices() 75 Indices nn_idx (1); in getApproximateIndices() local 80 tree.nearestKSearch (*cloud_in, i, 1, nn_idx, nn_dists); in getApproximateIndices() 81 indices[i] = nn_idx[0]; in getApproximateIndices()
|
/dports/math/geogram/geogram-1.7.7/src/tests/test_nn_search/third_party/ANN/ |
H A D | brute.cpp | 57 ANNidxArray nn_idx, // nearest neighbor indices (returned) in annkSearch() argument 76 nn_idx[i] = mk.ith_smallest_info(i); in annkSearch() 84 ANNidxArray nn_idx, // nearest neighbor array (returned) in annkFRSearch() argument 104 if (nn_idx != NULL) in annkFRSearch() 105 nn_idx[i] = mk.ith_smallest_info(i); in annkFRSearch()
|
H A D | ANN.h | 537 ANNidxArray nn_idx, // nearest neighbor array (modified) 546 ANNidxArray nn_idx = NULL, // nearest neighbor array (modified) 592 ANNidxArray nn_idx, // nearest neighbor array (modified) 600 ANNidxArray nn_idx = NULL, // nearest neighbor array (modified) 783 ANNidxArray nn_idx, // nearest neighbor array (modified) 790 ANNidxArray nn_idx, // nearest neighbor array (modified) 798 ANNidxArray nn_idx = NULL, // nearest neighbor array (modified)
|
H A D | kd_fix_rad_search.cpp | 48 ANNidxArray nn_idx, // nearest neighbor indices (returned) in annkFRSearch() argument 74 if (nn_idx != NULL) in annkFRSearch() 75 nn_idx[i] = params.ANNkdFRPointMK->ith_smallest_info(i); in annkFRSearch()
|
/dports/graphics/autopano-sift-c/autopano-sift-C-2.5.1/APSCpp/ANN/ |
H A D | brute.cpp | 57 ANNidxArray nn_idx, // nearest neighbor indices (returned) in annkSearch() argument 76 nn_idx[i] = mk.ith_smallest_info(i); in annkSearch() 84 ANNidxArray nn_idx, // nearest neighbor array (returned) in annkFRSearch() argument 104 if (nn_idx != NULL) in annkFRSearch() 105 nn_idx[i] = mk.ith_smallest_info(i); in annkFRSearch()
|
H A D | ANN.h | 504 ANNidxArray nn_idx, // nearest neighbor array (modified) 513 ANNidxArray nn_idx = NULL, // nearest neighbor array (modified) 559 ANNidxArray nn_idx, // nearest neighbor array (modified) 567 ANNidxArray nn_idx = NULL, // nearest neighbor array (modified) 750 ANNidxArray nn_idx, // nearest neighbor array (modified) 757 ANNidxArray nn_idx, // nearest neighbor array (modified) 765 ANNidxArray nn_idx = NULL, // nearest neighbor array (modified)
|
H A D | kd_fix_rad_search.cpp | 62 ANNidxArray nn_idx, // nearest neighbor indices (returned) in annkFRSearch() argument 83 if (nn_idx != NULL) in annkFRSearch() 84 nn_idx[i] = ANNkdFRPointMK->ith_smallest_info(i); in annkFRSearch()
|
H A D | kd_search.cpp | 92 ANNidxArray nn_idx, // nearest neighbor indices (returned) in annkSearch() argument 115 nn_idx[i] = ANNkdPointMK->ith_smallest_info(i); in annkSearch()
|
/dports/math/ann/ann_1.1.2/src/ |
H A D | brute.cpp | 57 ANNidxArray nn_idx, // nearest neighbor indices (returned) in annkSearch() argument 76 nn_idx[i] = mk.ith_smallest_info(i); in annkSearch() 84 ANNidxArray nn_idx, // nearest neighbor array (returned) in annkFRSearch() argument 104 if (nn_idx != NULL) in annkFRSearch() 105 nn_idx[i] = mk.ith_smallest_info(i); in annkFRSearch()
|
H A D | kd_fix_rad_search.cpp | 62 ANNidxArray nn_idx, // nearest neighbor indices (returned) in annkFRSearch() argument 83 if (nn_idx != NULL) in annkFRSearch() 84 nn_idx[i] = ANNkdFRPointMK->ith_smallest_info(i); in annkFRSearch()
|
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/ANN/src/ |
H A D | brute.cpp | 57 ANNidxArray nn_idx, // nearest neighbor indices (returned) in annkSearch() argument 76 nn_idx[i] = mk.ith_smallest_info(i); in annkSearch() 84 ANNidxArray nn_idx, // nearest neighbor array (returned) in annkFRSearch() argument 104 if (nn_idx != NULL) in annkFRSearch() 105 nn_idx[i] = mk.ith_smallest_info(i); in annkFRSearch()
|
H A D | kd_fix_rad_search.cpp | 62 ANNidxArray nn_idx, // nearest neighbor indices (returned) in annkFRSearch() argument 83 if (nn_idx != NULL) in annkFRSearch() 84 nn_idx[i] = ANNkdFRPointMK->ith_smallest_info(i); in annkFRSearch()
|
/dports/cad/meshlab/meshlab-Meshlab-2020.05/src/plugins_unsupported/external/ann_1.1.1/src/ |
H A D | brute.cpp | 57 ANNidxArray nn_idx, // nearest neighbor indices (returned) in annkSearch() argument 76 nn_idx[i] = mk.ith_smallest_info(i); in annkSearch() 84 ANNidxArray nn_idx, // nearest neighbor array (returned) in annkFRSearch() argument 104 if (nn_idx != NULL) in annkFRSearch() 105 nn_idx[i] = mk.ith_smallest_info(i); in annkFRSearch()
|
H A D | kd_fix_rad_search.cpp | 62 ANNidxArray nn_idx, // nearest neighbor indices (returned) in annkFRSearch() argument 83 if (nn_idx != NULL) in annkFRSearch() 84 nn_idx[i] = ANNkdFRPointMK->ith_smallest_info(i); in annkFRSearch()
|
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/queso/src/contrib/ANN/src/ |
H A D | brute.cpp | 57 ANNidxArray nn_idx, // nearest neighbor indices (returned) in annkSearch() argument 76 nn_idx[i] = mk.ith_smallest_info(i); in annkSearch() 84 ANNidxArray nn_idx, // nearest neighbor array (returned) in annkFRSearch() argument 104 if (nn_idx != NULL) in annkFRSearch() 105 nn_idx[i] = mk.ith_smallest_info(i); in annkFRSearch()
|
H A D | kd_fix_rad_search.cpp | 62 ANNidxArray nn_idx, // nearest neighbor indices (returned) in annkFRSearch() argument 83 if (nn_idx != NULL) in annkFRSearch() 84 nn_idx[i] = ANNkdFRPointMK->ith_smallest_info(i); in annkFRSearch()
|
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/approxnn/src/ |
H A D | brute.cpp | 57 ANNidxArray nn_idx, // nearest neighbor indices (returned) in annkSearch() argument 76 nn_idx[i] = mk.ith_smallest_info(i); in annkSearch() 84 ANNidxArray nn_idx, // nearest neighbor array (returned) in annkFRSearch() argument 104 if (nn_idx != NULL) in annkFRSearch() 105 nn_idx[i] = mk.ith_smallest_info(i); in annkFRSearch()
|
H A D | kd_fix_rad_search.cpp | 62 ANNidxArray nn_idx, // nearest neighbor indices (returned) in annkFRSearch() argument 83 if (nn_idx != NULL) in annkFRSearch() 84 nn_idx[i] = ANNkdFRPointMK->ith_smallest_info(i); in annkFRSearch()
|
/dports/math/ann/ann_1.1.2/include/ANN/ |
H A D | ANN.h | 498 ANNidxArray nn_idx, // nearest neighbor array (modified) 507 ANNidxArray nn_idx = NULL, // nearest neighbor array (modified) 553 ANNidxArray nn_idx, // nearest neighbor array (modified) 561 ANNidxArray nn_idx = NULL, // nearest neighbor array (modified) 744 ANNidxArray nn_idx, // nearest neighbor array (modified) 751 ANNidxArray nn_idx, // nearest neighbor array (modified) 759 ANNidxArray nn_idx = NULL, // nearest neighbor array (modified)
|
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/ANN/include/ANN/ |
H A D | ANN.h | 497 ANNidxArray nn_idx, // nearest neighbor array (modified) 506 ANNidxArray nn_idx = NULL, // nearest neighbor array (modified) 552 ANNidxArray nn_idx, // nearest neighbor array (modified) 560 ANNidxArray nn_idx = NULL, // nearest neighbor array (modified) 743 ANNidxArray nn_idx, // nearest neighbor array (modified) 750 ANNidxArray nn_idx, // nearest neighbor array (modified) 758 ANNidxArray nn_idx = NULL, // nearest neighbor array (modified)
|
/dports/cad/meshlab/meshlab-Meshlab-2020.05/src/plugins_unsupported/external/ann_1.1.1/include/ANN/ |
H A D | ANN.h | 494 ANNidxArray nn_idx, // nearest neighbor array (modified) 503 ANNidxArray nn_idx = NULL, // nearest neighbor array (modified) 549 ANNidxArray nn_idx, // nearest neighbor array (modified) 557 ANNidxArray nn_idx = NULL, // nearest neighbor array (modified) 740 ANNidxArray nn_idx, // nearest neighbor array (modified) 747 ANNidxArray nn_idx, // nearest neighbor array (modified) 755 ANNidxArray nn_idx = NULL, // nearest neighbor array (modified)
|
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/queso/src/contrib/ANN/include/ANN/ |
H A D | ANN.h | 498 ANNidxArray nn_idx, // nearest neighbor array (modified) 507 ANNidxArray nn_idx = NULL, // nearest neighbor array (modified) 553 ANNidxArray nn_idx, // nearest neighbor array (modified) 561 ANNidxArray nn_idx = NULL, // nearest neighbor array (modified) 744 ANNidxArray nn_idx, // nearest neighbor array (modified) 751 ANNidxArray nn_idx, // nearest neighbor array (modified) 759 ANNidxArray nn_idx = NULL, // nearest neighbor array (modified)
|
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/approxnn/include/ANN/ |
H A D | ANN.h | 523 ANNidxArray nn_idx, // nearest neighbor array (modified) 532 ANNidxArray nn_idx = NULL, // nearest neighbor array (modified) 578 ANNidxArray nn_idx, // nearest neighbor array (modified) 586 ANNidxArray nn_idx = NULL, // nearest neighbor array (modified) 769 ANNidxArray nn_idx, // nearest neighbor array (modified) 776 ANNidxArray nn_idx, // nearest neighbor array (modified) 784 ANNidxArray nn_idx = NULL, // nearest neighbor array (modified)
|
/dports/math/octave-forge-mvn/mvn/inst/ |
H A D | mvn_knnclass.m | 30 [~, nn_idx] = sort(D(i, :)); 35 if (cl_filter(nn_idx(j)) ~= cl_filter(i)) 37 if (cl_assig(nn_idx(j)) == cl_assig(i)) 48 if (cl_assig(nn_idx(k)) == cl_assig(i))
|