MOAB: Mesh Oriented datABase  (version 5.2.1)
moab::BVHTree Member List
This is the complete list of members for moab::BVHTree, including all inherited members.
boundBoxmoab::Tree [protected]
boxTagmoab::Tree [protected]
boxTagNamemoab::Tree [protected]
bruteforce_find(const double *point, const double iter_tol=1.0e-10, const double inside_tol=1.0e-6)moab::BVHTree [private]
build_tree(const Range &entities, EntityHandle *tree_root_set=NULL, FileOptions *options=NULL)moab::BVHTree [virtual]
BVHTree(Interface *impl)moab::BVHTree [inline]
BVHTree(const BVHTree &s)moab::BVHTree [private]
choose_best_split(const std::vector< std::vector< SplitData > > &splits, SplitData &data) const moab::BVHTree [inline, private]
cleanUpmoab::Tree [protected]
construct_element_vec(std::vector< HandleData > &handle_data_vec, const Range &elements, BoundBox &bounding_box)moab::BVHTree [inline, private]
convert_tree(std::vector< Node > &tree_nodes)moab::BVHTree [private]
create_root(const double box_min[3], const double box_max[3], EntityHandle &root_handle)moab::Tree
delete_tree_sets()moab::Tree
distance_search(const double from_point[3], const double distance, std::vector< EntityHandle > &result_list, const double iter_tol=1.0e-10, const double inside_tol=1.0e-6, std::vector< double > *result_dists=NULL, std::vector< CartVect > *result_params=NULL, EntityHandle *tree_root=NULL)moab::BVHTree [virtual]
moab::Tree::distance_search(const double *point, const double distance, std::vector< EntityHandle > &leaves_out, const double iter_tol=1.0e-10, const double inside_tol=1.0e-6, std::vector< double > *dists_out=NULL, std::vector< CartVect > *params_out=NULL, EntityHandle *start_node=NULL)=0moab::Tree [pure virtual]
entityHandlesmoab::BVHTree [private]
establish_buckets(HandleDataVec::const_iterator begin, HandleDataVec::const_iterator end, const BoundBox &interval, std::vector< std::vector< Bucket > > &buckets) const moab::BVHTree [private]
find_all_trees(Range &results)moab::Tree
find_point(const std::vector< double > &point, const unsigned int &index, const double iter_tol, const double inside_tol, std::pair< EntityHandle, CartVect > &result)moab::BVHTree [private]
find_split(HandleDataVec::iterator &begin, HandleDataVec::iterator &end, SplitData &data) const moab::BVHTree [private]
get_bounding_box(BoundBox &box, EntityHandle *tree_node=NULL) const moab::BVHTree [virtual]
get_box_tag(bool create_if_missing=true)moab::Tree [inline, protected]
get_eval()moab::Tree [inline]
get_info(EntityHandle root, double min[3], double max[3], unsigned int &max_dep)moab::Tree [inline, virtual]
get_max_depth()moab::Tree [inline]
get_max_per_leaf()moab::Tree [inline]
HandleDataVec typedefmoab::BVHTree [private]
initialize_splits(std::vector< std::vector< SplitData > > &splits, const std::vector< std::vector< Bucket > > &buckets, const SplitData &data) const moab::BVHTree [private]
local_build_tree(std::vector< Node > &tree_nodes, HandleDataVec::iterator begin, HandleDataVec::iterator end, const int index, const BoundBox &box, const int depth=0)moab::BVHTree [private]
maxDepthmoab::Tree [protected]
maxPerLeafmoab::Tree [protected]
mbImplmoab::Tree [protected]
median_order(HandleDataVec::iterator &begin, HandleDataVec::iterator &end, SplitData &data) const moab::BVHTree [private]
meshsetFlagsmoab::Tree [protected]
minWidthmoab::Tree [protected]
moab()moab::Tree [inline]
moab() const moab::Tree [inline]
myEvalmoab::Tree [protected]
myRootmoab::Tree [protected]
myTreemoab::BVHTree [private]
order_elements(HandleDataVec::iterator &begin, HandleDataVec::iterator &end, SplitData &data) const moab::BVHTree [inline, private]
parse_common_options(FileOptions &options)moab::Tree [protected]
parse_options(FileOptions &opts)moab::BVHTree [virtual]
point_search(const double *point, EntityHandle &leaf_out, const double iter_tol=1.0e-10, const double inside_tol=1.0e-6, bool *multiple_leaves=NULL, EntityHandle *start_node=NULL, CartVect *params=NULL)moab::BVHTree [virtual]
print()moab::BVHTree [virtual]
print_nodes(std::vector< Node > &nodes)moab::BVHTree [private]
reset_tree()moab::BVHTree [inline, virtual]
set_eval(ElemEvaluator *eval)moab::Tree [inline]
set_interval(BoundBox &interval, std::vector< Bucket >::const_iterator begin, std::vector< Bucket >::const_iterator end) const moab::BVHTree [inline, private]
splitsPerDirmoab::BVHTree [private]
startSetHandlemoab::BVHTree [private]
Tree(Interface *iface)moab::Tree [inline]
tree_stats()moab::Tree [inline]
tree_stats() const moab::Tree [inline]
treeDepthmoab::Tree [protected]
treeNamemoab::BVHTree [private, static]
treeStatsmoab::Tree [protected]
~BVHTree()moab::BVHTree [inline]
~Tree()moab::Tree [inline, virtual]
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines