MOAB: Mesh Oriented datABase  (version 5.3.1)
moab::AdaptiveKDTree Member List
This is the complete list of members for moab::AdaptiveKDTree, including all inherited members.
AdaptiveKDTree(Interface *iface)moab::AdaptiveKDTree
AdaptiveKDTree(Interface *iface, const Range &entities, EntityHandle *tree_root_set=NULL, FileOptions *opts=NULL)moab::AdaptiveKDTree
AdaptiveKDTreeIter classmoab::AdaptiveKDTree [friend]
Axis enum namemoab::AdaptiveKDTree
axisTagmoab::AdaptiveKDTree [private]
best_subdivision_plane(int num_planes, const AdaptiveKDTreeIter &iter, Range &best_left, Range &best_right, Range &best_both, AdaptiveKDTree::Plane &best_plane, double eps)moab::AdaptiveKDTree [private]
best_subdivision_snap_plane(int num_planes, const AdaptiveKDTreeIter &iter, Range &best_left, Range &best_right, Range &best_both, AdaptiveKDTree::Plane &best_plane, std::vector< double > &tmp_data, double eps)moab::AdaptiveKDTree [private]
best_vertex_median_plane(int num_planes, const AdaptiveKDTreeIter &iter, Range &best_left, Range &best_right, Range &best_both, AdaptiveKDTree::Plane &best_plane, std::vector< double > &coords, double eps)moab::AdaptiveKDTree [private]
best_vertex_sample_plane(int num_planes, const AdaptiveKDTreeIter &iter, Range &best_left, Range &best_right, Range &best_both, AdaptiveKDTree::Plane &best_plane, std::vector< double > &coords, std::vector< EntityHandle > &indices, double eps)moab::AdaptiveKDTree [private]
boundBoxmoab::Tree [protected]
boxTagmoab::Tree [protected]
boxTagNamemoab::Tree [protected]
build_tree(const Range &entities, EntityHandle *tree_root_set=NULL, FileOptions *options=NULL)moab::AdaptiveKDTree [virtual]
CandidatePlaneSet enum namemoab::AdaptiveKDTree
cleanUpmoab::Tree [protected]
closest_triangle(EntityHandle tree_root, const double from_coords[3], double closest_point_out[3], EntityHandle &triangle_out)moab::AdaptiveKDTree
compute_depth(EntityHandle root, unsigned int &min_depth, unsigned int &max_depth)moab::AdaptiveKDTree
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 *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)moab::AdaptiveKDTree [virtual]
find_all_trees(Range &results)moab::Tree
find_close_triangle(EntityHandle root, const double from_point[3], double pt[3], EntityHandle &triangle)moab::AdaptiveKDTree [private]
get_bounding_box(BoundBox &box, EntityHandle *tree_node=NULL) const moab::Tree [inline, 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 &dep)moab::AdaptiveKDTree [virtual]
get_last_iterator(EntityHandle tree_root, AdaptiveKDTreeIter &result)moab::AdaptiveKDTree
get_max_depth()moab::Tree [inline]
get_max_per_leaf()moab::Tree [inline]
get_split_plane(EntityHandle node, Plane &plane)moab::AdaptiveKDTree
get_sub_tree_iterator(EntityHandle tree_root, const double box_min[3], const double box_max[3], AdaptiveKDTreeIter &result)moab::AdaptiveKDTree
get_tree_iterator(EntityHandle tree_root, AdaptiveKDTreeIter &result)moab::AdaptiveKDTree
init()moab::AdaptiveKDTree [private]
intersect_children_with_elems(const Range &elems, AdaptiveKDTree::Plane plane, double eps, CartVect box_min, CartVect box_max, Range &left_tris, Range &right_tris, Range &both_tris, double &metric_value)moab::AdaptiveKDTree [private]
make_tag(Interface *iface, std::string name, TagType storage, DataType type, int count, void *default_val, Tag &tag_handle, std::vector< Tag > &created_tags)moab::AdaptiveKDTree [private]
maxDepthmoab::Tree [protected]
maxPerLeafmoab::Tree [protected]
mbImplmoab::Tree [protected]
merge_leaf(AdaptiveKDTreeIter &iter)moab::AdaptiveKDTree
meshsetFlagsmoab::Tree [protected]
minWidthmoab::Tree [protected]
moab()moab::Tree [inline]
moab() const moab::Tree [inline]
myEvalmoab::Tree [protected]
myRootmoab::Tree [protected]
parse_common_options(FileOptions &options)moab::Tree [protected]
parse_options(FileOptions &options)moab::AdaptiveKDTree [virtual]
planeSetmoab::AdaptiveKDTree [private]
planeTagmoab::AdaptiveKDTree [private]
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::AdaptiveKDTree [virtual]
point_search(const double *point, AdaptiveKDTreeIter &leaf_it, const double iter_tol=1.0e-10, const double inside_tol=1.0e-6, bool *multiple_leaves=NULL, EntityHandle *start_node=NULL)moab::AdaptiveKDTree
print()moab::AdaptiveKDTree [virtual]
radiusmoab::AdaptiveKDTree [private]
ray_intersect_triangles(EntityHandle tree_root, const double tolerance, const double ray_unit_dir[3], const double ray_base_pt[3], std::vector< EntityHandle > &triangles_out, std::vector< double > &distance_out, int result_count_limit=0, double distance_limit=-1.0)moab::AdaptiveKDTree
reset_tree()moab::AdaptiveKDTree [inline, virtual]
set_eval(ElemEvaluator *eval)moab::Tree [inline]
set_split_plane(EntityHandle node, const Plane &plane)moab::AdaptiveKDTree
sphere_intersect_triangles(EntityHandle tree_root, const double center[3], double radius, std::vector< EntityHandle > &triangles)moab::AdaptiveKDTree
sphericalmoab::AdaptiveKDTree [private]
split_leaf(AdaptiveKDTreeIter &leaf, Plane plane)moab::AdaptiveKDTree
split_leaf(AdaptiveKDTreeIter &leaf, Plane plane, EntityHandle &left_child, EntityHandle &right_child)moab::AdaptiveKDTree
split_leaf(AdaptiveKDTreeIter &leaf, Plane plane, const Range &left_entities, const Range &right_entities)moab::AdaptiveKDTree
split_leaf(AdaptiveKDTreeIter &leaf, Plane plane, const std::vector< EntityHandle > &left_entities, const std::vector< EntityHandle > &right_entities)moab::AdaptiveKDTree
splitsPerDirmoab::AdaptiveKDTree [private]
SUBDIVISION enum valuemoab::AdaptiveKDTree
SUBDIVISION_SNAP enum valuemoab::AdaptiveKDTree
Tree(Interface *iface)moab::Tree [inline]
tree_stats()moab::Tree [inline]
tree_stats() const moab::Tree [inline]
treeDepthmoab::Tree [protected]
treeNamemoab::AdaptiveKDTree [private, static]
treeStatsmoab::Tree [protected]
VERTEX_MEDIAN enum valuemoab::AdaptiveKDTree
VERTEX_SAMPLE enum valuemoab::AdaptiveKDTree
X enum valuemoab::AdaptiveKDTree
Y enum valuemoab::AdaptiveKDTree
Z enum valuemoab::AdaptiveKDTree
~AdaptiveKDTree()moab::AdaptiveKDTree
~Tree()moab::Tree [inline, virtual]
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines