EBGeometry
Compact, header-only C++ library for fast evaluation of signed distance functions
Loading...
Searching...
No Matches
EBGeometry::PointCloudBVH< T, Meta, K, W > Member List

This is the complete list of members for EBGeometry::PointCloudBVH< T, Meta, K, W >, including all inherited members.

AABB typedefEBGeometry::PointCloudBVH< T, Meta, K, W >
allNearestNeighbors(std::size_t a_k=1) constEBGeometry::PointCloudBVH< T, Meta, K, W >inline
Base typedefEBGeometry::PointCloudBVH< T, Meta, K, W >
buildSoA()EBGeometry::BVH::PackedBVH< T, P, K, StoragePolicy >inlineprotected
BV typedefEBGeometry::BVH::PackedBVH< T, P, K, StoragePolicy >
closestPoint(const Vec3T< T > &a_query) const noexceptEBGeometry::PointCloudBVH< T, Meta, K, W >inline
closestPointBruteForce(const Vec3T< T > &a_query) const noexceptEBGeometry::PointCloudBVH< T, Meta, K, W >inline
closestPoints(const Vec3T< T > &a_query, std::size_t a_k, Hit *a_out) const noexceptEBGeometry::PointCloudBVH< T, Meta, K, W >inline
closestPointsBruteForce(const Vec3T< T > &a_query, std::size_t a_k, Hit *a_out) constEBGeometry::PointCloudBVH< T, Meta, K, W >inline
computeBoundingVolume() const noexceptEBGeometry::BVH::PackedBVH< T, P, K, StoragePolicy >inline
getBoundingVolume() const noexceptEBGeometry::BVH::PackedBVH< T, P, K, StoragePolicy >inline
getPrimitives() const noexceptEBGeometry::BVH::PackedBVH< T, P, K, StoragePolicy >inline
m_childAabbSoAEBGeometry::BVH::PackedBVH< T, P, K, StoragePolicy >protected
m_linearNodesEBGeometry::BVH::PackedBVH< T, P, K, StoragePolicy >protected
m_primitivesEBGeometry::BVH::PackedBVH< T, P, K, StoragePolicy >protected
metadata(std::size_t a_index) const noexceptEBGeometry::PointCloudBVH< T, Meta, K, W >inline
nearestNeighbor(std::size_t a_point) const noexceptEBGeometry::PointCloudBVH< T, Meta, K, W >inline
nearestNeighborBruteForce(std::size_t a_point) const noexceptEBGeometry::PointCloudBVH< T, Meta, K, W >inline
nearestNeighbors(std::size_t a_point, std::size_t a_k, Hit *a_out) const noexceptEBGeometry::PointCloudBVH< T, Meta, K, W >inline
nearestNeighborsBruteForce(std::size_t a_point, std::size_t a_k, Hit *a_out) constEBGeometry::PointCloudBVH< T, Meta, K, W >inline
Node typedefEBGeometry::PointCloudBVH< T, Meta, K, W >
numPoints() const noexceptEBGeometry::PointCloudBVH< T, Meta, K, W >inline
operator=(const PackedBVH &a_other)=defaultEBGeometry::BVH::PackedBVH< T, P, K, StoragePolicy >
operator=(PackedBVH &&a_other) noexcept=defaultEBGeometry::BVH::PackedBVH< T, P, K, StoragePolicy >
PackedBVH()=deleteEBGeometry::BVH::PackedBVH< T, P, K, StoragePolicy >
PackedBVH(const TreeBVH< T, P, BV, K > &a_tree)EBGeometry::BVH::PackedBVH< T, P, K, StoragePolicy >inline
PackedBVH(const TreeBVH< T, Q, BV, K > &a_tree, Converter &&a_converter)EBGeometry::BVH::PackedBVH< T, P, K, StoragePolicy >inline
PackedBVH(std::vector< std::pair< P, BV > > a_primsAndBVs, size_t a_targetLeafSize, S a_sfc=S{})EBGeometry::BVH::PackedBVH< T, P, K, StoragePolicy >inline
PackedBVH(std::vector< std::pair< P, BV > > a_primsAndBVs, const BVH::Partitioner< P, BV, K > &a_partitioner=BVCentroidPartitioner< T, P, BV, K >, const BVH::LeafPredicate< T, P, BV, K > &a_stopCrit=DefaultLeafPredicate< T, P, BV, K >)EBGeometry::BVH::PackedBVH< T, P, K, StoragePolicy >inline
PackedBVH(std::vector< std::pair< P, BV > > a_primsAndBVs, BVH::ClusterSpec a_spec)EBGeometry::BVH::PackedBVH< T, P, K, StoragePolicy >inline
PackedBVH(const PackedBVH &a_other)=defaultEBGeometry::BVH::PackedBVH< T, P, K, StoragePolicy >
PackedBVH(PackedBVH &&a_other) noexcept=defaultEBGeometry::BVH::PackedBVH< T, P, K, StoragePolicy >
PackedBVH(std::vector< Node > &&a_linearNodes, std::vector< StorageType > &&a_primitives) noexceptEBGeometry::BVH::PackedBVH< T, P, K, StoragePolicy >inlineprotected
PointCloudBVH()=deleteEBGeometry::PointCloudBVH< T, Meta, K, W >
PointCloudBVH(const std::vector< Vec3T< T > > &a_positions, const std::vector< Meta > &a_metadata, std::size_t a_targetLeafSize=16 *W)EBGeometry::PointCloudBVH< T, Meta, K, W >inline
PointGroup typedefEBGeometry::PointCloudBVH< T, Meta, K, W >
position(std::size_t a_index) const noexceptEBGeometry::PointCloudBVH< T, Meta, K, W >inline
pruneTraverse(const Vec3T< T > &a_point, State &a_state, LeafEvaluator &&a_evalLeaf, PruneDistSquared &&a_pruneDist2) const noexceptEBGeometry::BVH::PackedBVH< T, P, K, StoragePolicy >inline
StorageType typedefEBGeometry::BVH::PackedBVH< T, P, K, StoragePolicy >
traverse(const BVH::PackedLeafEvaluator< P, StoragePolicy > &a_leafEvaluator, const BVH::PrunePredicate< Node, NodeKey > &a_prunePredicate, const BVH::PackedChildOrderer< NodeKey, K > &a_childOrderer, const BVH::NodeKeyFactory< Node, NodeKey > &a_nodeKeyFactory) const noexceptEBGeometry::BVH::PackedBVH< T, P, K, StoragePolicy >inline
~PackedBVH()=defaultEBGeometry::BVH::PackedBVH< T, P, K, StoragePolicy >inline