main.cpp File Reference

#include <string>
#include <ctime>
#include <stdio.h>
#include "larreco/ClusterFinder/RStarTree/RStarTree.h"

Go to the source code of this file.

Classes
struct	Visitor

Macros
#define	RANDOM_DATASET
#define	nodes   20000

Typedefs
typedef RStarTree< int, 2, 32, 64 >	RTree
typedef RTree::BoundingBox	BoundingBox

Functions
BoundingBox	bounds (int x, int y, int w, int h)
int	main (int argc, char **argv)

Macro Definition Documentation

#define nodes   20000

Referenced by lar_content::fill_and_bound_2d_kd_tree(), lar_content::fill_and_bound_3d_kd_tree(), main(), trkf::PMAlgTrajFitter::produce(), and trkf::PMAlgTrackMaker::produce().

#define RANDOM_DATASET

Definition at line 25 of file main.cpp.

Typedef Documentation

typedef RTree::BoundingBox BoundingBox

Definition at line 34 of file main.cpp.

typedef RStarTree<int, 2, 32, 64> RTree

Definition at line 29 of file main.cpp.

Function Documentation

BoundingBox bounds	(	int	x,
		int	y,
		int	w,
		int	h
	)

Definition at line 37 of file main.cpp.

References RStarBoundingBox< dimensions >::edges, w, x, and y.

Referenced by main(), evgen::CORSIKAGen::populateNShowers(), evgen::CosmicsGen::produce(), and evgen::CORSIKAGen::produce().

{
        BoundingBox bb;
        
        bb.edges[0].first  = x;
        bb.edges[0].second = x + w;
        
        bb.edges[1].first  = y;
        bb.edges[1].second = y + h;
        
        return bb;
}

int main	(	int	argc,
		char **	argv
	)

Definition at line 72 of file main.cpp.

References bounds(), Visitor::count, RStarTree< LeafType, dimensions, min_child_items, max_child_items >::GetSize(), RStarTree< LeafType, dimensions, min_child_items, max_child_items >::Insert(), nodes, RStarTree< LeafType, dimensions, min_child_items, max_child_items >::Query(), RStarTree< LeafType, dimensions, min_child_items, max_child_items >::RemoveBoundedArea(), RStarBoundingBox< dimensions >::ToString(), Visitor::Visitor(), x, and y.

Referenced by proxy::details::createCollectionProxy(), proxy::CollectionProxyBase< SpacePointWithCharge, MainColl, AuxColl... >::empty(), proxy::CollectionProxyBase< SpacePointWithCharge, MainColl, AuxColl... >::has(), proxy::details::makeCollectionProxy(), proxy::CollectionProxyBase< SpacePointWithCharge, MainColl, AuxColl... >::size(), and proxy::ChargedSpacePointsCollectionProxy< MainColl, AuxColl >::spacePoints().

{
        RTree tree;
        Visitor x;
        
        // insert a bunch of items into the tree
        // Note: this dataset is the one shown on Guttman's original paper
#ifdef GUTTMAN_DATASET
        tree.Insert( "R8" , bounds( 1,5   , 3,2 ));
        //tree.Print("I1");
        
        tree.Insert( "R9", bounds( 6,1   , 2,2 ));
        //tree.Print("I2");
        
        tree.Insert( "R10", bounds( 6,4   , 2,2 ));
        //tree.Print("I3");
        
        tree.Insert( "R11", bounds( 9,0   , 2,14 ));
        //tree.Print("I4");
        
        tree.Insert( "R13", bounds( 13,1  , 1,9 ));
        //tree.Print("I5");
        
        tree.Insert( "R14", bounds( 12,5  , 2,2 ));
        //tree.Print("I6");
        
        tree.Insert( "R15", bounds( 0,16  , 2,2 ));
        //tree.Print("I7");
        
        tree.Insert( "R16", bounds( 3,11  , 6,7 ));
        //tree.Print("I8");
        
        tree.Insert( "R17", bounds( 14,10 , 7,4 ));
        //tree.Print("I9");
        
        tree.Insert( "R18", bounds( 16,8  , 2,9 ));
        //tree.Print("I10");
        
        tree.Insert( "R19", bounds( 17,12 , 3,3 ));
        //tree.Print("I11");
        
        BoundingBox bound = bounds( 5,10, 5,5 );
        
        std::cout << "Searching in " << bound.ToString() << std::endl;
        x = tree.Query(RTree::AcceptOverlapping(bound), Visitor());
        std::cout << "Visited " << x.count << " nodes." << std::endl;
        
        tree.RemoveBoundedArea(bound);
        
        // stretch the bounds a bit
        
        std::cout << "Searching in " << bound.ToString() << std::endl;
        x = tree.Query(RTree::AcceptOverlapping(bound), Visitor());
        std::cout << "Visited " << x.count << " nodes." << std::endl;
        
        BoundingBox bound2 = bounds(0,10, 10,10);
        std::cout << "Removing enclosed area " << bound2.ToString() << std::endl;
        tree.RemoveBoundedArea(bound2);
        
        std::cout << "Searching in " << bound.ToString() << std::endl;
        x = tree.Query(RTree::AcceptOverlapping(bound), Visitor());
        std::cout << "Visited " << x.count << " nodes." << std::endl;
        
        
        Visitor y = tree.Query(RTree::AcceptAny(), Visitor());
        std::cout << "Visited " << y.count << " nodes." << std::endl;
        
        
#endif
        

#ifdef RANDOM_DATASET
        srand(time(0));

        #define nodes 20000
        
        for (int i = 0; i < nodes/2; i++)
                tree.Insert(i, bounds( rand() % 1000, rand() % 1000, rand() % 10, rand() % 10));
                
        for (int i = 0; i < nodes/2; i++)
                tree.Insert(i, bounds( rand() % 1000, rand() % 1000, rand() % 20, rand() % 20));
                
        BoundingBox bound = bounds( 100,100, 300,400 );
        
        x = tree.Query(RTree::AcceptAny(), Visitor());
        std::cout << "AcceptAny: " << x.count << " nodes visited (" << tree.GetSize() << " nodes in tree)" << std::endl;
        
        
        std::cout << "Searching in " << bound.ToString() << std::endl;
        x = tree.Query(RTree::AcceptEnclosing(bound), Visitor());
        std::cout << "Visited " << x.count << " nodes (" << tree.GetSize() << " nodes in tree)" << std::endl;
        
        std::cout << "Removing enclosed area " << bound.ToString() << std::endl;
        tree.RemoveBoundedArea(bound);
        
        std::cout << "Searching in " << bound.ToString() << std::endl;
        x = tree.Query(RTree::AcceptEnclosing(bound), Visitor());
        std::cout << "Visited " << x.count << " nodes. (" << tree.GetSize() << " nodes in tree)" << std::endl;
        
        //tree.Print();
                
#endif

        
        
        return 0;
}