| /dports/misc/vxl/vxl-3.3.2/contrib/brl/bbas/bvgl/ |
| H A D | bvgl_k_nearest_neighbors_2d.h | 46 std::vector<unsigned> &neighbor_indices,
63 std::vector<unsigned>& neighbor_indices,
77 std::vector<unsigned>& neighbor_indices,
177 std::vector<unsigned> &neighbor_indices, in knn_indices() argument
194 std::vector<unsigned> neighbor_indices; in knn() local
204 std::vector<unsigned>& neighbor_indices, in knn() argument
220 std::vector<unsigned> neighbor_indices; in closest_util() local
226 ci = neighbor_indices[0]; in closest_util()
238 std::vector<unsigned>& neighbor_indices, in knn_util() argument
243 neighbor_indices.clear(); in knn_util()
[all …]
|
| /dports/math/py-hdbscan/hdbscan-0.8.27/hdbscan/ |
| H A D | prediction.py | 146 def _find_neighbor_and_lambda(neighbor_indices, neighbor_distances, argument
176 neighbor_core_distances = core_distances[neighbor_indices]
178 neighbor_indices.shape[0])
187 nearest_neighbor = neighbor_indices[nn_index]
196 def _extend_condensed_tree(tree, neighbor_indices, neighbor_distances, argument
392 neighbor_distances, neighbor_indices = \
400 neighbor_indices[i],
471 neighbor_distances, neighbor_indices = \
495 neighbor_indices[i],
556 neighbor_distances, neighbor_indices = \
[all …]
|
| H A D | flat.py | 338 neighbor_distances, neighbor_indices = prediction_data.tree.query(
346 neighbor_indices[i],
453 neighbor_distances, neighbor_indices = \
463 neighbor_indices[i],
|
| /dports/math/py-pynndescent/pynndescent-0.5.4/pynndescent/ |
| H A D | graph_utils.py | 168 def adjacency_matrix_representation(neighbor_indices, neighbor_distances): argument
170 (neighbor_indices.shape[0], neighbor_indices.shape[0]), dtype=np.float32
177 np.arange(neighbor_indices.shape[0], dtype=np.int32), neighbor_indices.shape[1]
179 result.col = neighbor_indices.ravel()
|
| H A D | rp_trees.py | 1229 def score_tree(tree, neighbor_indices, data, rng_state): argument
1231 for i in numba.prange(neighbor_indices.shape[0]):
1240 intersection = arr_intersect(neighbor_indices[i], leaf_indices)
1242 return result / numba.float32(neighbor_indices.shape[0])
1246 def score_linked_tree(tree, neighbor_indices): argument
1256 intersection = arr_intersect(neighbor_indices[idx], tree.indices[node])
1258 return result / numba.float32(neighbor_indices.shape[0])
|
| /dports/graphics/py-scikit-image/scikit-image-0.19.0/skimage/graph/ |
| H A D | _graph.py | 122 neighbor_indices = neighbors[neighbors_mask]
125 neighbor_indices, nodes, nodes_sequential
132 image_r[indices], image_r[neighbor_indices], neighbor_distances
|
| /dports/misc/vxl/vxl-3.3.2/contrib/brl/bbas/bpgl/algo/ |
| H A D | bpgl_heightmap_from_disparity.hxx | 239 std::vector<unsigned> neighbor_indices; in heightmap_from_pointset() local
240 if (!knn.knn(loc, max_neighbors_, neighbor_locs, neighbor_indices, max_dist)) { in heightmap_from_pointset()
243 size_t nn = neighbor_indices.size(); in heightmap_from_pointset()
248 T prob = ptset.sc(neighbor_indices[k]); in heightmap_from_pointset()
|
| H A D | bpgl_gridding.h | 302 std::vector<unsigned> neighbor_indices; variable
303 if (!knn.knn(loc, max_neighbors, neighbor_locs, neighbor_indices, max_dist)) {
308 if (neighbor_indices.size() < min_neighbors) {
315 for (auto nidx : neighbor_indices) {
|
| /dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/gpu/features/src/ |
| H A D | spinimages.cu | 104 PtrStep<int> neighbor_indices; member
129 const int *ginds = neighbor_indices.ptr (i_input); in operator ()()
286 impl.neighbor_indices = neighbours; in computeSpinImages_caller()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/source/multigrid/ |
| H A D | mg_tools.cc | 129 std::vector<types::global_dof_index> neighbor_indices; in compute_row_length_vector() local
271 neighbor_indices.resize(nfe.n_dofs_per_cell()); in compute_row_length_vector()
272 neighbor->get_mg_dof_indices(neighbor_indices); in compute_row_length_vector()
278 row_lengths[neighbor_indices[local_dof]] += fe.n_dofs_per_face(); in compute_row_length_vector()
313 std::vector<types::global_dof_index> neighbor_indices; in compute_row_length_vector() local
539 neighbor_indices.resize(nfe.n_dofs_per_cell()); in compute_row_length_vector()
540 neighbor->get_mg_dof_indices(neighbor_indices); in compute_row_length_vector()
561 row_lengths[neighbor_indices[local_dof]] += in compute_row_length_vector()
|
| /dports/misc/ompl/ompl-1.5.2/src/ompl/geometric/planners/prm/src/ |
| H A D | PRM.cpp | 125 std::vector<unsigned int> neighbor_indices; in PRM() local
126 data.getEdges(vertex_index, neighbor_indices); in PRM()
127 if (neighbor_indices.empty()) in PRM()
133 for (const unsigned int neighbor_index : neighbor_indices) in PRM()
|
| H A D | LazyPRM.cpp | 134 std::vector<unsigned int> neighbor_indices; in LazyPRM() local
135 data.getEdges(vertex_index, neighbor_indices); in LazyPRM()
136 for (const unsigned int neighbor_index : neighbor_indices) in LazyPRM()
|
| /dports/graphics/osg34/OpenSceneGraph-OpenSceneGraph-3.4.1/src/osgPlugins/bsp/ |
| H A D | VBSPData.h | 134 unsigned short neighbor_indices[4]; member
|
| /dports/graphics/osg/OpenSceneGraph-OpenSceneGraph-3.6.5/src/osgPlugins/bsp/ |
| H A D | VBSPData.h | 134 unsigned short neighbor_indices[4]; member
|