linb::bad_any_cast | |
BenchResult | |
Nabo::BruteForceSearch< T, CloudType > | Brute-force nearest neighbour |
Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >::BucketEntry | Entry in a bucket |
Nabo::KDTreeBalancedPtInNodes< T, CloudType >::BuildPoint | |
Nabo::KDTreeBalancedPtInLeavesStack< T, CloudType >::BuildPoint | |
Nabo::KDTreeUnbalancedPtInLeavesExplicitBoundsStack< T, CloudType >::BuildPoint | |
Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::BuildPoint | |
Nabo::KDTreeUnbalancedPtInLeavesExplicitBoundsStack< T, CloudType >::CompareDim | |
Nabo::KDTreeBalancedPtInLeavesStack< T, CloudType >::CompareDim | |
Nabo::KDTreeBalancedPtInNodes< T, CloudType >::CompareDim | |
Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::CompareDim | |
Nabo::IndexHeapSTL< IT, VT >::Entry | Entry of the heap tree |
Nabo::IndexHeapBruteForceVector< IT, VT >::Entry | Entry of the heap vector |
linb::final | |
Nabo::IndexHeapBruteForceVector< IT, VT > | Brute-force implementation of heap |
Nabo::IndexHeapSTL< IT, VT > | Balanced-tree implementation of heap |
Nabo::KDTreeBalancedPtInLeavesStack< T, CloudType > | |
Nabo::KDTreeBalancedPtInNodes< T, CloudType > | |
Nabo::KDTreeBalancedPtInNodesPQ< T, CloudType > | |
Nabo::KDTreeBalancedPtInNodesStack< T, CloudType > | |
Nabo::KDTreeUnbalancedPtInLeavesExplicitBoundsStack< T, CloudType > | |
Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType > | |
Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType > | KDTree, unbalanced, points in leaves, stack, implicit bounds, ANN_KD_SL_MIDPT, optimised implementation |
Loader< T, CloudType > | |
Loader< T, Eigen::Map< const Eigen::Matrix< T, 3, Eigen::Dynamic >, Eigen::Aligned > > | |
NearestNeighbourSearch | |
Nabo::NearestNeighbourSearch< T, Cloud_T > | Nearest neighbour search interface, templatized on scalar type |
Nabo::KDTreeBalancedPtInNodes< T, CloudType >::Node | |
Nabo::KDTreeBalancedPtInLeavesStack< T, CloudType >::Node | |
Nabo::KDTreeUnbalancedPtInLeavesExplicitBoundsStack< T, CloudType >::Node | |
Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >::Node | Search node |
Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::Node | |
Nabo::Parameters | Parameter vector |
linb::final::requires_allocation< T > | Whether the type T must be dynamically allocated or can be stored on the stack |
Nabo::runtime_error | |
Nabo::KDTreeBalancedPtInNodesPQ< T, CloudType >::SearchElement | |
linb::final::storage_union | |
timer | |
linb::final::vtable_dynamic< T > | VTable for dynamically allocated storage |
linb::final::vtable_stack< T > | VTable for stack allocated storage |
linb::final::vtable_type | Base VTable specification |