bvh_tree.hpp File Reference

#include <vector>
#include <set>
#include <iostream>
#include <map>
#include <algorithm>
#include <bitset>
#include <numeric>
#include <cmath>
#include <tr1/unordered_map>
#include <limits>
#include "common_tree.hpp"

Include dependency graph for bvh_tree.hpp:

Go to the source code of this file.

Classes
struct	moab::anonymous_namespace{bvh_tree.hpp}::_bvh::_Node< Box, Entity_handle >
class	moab::anonymous_namespace{bvh_tree.hpp}::_bvh::Split_comparator< Split >
class	moab::anonymous_namespace{bvh_tree.hpp}::_bvh::Iterator_comparator< Iterator >
class	moab::anonymous_namespace{bvh_tree.hpp}::_bvh::_Split_data
class	moab::anonymous_namespace{bvh_tree.hpp}::_bvh::_Bucket
class	moab::Bvh_tree< _Entity_handles, _Box, _Moab, _Parametrizer >

Namespaces
	moab
	Class representing axis-aligned bounding box.
	moab::anonymous_namespace{bvh_tree.hpp}
	moab::anonymous_namespace{bvh_tree.hpp}::_bvh

Macros
#define	BVH_TREE_HPP
#define	NUM_SPLITS   4
#define	NUM_BUCKETS   ( NUM_SPLITS + 1 )
#define	SMAX   5

Macro Definition Documentation

BVH_TREE_HPP

#define BVH_TREE_HPP

bvh_tree.hpp Ryan H. Lewis (C) 2012

An element tree partitions a mesh composed of elements. We subdivide the bounding box of a me, by putting boxes on the left if there center is on the left of a split line and vice versa.

Definition at line 25 of file bvh_tree.hpp.

NUM_BUCKETS

#define NUM_BUCKETS   ( NUM_SPLITS + 1 )

Definition at line 243 of file bvh_tree.hpp.

NUM_SPLITS

#define NUM_SPLITS   4

Definition at line 242 of file bvh_tree.hpp.

SMAX

#define SMAX   5

Definition at line 244 of file bvh_tree.hpp.