spatial_locator_test.cpp File Reference

#include "moab/Core.hpp"
#include "moab/SpatialLocator.hpp"
#include "moab/Tree.hpp"
#include "moab/HomXform.hpp"
#include "moab/ScdInterface.hpp"
#include "moab/CartVect.hpp"
#include "moab/AdaptiveKDTree.hpp"
#include "moab/BVHTree.hpp"
#include "moab/ElemEvaluator.hpp"
#include "moab/ProgOptions.hpp"
#include "moab/CpuTimer.hpp"
#include "TestUtil.hpp"
#include <cstdlib>
#include <sstream>

Include dependency graph for spatial_locator_test.cpp:

Go to the source code of this file.

Functions
void	test_kd_tree ()
void	test_bvh_tree ()
void	test_locator (SpatialLocator *sl)
ErrorCode	create_hex_mesh (Interface &mb, Range &elems, int n, int dim)
int	main (int argc, char **argv)

Variables
int	max_depth = 30
int	npoints = 1000
int	leaf = 6
bool	print_tree = false
int	ints = 10

Function Documentation

create_hex_mesh()

ErrorCode create_hex_mesh	(	Interface &	mb,
		Range &	elems,
		int	n,
		int	dim
	)

Definition at line 153 of file spatial_locator_test.cpp.

{
 ScdInterface* scdi;
 ErrorCode rval = mb.query_interface( scdi );CHECK_ERR( rval );
 HomCoord high( n - 1, -1, -1 );
 if( dim > 1 ) high[1] = n - 1;
 if( dim > 2 ) high[2] = n - 1;
 ScdBox* new_box;
 rval = scdi->construct_box( HomCoord( 0, 0, 0 ), high, NULL, 0, new_box );CHECK_ERR( rval );
 rval = mb.release_interface( scdi );CHECK_ERR( rval );
 
 rval = mb.get_entities_by_dimension( 0, dim, elems );CHECK_ERR( rval );
 
 return rval;
}

References CHECK_ERR, moab::ScdInterface::construct_box(), dim, ErrorCode, moab::Core::get_entities_by_dimension(), mb, moab::Interface::query_interface(), and moab::Interface::release_interface().

Referenced by test_bvh_tree(), and test_kd_tree().

main()

int main	(	int	argc,
		char **	argv
	)

Definition at line 36 of file spatial_locator_test.cpp.

{
#ifdef MOAB_HAVE_MPI
 int fail = MPI_Init( &argc, &argv );
 if( fail ) return fail;
#else
 // silence the warning of parameters not used, in serial; there should be a smarter way :(
 argv[0] = argv[argc - argc];
#endif
 
 ProgOptions po( "spatial_locator_test options" );
 po.addOpt< int >( "ints,i", "Number of intervals on each side of scd mesh", &ints );
 po.addOpt< int >( "leaf,l", "Maximum number of elements per leaf", &leaf );
 po.addOpt< int >( "max_depth,m", "Maximum depth of tree", &max_depth );
 po.addOpt< int >( "npoints,n", "Number of query points", &npoints );
 po.addOpt< void >( "print,p", "Print tree details", &print_tree );
 po.parseCommandLine( argc, argv );
 
 RUN_TEST( test_kd_tree );
 RUN_TEST( test_bvh_tree );
 
#ifdef MOAB_HAVE_MPI
 fail = MPI_Finalize();
 if( fail ) return fail;
#endif
 
 return 0;
}

References ProgOptions::addOpt(), moab::fail(), ints, leaf, max_depth, npoints, ProgOptions::parseCommandLine(), print_tree, RUN_TEST, test_bvh_tree(), and test_kd_tree().

test_bvh_tree()

void test_bvh_tree

(

)

Definition at line 93 of file spatial_locator_test.cpp.

{
 ErrorCode rval;
 Core mb;
 
 // create a simple mesh to test
 Range elems;
 rval = create_hex_mesh( mb, elems, ints, 3 );CHECK_ERR( rval );
 
 // initialize spatial locator with the elements and a BVH tree
 BVHTree bvh( &mb );
 std::ostringstream opts;
 opts << "MAX_DEPTH=" << max_depth << ";MAX_PER_LEAF=" << leaf;
 FileOptions fo( opts.str().c_str() );
 rval = bvh.parse_options( fo );
 SpatialLocator* sl = new SpatialLocator( &mb, elems, &bvh );
 test_locator( sl );
 
 // test with an evaluator
 ElemEvaluator eval( &mb );
 bvh.set_eval( &eval );
 test_locator( sl );
 
 // destroy spatial locator, and tree along with it
 delete sl;
}

References CHECK_ERR, create_hex_mesh(), ErrorCode, ints, leaf, max_depth, mb, moab::BVHTree::parse_options(), moab::Tree::set_eval(), and test_locator().

Referenced by main().

test_kd_tree()

void test_kd_tree

(

)

Definition at line 65 of file spatial_locator_test.cpp.

{
 ErrorCode rval;
 Core mb;
 
 // create a simple mesh to test
 Range elems;
 rval = create_hex_mesh( mb, elems, ints, 3 );CHECK_ERR( rval );
 
 // initialize spatial locator with the elements and KDtree
 AdaptiveKDTree kd( &mb );
 std::ostringstream opts;
 opts << "MAX_DEPTH=" << max_depth << ";MAX_PER_LEAF=" << leaf;
 FileOptions fo( opts.str().c_str() );
 rval = kd.parse_options( fo );
 SpatialLocator* sl = new SpatialLocator( &mb, elems, &kd );
 
 test_locator( sl );
 
 // test with an evaluator
 ElemEvaluator eval( &mb );
 kd.set_eval( &eval );
 test_locator( sl );
 
 // destroy spatial locator, and tree along with it
 delete sl;
}

References CHECK_ERR, create_hex_mesh(), ErrorCode, ints, leaf, max_depth, mb, moab::AdaptiveKDTree::parse_options(), moab::Tree::set_eval(), and test_locator().

Referenced by main().

test_locator()

void test_locator

(

SpatialLocator *

sl

)

Definition at line 120 of file spatial_locator_test.cpp.

{
 CartVect box_del, test_pt, test_res;
 BoundBox box = sl->local_box();
 box_del = box.bMax - box.bMin;
 
 double denom = 1.0 / (double)RAND_MAX;
 int is_in;
 EntityHandle ent = 0;
 ErrorCode rval;
 for( int i = 0; i < npoints; i++ )
 {
 // generate a small number of random point to test
 double rx = (double)rand() * denom, ry = (double)rand() * denom, rz = (double)rand() * denom;
 test_pt = box.bMin + CartVect( rx * box_del[0], ry * box_del[1], rz * box_del[2] );
 
 // call spatial locator to locate points
 rval = sl->locate_points( test_pt.array(), 1, &ent, test_res.array(), &is_in );CHECK_ERR( rval );
 
 // verify that the point was found
 CHECK_EQUAL( is_in, true );
 }
 
 std::cout << "Traversal stats:" << std::endl;
 sl->get_tree()->tree_stats().output_trav_stats();
 
 if( print_tree )
 {
 std::cout << "Tree information: " << std::endl;
 rval = sl->get_tree()->print();CHECK_ERR( rval );
 }
}

References moab::CartVect::array(), box(), CHECK_EQUAL, CHECK_ERR, ErrorCode, moab::SpatialLocator::get_tree(), moab::SpatialLocator::local_box(), moab::SpatialLocator::locate_points(), npoints, moab::TreeStats::output_trav_stats(), moab::Tree::print(), print_tree, and moab::Tree::tree_stats().

Referenced by test_bvh_tree(), and test_kd_tree().

Variable Documentation

ints

int ints = 10

Definition at line 34 of file spatial_locator_test.cpp.

Referenced by main(), test_bvh_tree(), and test_kd_tree().

leaf

int leaf = 6

Definition at line 32 of file spatial_locator_test.cpp.

Referenced by main(), test_bvh_tree(), and test_kd_tree().

max_depth

int max_depth = 30

Definition at line 30 of file spatial_locator_test.cpp.

Referenced by main(), test_bvh_tree(), and test_kd_tree().

npoints

int npoints = 1000

Definition at line 31 of file spatial_locator_test.cpp.

Referenced by main(), and test_locator().

print_tree

bool print_tree = false

Definition at line 33 of file spatial_locator_test.cpp.

Referenced by main(), and test_locator().