| /dports/graphics/appleseed/appleseed-2.1.0-beta/src/appleseed/foundation/math/bvh/ |
| H A D | bvh_statistics.h | 156 const AABBType left_bbox = node.get_left_bbox(); in collect_stats_recurse() local
162 m_sibling_overlap.insert(AABBType::overlap_ratio(left_bbox, right_bbox) * ValueType(100.0)); in collect_stats_recurse()
165 collect_stats_recurse(tree, left_node, left_bbox, depth + 1); in collect_stats_recurse()
|
| H A D | bvh_builder.h | 193 const AABBType left_bbox(partitioner.compute_bbox(begin, pivot)); in subdivide_recurse()
203 node.set_left_bbox(left_bbox); in subdivide_recurse()
218 left_bbox); in subdivide_recurse()
|
| H A D | bvh_intersector.h | 320 const typename NodeType::AABBType left_bbox = in intersect_motion() local
326 …hit_left = (foundation::intersect(ray, ray_info, left_bbox, tmin[0]) && tmin[0] < ray_tmax) ? 1 : … in intersect_motion()
698 const double* left_bbox = base_bbox + left_base_index * 6; in intersect_motion() local
701 …d mleftbbx = _mm_add_pd(_mm_mul_pd(_mm_load_pd(left_bbox + 0), left_w1), _mm_mul_pd(_mm_load_pd(le… in intersect_motion()
705 …d mleftbby = _mm_add_pd(_mm_mul_pd(_mm_load_pd(left_bbox + 2), left_w1), _mm_mul_pd(_mm_load_pd(le… in intersect_motion()
709 …d mleftbbz = _mm_add_pd(_mm_mul_pd(_mm_load_pd(left_bbox + 4), left_w1), _mm_mul_pd(_mm_load_pd(le… in intersect_motion()
|
| /dports/graphics/appleseed/appleseed-2.1.0-beta/src/appleseed/foundation/math/voxel/ |
| H A D | voxel_statistics.h | 178 AABBType left_bbox, right_bbox; in collect_stats_recurse() local
179 split_bbox(bbox, split, left_bbox, right_bbox); in collect_stats_recurse()
183 collect_stats_recurse(tree, tree.m_nodes[child_index], left_bbox, depth + 1); in collect_stats_recurse()
|
| /dports/graphics/appleseed/appleseed-2.1.0-beta/src/appleseed/foundation/math/bsp/ |
| H A D | bsp_statistics.h | 194 AABBType left_bbox, right_bbox; in collect_stats_recurse() local
195 split_bbox(bbox, split, left_bbox, right_bbox); in collect_stats_recurse()
199 collect_stats_recurse(tree, tree.m_nodes[child_index], left_bbox, depth + 1); in collect_stats_recurse()
|
| /dports/graphics/hugin/hugin-2020.0.0/src/foreign/flann/algorithms/ |
| H A D | kdtree_single_index.h | 342 BoundingBox left_bbox(bbox); in divideTree()
343 left_bbox[cutfeat].high = cutval; in divideTree()
344 node->child1 = divideTree(left, left+idx, left_bbox); in divideTree()
350 node->divlow = left_bbox[cutfeat].high; in divideTree()
354 bbox[i].low = std::min(left_bbox[i].low, right_bbox[i].low); in divideTree()
355 bbox[i].high = std::max(left_bbox[i].high, right_bbox[i].high); in divideTree()
|
| /dports/graphics/colmap/colmap-3.6/lib/FLANN/algorithms/ |
| H A D | kdtree_single_index.h | 418 BoundingBox left_bbox(bbox); in divideTree()
419 left_bbox[cutfeat].high = cutval; in divideTree()
420 node->child1 = divideTree(left, left+idx, left_bbox); in divideTree()
426 node->divlow = left_bbox[cutfeat].high; in divideTree()
430 bbox[i].low = std::min(left_bbox[i].low, right_bbox[i].low); in divideTree()
431 bbox[i].high = std::max(left_bbox[i].high, right_bbox[i].high); in divideTree()
|
| /dports/math/flann/flann-1.9.1-29-g1d04523/src/cpp/flann/algorithms/ |
| H A D | kdtree_single_index.h | 418 BoundingBox left_bbox(bbox); in divideTree()
419 left_bbox[cutfeat].high = cutval; in divideTree()
420 node->child1 = divideTree(left, left+idx, left_bbox); in divideTree()
426 node->divlow = left_bbox[cutfeat].high; in divideTree()
430 bbox[i].low = std::min(left_bbox[i].low, right_bbox[i].low); in divideTree()
431 bbox[i].high = std::max(left_bbox[i].high, right_bbox[i].high); in divideTree()
|
| /dports/misc/openmvg/openMVG-2.0/src/third_party/flann/src/cpp/flann/algorithms/ |
| H A D | kdtree_single_index.h | 418 BoundingBox left_bbox(bbox); in divideTree()
419 left_bbox[cutfeat].high = cutval; in divideTree()
420 node->child1 = divideTree(left, left+idx, left_bbox); in divideTree()
426 node->divlow = left_bbox[cutfeat].high; in divideTree()
430 bbox[i].low = std::min(left_bbox[i].low, right_bbox[i].low); in divideTree()
431 bbox[i].high = std::max(left_bbox[i].high, right_bbox[i].high); in divideTree()
|
| /dports/graphics/open3d/Open3D-0.2/src/External/flann/algorithms/ |
| H A D | kdtree_single_index.h | 418 BoundingBox left_bbox(bbox); in divideTree()
419 left_bbox[cutfeat].high = cutval; in divideTree()
420 node->child1 = divideTree(left, left+idx, left_bbox); in divideTree()
426 node->divlow = left_bbox[cutfeat].high; in divideTree()
430 bbox[i].low = std::min(left_bbox[i].low, right_bbox[i].low); in divideTree()
431 bbox[i].high = std::max(left_bbox[i].high, right_bbox[i].high); in divideTree()
|
| /dports/graphics/opencv/opencv-4.5.3/modules/flann/include/opencv2/flann/ |
| H A D | kdtree_single_index.h | 370 BoundingBox left_bbox(bbox); in divideTree()
371 left_bbox[cutfeat].high = cutval; in divideTree()
372 node->child1 = divideTree(left, left+idx, left_bbox); in divideTree()
378 node->divlow = left_bbox[cutfeat].high; in divideTree()
382 bbox[i].low = std::min(left_bbox[i].low, right_bbox[i].low); in divideTree()
383 bbox[i].high = std::max(left_bbox[i].high, right_bbox[i].high); in divideTree()
|
| /dports/graphics/py-open3d-python/Open3D-0.2/src/External/flann/algorithms/ |
| H A D | kdtree_single_index.h | 418 BoundingBox left_bbox(bbox); in divideTree()
419 left_bbox[cutfeat].high = cutval; in divideTree()
420 node->child1 = divideTree(left, left+idx, left_bbox); in divideTree()
426 node->divlow = left_bbox[cutfeat].high; in divideTree()
430 bbox[i].low = std::min(left_bbox[i].low, right_bbox[i].low); in divideTree()
431 bbox[i].high = std::max(left_bbox[i].high, right_bbox[i].high); in divideTree()
|
| /dports/math/pdal/PDAL-2.3.0/vendor/nanoflann/ |
| H A D | nanoflann.hpp | 669 BoundingBox left_bbox(bbox); in divideTree() local
670 left_bbox[cutfeat].high = cutval; in divideTree()
671 node->child1 = divideTree(obj, left, left + idx, left_bbox); in divideTree()
677 node->node_type.sub.divlow = left_bbox[cutfeat].high; in divideTree()
681 bbox[i].low = std::min(left_bbox[i].low, right_bbox[i].low); in divideTree()
682 bbox[i].high = std::max(left_bbox[i].high, right_bbox[i].high); in divideTree()
|
| /dports/cad/gmsh/gmsh-4.9.2-source/Numeric/ |
| H A D | nanoflann.hpp | 1076 BoundingBox left_bbox(bbox); in divideTree() local
1077 left_bbox[cutfeat].high = cutval; in divideTree()
1078 node->child1 = divideTree(left, left+idx, left_bbox); in divideTree()
1084 node->node_type.sub.divlow = left_bbox[cutfeat].high; in divideTree()
1088 bbox[i].low = std::min(left_bbox[i].low, right_bbox[i].low); in divideTree()
1089 bbox[i].high = std::max(left_bbox[i].high, right_bbox[i].high); in divideTree()
|
| /dports/devel/vcglib/vcglib-2020.09/apps/sample/trimesh_indexing/ |
| H A D | nanoflann.hpp | 1088 BoundingBox left_bbox(bbox); in divideTree() local
1089 left_bbox[cutfeat].high = cutval; in divideTree()
1090 node->child1 = divideTree(left, left+idx, left_bbox); in divideTree()
1096 node->sub.divlow = left_bbox[cutfeat].high; in divideTree()
1100 bbox[i].low = std::min(left_bbox[i].low, right_bbox[i].low); in divideTree()
1101 bbox[i].high = std::max(left_bbox[i].high, right_bbox[i].high); in divideTree()
|
| /dports/math/saga/saga-8.1.3/saga-gis/src/saga_core/saga_api/ |
| H A D | nanoflann.hpp | 889 BoundingBox left_bbox(bbox); in divideTree() local
890 left_bbox[cutfeat].high = cutval; in divideTree()
891 node->child1 = divideTree(obj, left, left + idx, left_bbox); in divideTree()
897 node->node_type.sub.divlow = left_bbox[cutfeat].high; in divideTree()
901 bbox[i].low = std::min(left_bbox[i].low, right_bbox[i].low); in divideTree()
902 bbox[i].high = std::max(left_bbox[i].high, right_bbox[i].high); in divideTree()
|
| /dports/math/libmesh/libmesh-1.6.2/contrib/nanoflann/include/ |
| H A D | nanoflann.hpp | 946 BoundingBox left_bbox(bbox); in divideTree() local
947 left_bbox[cutfeat].high = cutval; in divideTree()
948 node->child1 = divideTree(obj, left, left + idx, left_bbox); in divideTree()
954 node->node_type.sub.divlow = left_bbox[cutfeat].high; in divideTree()
958 bbox[i].low = std::min(left_bbox[i].low, right_bbox[i].low); in divideTree()
959 bbox[i].high = std::max(left_bbox[i].high, right_bbox[i].high); in divideTree()
|
| /dports/science/cdo/cdo-2.0.0/src/ |
| H A D | nanoflann.hpp | 903 BoundingBox left_bbox(bbox); in divideTree() local
904 left_bbox[cutfeat].high = cutval; in divideTree()
905 node->child1 = divideTree(obj, left, left + idx, left_bbox); in divideTree()
911 node->node_type.sub.divlow = left_bbox[cutfeat].high; in divideTree()
915 bbox[i].low = std::min(left_bbox[i].low, right_bbox[i].low); in divideTree()
916 bbox[i].high = std::max(left_bbox[i].high, right_bbox[i].high); in divideTree()
|
| /dports/math/nanoflann/nanoflann-1.3.2/include/ |
| H A D | nanoflann.hpp | 890 BoundingBox left_bbox(bbox); in divideTree() local
891 left_bbox[cutfeat].high = cutval; in divideTree()
892 node->child1 = divideTree(obj, left, left + idx, left_bbox); in divideTree()
898 node->node_type.sub.divlow = left_bbox[cutfeat].high; in divideTree()
902 bbox[i].low = std::min(left_bbox[i].low, right_bbox[i].low); in divideTree()
903 bbox[i].high = std::max(left_bbox[i].high, right_bbox[i].high); in divideTree()
|
| /dports/graphics/opencv/opencv-4.5.3/contrib/modules/alphamat/src/3rdparty/ |
| H A D | nanoflann.hpp | 890 BoundingBox left_bbox(bbox); in divideTree() local
891 left_bbox[cutfeat].high = cutval; in divideTree()
892 node->child1 = divideTree(obj, left, left + idx, left_bbox); in divideTree()
898 node->node_type.sub.divlow = left_bbox[cutfeat].high; in divideTree()
902 bbox[i].low = std::min(left_bbox[i].low, right_bbox[i].low); in divideTree()
903 bbox[i].high = std::max(left_bbox[i].high, right_bbox[i].high); in divideTree()
|