| /dports/astro/astrometry/astrometry.net-0.85/include/astrometry/ |
| H A D | kdtree.h | 168 struct kdtree { struct
172 u32 treetype;
174 int32_t* lr; /* Points owned by leaf nodes, stored and manipulated
178 u32* perm; /* Permutation index / hairstyle from the 80s
184 union {
190 } bb;
192 int n_bb;
195 union {
220 /* Should the kdtree free(kd->data) when kdtree_free(kd) is called? argument
247 struct kdtree_funcs fun; argument
[all …]
|
| /dports/astro/stellarsolver/stellarsolver-1.8/stellarsolver/astrometry/include/astrometry/ |
| H A D | kdtree.h | 168 struct kdtree { struct
172 u32 treetype;
174 int32_t* lr; /* Points owned by leaf nodes, stored and manipulated
178 u32* perm; /* Permutation index / hairstyle from the 80s
184 union {
190 } bb;
192 int n_bb;
195 union {
220 /* Should the kdtree free(kd->data) when kdtree_free(kd) is called? argument
247 struct kdtree_funcs fun; argument
[all …]
|
| /dports/databases/grass7/grass-7.8.6/lib/btree2/ |
| H A D | kdtree.h | 80 struct kdtree struct
95 struct kdtree *tree; /*!< tree being traversed */ argument
|
| /dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/test/search/ |
| H A D | test_kdtree.cpp | 74 pcl::search::KdTree<PointXYZ> kdtree; in TEST() local
117 pcl::search::KdTree<PointXYZ> kdtree; in TEST() local
131 pcl::search::KdTree<PointXYZ> kdtree; in TEST() local
173 pcl::search::KdTree<PointXYZ> kdtree; in TEST() local
205 pcl::search::KdTree<PointXYZ> kdtree; in main() local
|
| /dports/science/chrono/chrono-7.0.1/src/chrono_sensor/utils/ |
| H A D | Kdtree.h | 46 struct kdtree { struct
52 struct kdtree* tree; argument
|
| /dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/test/kdtree/ |
| H A D | test_kdtree.cpp | 94 KdTreeFLANN<MyPoint> kdtree; in TEST() local
126 KdTreeFLANN<MyPoint> kdtree; in TEST() local
137 KdTreeFLANN<MyPoint> kdtree; in TEST() local
149 KdTreeFLANN<MyPoint> kdtree (false); in TEST() local
163 KdTreeFLANN<MyPoint> kdtree; in TEST() local
203 KdTreeFLANN<MyPoint> kdtree; in TEST() local
240 KdTreeFLANN<MyPoint> kdtree; in TEST() local
|
| /dports/math/nanoflann/nanoflann-1.3.2/tests/ |
| H A D | test_main.cpp | 384 TEST(kdtree,L2_vs_L2_simple) in TEST() argument
393 TEST(kdtree,robust_empty_tree) in TEST() argument
424 TEST(kdtree,L2_vs_bruteforce) in TEST() argument
439 TEST(kdtree,SO3_vs_bruteforce) in TEST() argument
454 TEST(kdtree,SO2_vs_bruteforce) in TEST() argument
469 TEST(kdtree,L2_dynamic_vs_bruteforce) in TEST() argument
484 TEST(kdtree,robust_nonempty_tree) in TEST() argument
|
| /dports/audio/libmysofa/libmysofa-1.2.1-16-g52590e1/src/hrtf/ |
| H A D | kdtree.c | 50 struct kdtree { struct
66 struct kdtree *kd_create() { in kd_create() argument
|
| /dports/www/grafana8/grafana-8.3.6/vendor/gonum.org/v1/gonum/spatial/kdtree/ |
| H A D | doc.go | 8 package kdtree // import "gonum.org/v1/gonum/spatial/kdtree" package
|
| /dports/devel/vcglib/vcglib-2020.09/vcg/complex/algorithms/ |
| H A D | cut_tree.h | 60 void OptimizeTree(KdTree<ScalarType> &kdtree, MeshType &t) in OptimizeTree()
88 bool ExistEdge(KdTree<ScalarType> &kdtree, CoordType &p0, CoordType &p1, PosType &fpos) in ExistEdge()
130 bool IsBoundaryVertexOnBase(KdTree<ScalarType> &kdtree, const CoordType &p) in IsBoundaryVertexOnBase()
146 void Retract(KdTree<ScalarType> &kdtree, MeshType &t) in Retract()
|
| /dports/cad/gmsh/gmsh-4.9.2-source/Geo/ |
| H A D | closestPoint.h | 20 ANNkd_tree *kdtree; variable
|
| H A D | closestVertex.h | 28 ANNkd_tree *kdtree; variable
|
| /dports/cad/gmsh/gmsh-4.9.2-source/Mesh/ |
| H A D | meshGRegionCarveHole.cpp | 30 void carveHole(std::vector<T *> &elements, double distance, ANNkd_tree *kdtree) in carveHole()
101 ANNkd_tree *kdtree = new ANNkd_tree(kdnodes, numnodes, 3); in carveHole() local
|
| /dports/graphics/open3d/Open3D-0.2/src/Core/Registration/ |
| H A D | Feature.cpp | 73 const KDTreeFlann &kdtree, const KDTreeSearchParam &search_param) in ComputeSPFHFeature()
121 KDTreeFlann kdtree(input); in ComputeFPFHFeature() local
|
| /dports/graphics/py-open3d-python/Open3D-0.2/src/Core/Registration/ |
| H A D | Feature.cpp | 73 const KDTreeFlann &kdtree, const KDTreeSearchParam &search_param) in ComputeSPFHFeature()
121 KDTreeFlann kdtree(input); in ComputeFPFHFeature() local
|
| /dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/examples/features/ |
| H A D | example_shape_contexts.cpp | 65 pcl::search::KdTree<pcl::PointXYZ>::Ptr kdtree (new pcl::search::KdTree<pcl::PointXYZ>); in main() local
|
| H A D | example_spin_images.cpp | 65 pcl::search::KdTree<pcl::PointXYZ>::Ptr kdtree (new pcl::search::KdTree<pcl::PointXYZ>); in main() local
|
| /dports/graphics/geos/geos-3.9.1/src/index/kdtree/ |
| H A D | KdNode.cpp | 21 namespace kdtree { // geos.index.kdtree namespace
|
| /dports/graphics/open3d/Open3D-0.2/docs/tutorial/Basic/ |
| H A D | kdtree.rst | 1 .. _kdtree: target
|
| /dports/graphics/geos/geos-3.9.1/src/index/ |
| H A D | Makefile.am | 6 kdtree \ subdir
|
| /dports/graphics/py-open3d-python/Open3D-0.2/docs/tutorial/Basic/ |
| H A D | kdtree.rst | 1 .. _kdtree: target
|
| /dports/graphics/geos/geos-3.9.1/include/geos/index/ |
| H A D | Makefile.am | 10 kdtree \ subdir
|
| /dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/doc/tutorials/content/sources/kdtree_search/ |
| H A D | kdtree_search.cpp | 27 pcl::KdTreeFLANN<pcl::PointXYZ> kdtree; in main() local
|
| /dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/libslic3r/ |
| H A D | KDTreeIndirect.hpp | 196 size_t find_closest_point(const KDTreeIndirectType &kdtree, const PointType &point, FilterFn filter) in find_closest_point()
200 const KDTreeIndirectType &kdtree; in find_closest_point() member
228 size_t find_closest_point(const KDTreeIndirectType& kdtree, const PointType& point) in find_closest_point()
|
| /dports/cad/gmsh/gmsh-4.9.2-source/contrib/blossom/concorde97/KDTREE/ |
| H A D | Makefile | 17 kdtree: kd_main.$o $(LIB) $(LIBS) target
|