treeindexedD2test Class Reference

Test treeindexedD2 classes. More...

#include <treeindexedD2test.h>

Collaboration diagram for treeindexedD2test:

List of all members.

Public Types
typedef point2< double >	pt2
typedef point2< double >	pt2
Public Member Functions
void	test03 (int argc, char **argv)
	Visually see and interact with a bsp tree.
int	test05 (int argc, char **argv)
	Passageway collision detection.
void	test03 (int argc, char **argv)
	Visually see and interact with a bsp tree.
int	test05 (int argc, char **argv)
	Passageway collision detection.
Static Public Member Functions
static void	test01 ()
	Basic printing and inserting.
static void	test02 ()
	Building and printing a simple tree.
static void	test04 ()
	Testing treeindexedD2iter.h classes.
static int	unittest01 (int argc, char **argv)
	Reading a tree from a text file.
static int	unittest02 ()
	Build a bsp tree in 2D.
static int	unittest04 ()
	Testing move(T const bpath,T const nsteps).
static void	test01 ()
	Basic printing and inserting.
static void	test02 ()
	Building and printing a simple tree.
static void	test04 ()
	Testing treeindexedD2iter.h classes.
static int	unittest01 (int argc, char **argv)
	Reading a tree from a text file.
static int	unittest02 ()
	Build a bsp tree in 2D.
static int	unittest04 ()
	Testing move(T const bpath,T const nsteps).

---

Detailed Description

Test treeindexedD2 classes.

This class has small unit tests and two interactive graphics programs test03 and test05.

The graphics aims to visually impart information about the data structures(WYSIWYG).

Definition at line 23 of file treeindexedD2test.h.

---

Member Typedef Documentation

typedef point2<double> treeindexedD2test::pt2

Definition at line 26 of file treeindexedtest.h.

typedef point2<double> treeindexedD2test::pt2

Definition at line 26 of file treeindexedD2test.h.

---

Member Function Documentation

static void treeindexedD2test::test01

(

)

[static]

Basic printing and inserting.

void treeindexedD2test::test01

(

)

[static]

Basic printing and inserting.

Definition at line 48 of file treeindexedD2test.cpp.

References treeindexedD2< INDX >::addleft(), and treeindexedD2< INDX >::addright().

Referenced by main().

{
  cout << "Testing treeindexedD2 printing and addleft, addright." << endl;

  treeindexedD2<uint> t1;

  cout << "Created a root node." << endl;
  cout << (stringc)t1 << endl << endl;

  cout << "addleft" << endl;
  t1.addleft();
  cout << (stringc)t1 << endl << endl;

  cout << "Created another root node." << endl;
  treeindexedD2<uint> t2;
  cout << (stringc)t2 << endl << endl;
  cout << "addright" << endl;
  t2.addright();
  cout << (stringc)t2 << endl << endl;


}

static void treeindexedD2test::test02

(

)

[static]

Building and printing a simple tree.

void treeindexedD2test::test02

(

)

[static]

Building and printing a simple tree.

Definition at line 72 of file treeindexedD2test.cpp.

References treeindexedD2< INDX >::addleft(), treeindexedD2< INDX >::addright(), treeindexedD2< INDX >::moveleft(), and treeindexedD2< INDX >::reset().

Referenced by main().

{
  cout << "Builing and printing a simple tree." << endl;
  treeindexedD2<uint> t1;

  t1.addleft();
  cout << "addleft" << endl;
  cout << (stringc)t1 << endl;

  t1.moveleft();
  t1.addleft();
  cout << "moveleft, addleft" << endl;
  cout << (stringc)t1 << endl;

  t1.reset();
  t1.moveleft();
  t1.addright();
  cout << "reset, moveleft, addright" << endl;

  cout << (stringc)t1 << endl;

}

void treeindexedD2test::test03	(	int	argc,
		char **	argv
	)

Visually see and interact with a bsp tree.

void treeindexedD2test::test03	(	int	argc,
		char **	argv
	)

Visually see and interact with a bsp tree.

Definition at line 258 of file treeindexedD2test.cpp.

References treeindexedD2< INDX >::addleft(), treeindexedD2< INDX >::addright(), bsptreeD2dispregions01< PT, PD, INDX >::delta, menusystem::fontcolor, menusystem::fontcolorenable(), gobjpush, gobjSwitch< BOOL >::isdrawn, gobjQuadric::loops, treeindexedD2< INDX >::moveright(), gobjQuadric::radius, treeindexedD2< INDX >::reset(), gobjContainer::set(), gobjQuadric::slices, bsptreeD2< PT, PD, INDX >::tree, zpr::update(), bsptreeD2dispregions01< PT, PD, INDX >::update(), bsptreeD2disp03< PT, PD, INDX >::update(), and bsptreeD2< PT, PD, INDX >::vi.

{
  glutInit(&argc,argv);
  glutInitDisplayMode(GLUT_DOUBLE | GLUT_RGB | GLUT_DEPTH);
  glutInitWindowSize(800,600);
  glutCreateWindow("");
  glutDisplayFunc(display01);

// TURNED OFF FOR TESTING.
  glutKeyboardFunc(keyboard03);
  glutSpecialFunc(special03);

  OpenGLinitialisation();

  glEnable(GL_CULL_FACE);
  glEnable(GL_NORMALIZE);

  xGraphics.set();

  commandline cmd(argc,argv);

  gobjpush(new myaxes(1.0));

  targetg = new gobjContainer(true);

  gobjpush(targetg);


  gobjQuadric * q2 = new gobjQuadric();
  q2->radius = 0.2;
  q2->slices=30;
  q2->loops=7;
  gobjpush(q2);

  targetsphere = new gobjMySphereDraw(target,q2);



  typedef point2<double> pt2;

  cout << "Building a simple 2D partition." << endl;
  cout << " Using manual insertion commands : move to the node before" << endl;
  cout << " inserting new node, then adding associated half-space to vi." << endl << endl;

  bsp.vi.push_back( 
    halfspaceD2<pt2,double>(pt2(0.0,0.0),pt2(0.0,1.0)) );

  bsp.tree.reset();
  bsp.tree.addleft();
  bsp.vi.push_back(
    halfspaceD2<pt2,double>(pt2(-1.0,1.0),pt2(0.0,1.0)) );

  bsp.tree.reset();
  bsp.tree.addright();
  bsp.vi.push_back(
    halfspaceD2<pt2,double>(pt2(0.0,-0.5),pt2(1.0,-0.5)) );

  bsp.tree.reset();
  bsp.tree.moveright();
  bsp.tree.addleft();
  bsp.vi.push_back(
    halfspaceD2<pt2,double>(pt2(4.0,0.0),pt2(4.0,1.0)) );

  

  bsptreeD2disp03<pt2,double,uint> * disp
    = new bsptreeD2disp03<pt2,double,uint>(bsp,0.02);
    //= new bsptreeD2disp03<pt2,double,uint>(bsp,-10000.0,10000.0,0.02);
  disp->update();
  gobjpush(disp);
  
  bsptreeD2dispregions01<pt2,double,uint> *dispregions
    = new bsptreeD2dispregions01<pt2,double,uint>(bsp);
  dispregions->delta=0.4;
  dispregions->update();
  gobjpush(dispregions);
  
  gobjpush(new gobjglDisable(GL_LIGHTING));


  menusystem * menu = 
    new menusystem(point2<GLint>(60,30),10);
  menu->fontcolor = point4<float>(218.0/255.0,165.0/255.0,32.0/255.0,0.75);

  menu->fontcolorenable();

  gobjSwitch<> * menuswitch = new gobjSwitch<>(menu,true);
  help = & menuswitch->isdrawn;
  gobjpush(menuswitch);


  gobjpush(new gobjglEnable(GL_LIGHTING));

  menu->addfont12("BSP Tree Demo",2);

  menu->addfont10("[page up] move up",1);
  menu->addfont10("[page down] move down",1);
  menu->addfont10("[< home] move left",1);
  menu->addfont10("[end >] move right",2);

//  menu->addfont10("j J   Move ball right or left.",1);
//  menu->addfont10("k K   Move ball up or down.",2);

  menu->addfont10("+ -   Increase or decrease change.",1);
  menu->addfont10("h    Toggle this help menu.",2);
  menu->addfont10("ESC      Quit");



  gobjpush(new gobjglEnable(GL_LIGHTING));

//  glMatrixMode(GL_MODELVIEW);
//  glLoadIdentity();

  zpr zz;

// Unable to work out why this does not work.
//  glMatrixMode(GL_MODELVIEW);
//  glLoadIdentity();
//  gluLookAt(
//    0.0,0.0,0.0,  // COP target
//    0.0,0.0,5.0,  // Reference
//    0.0,1.0,0.0); // Up

  zz.update();

  update03();

  glutMainLoop();

}

static void treeindexedD2test::test04

(

)

[static]

Testing treeindexedD2iter.h classes.

void treeindexedD2test::test04

(

)

[static]

Testing treeindexedD2iter.h classes.

Definition at line 430 of file treeindexedD2test.cpp.

References treeindexedD2iter< T >::reset().

Referenced by main().

{
  treeindexedD2<uint> t1;
  string s(
"4 \
1 2 2 0 0 \
2 3 4 1 0 \
3 1 4 2 0 \
4 3 5 2 1");
  stringstream ss(s);
  ss >> t1;


  treeindexedD2iter<uint> i1(t1,false);

  cout << "Iterating over every node." << endl;
  for ( i1.reset(); !i1; ++i1)
    cout << i1()->index << " ";
  cout << endl << endl;

  cout << "Iterating over the leaves." << endl;
  for ( i1.reset(); !i1; ++i1)
    if (i1()->isleaf())
      cout << i1()->index << " ";
  cout << endl << endl;
  
  cout << "Iterating over the internal nodes." << endl;
  for ( i1.reset(); !i1; ++i1)
    if (!i1()->isleaf())
      cout << i1()->index << " ";
  cout << endl << endl;


  cout << "Iterating over the leaves." << endl;
  treeindexedD2iterleaf<uint> i2(t1);
  for ( i2.reset(); !i2; ++i2)
    cout << i2()->index << " ";
  cout << endl << endl;

  cout << "Iterating over the internal nodes." << endl;
  for ( treeindexedD2iterleaf<uint> i3(t1); !i3; ++i3 )
    cout << i3()->index << " ";  
  cout << endl << endl;
}

int treeindexedD2test::test05	(	int	argc,
		char **	argv
	)

Passageway collision detection.

int treeindexedD2test::test05	(	int	argc,
		char **	argv
	)

Passageway collision detection.

Definition at line 637 of file treeindexedD2test.cpp.

References menusystem::addfont12start(), bsptreeD2dispregions01< PT, PD, INDX >::delta, menusystem::fontcolor, menusystem::fontcolorenable(), gobj::global, gobjpush, gobjSwitch< BOOL >::isdrawn, textoverlay::lightingdisable(), gobjQuadric::loops, commandline::mapvar(), gobjContainer::push(), gobjQuadric::radius, gobjContainer::set(), gobjQuadric::slices, zpr::update(), bsptreeD2dispregions01< PT, PD, INDX >::update(), bsptreeD2disp03< PT, PD, INDX >::update(), and bsptreeD2< PT, PD, INDX >::validhalfspaces().

{
  glutInit(&argc,argv);
  glutInitDisplayMode(GLUT_DOUBLE | GLUT_RGB | GLUT_DEPTH);
  glutInitWindowSize(800,600);
  glutCreateWindow("");
  glutDisplayFunc(display01);
  glutKeyboardFunc(keyboard05);
  glutSpecialFunc(special05);

  OpenGLinitialisation();

  glEnable(GL_DEPTH_TEST);
  glEnable(GL_CULL_FACE);
  glEnable(GL_NORMALIZE);

  xGraphics.set();

  commandline cmd(argc,argv);

  typedef point2<double> pt2;

  viboxesbuild();

  vector<string> ptlabels;
  vector<pt2> ptlist;
  for (uint i=1; i<viboxes.size(); ++i)
  {
    {
      stringstream ss;
      ss << i;
      ptlabels.push_back(ss.str());
      ptlist.push_back(viboxes[i].center);
    }
  }
  gobjpush(new gobjglPushAttrib(GL_LIGHTING));
  gobjpush(new gobjglPushAttrib(GL_CURRENT_BIT));
  gobjpush(new gobjglDisable(GL_LIGHTING));

  gobjpush(new gobjglColor3f(0.0,0.0,1.0));
  pointsdisplay2D< pt2 > pd( *gobj::global, ptlist, ptlabels );

  gobjpush(new gobjglPopAttrib());
  gobjpush(new gobjglPopAttrib());

  glEnable(GL_BLEND);
  glBlendFunc(GL_SRC_ALPHA,GL_ONE_MINUS_SRC_ALPHA);

  gobjContainer * geom = new gobjContainer(true);
  //geom->push(new gobjglEnable(GL_BLEND));
  //geom->push(
  //  new gobjglBlendFunc(GL_SRC_ALPHA,GL_ONE_MINUS_SRC_ALPHA) );
  geom->push(new gobjglColor4f(0.0,0.0,191.0/255.0,0.8));
  geom->push(new gobjglEnable(GL_LIGHTING));
  geom->push(new gobjglBegin(GL_QUADS));

  pt2 pi[4];
  for (uint k=1; k<viboxes.size(); ++k)
  {
    viboxes[k].cornerpoints(pi[0],pi[1],pi[2],pi[3]);
    for (uint i=0; i<4; ++i)
      geom->push(new gobjglVertex2f(pi[i].x,pi[i].y));
  }
   
  geom->push(new gobjglEnd());
  //geom->push(new gobjglDisable(GL_BLEND));

  gobjpush(geom);

  gridsquare * gs = new gridsquare(1,0xaaaa,7,6,7.0,6.0);
  gobjpush(gs);


  string in;
  cmd.mapvar(in,"in");
  if ( in.empty() )
  {
    cout << "error: in=filename expected" << endl;
    return 1;
  }

  ifstream filein(in.c_str());
  assert(filein.good()==true);
  if (filein.good()==false)
  {
    cout << "error: " << in << " file can not be opened." << endl;
    return 1;
  }

  messages = 
      new menusystem(0,0,true,point2<GLint>(60,250),10);
  gobjpush(messages);
  messages->fontcolor = point4<float>(1.0,0.0,0.0,0.8);
  messages->fontcolorenable();
  messages->lightingdisable();

  filein >> bsp;
  uint errorh, errorhparent;
  //cout << SHOW( << "  ";
  //cout << SHOW(errorh) << " " << SHOW(errorhparent) << endl;
  bool errorres = bsp.validhalfspaces(errorh,errorhparent);
  if (errorres==false)
  {
    string str;
    str += "error:  errorh=";
    { stringstream ss; ss << errorh; str += ss.str(); }
    str += " errorhparent=";
    { stringstream ss; ss << errorhparent; str += ss.str(); }
    
    messages->addfont12start(str,1);
  }

  gobjpush(new gobjglDisable(GL_LIGHTING));
  bsptreeD2disp03<pt2,double,uint> * disp
    = new bsptreeD2disp03<pt2,double,uint>(bsp,0.04);
  disp->update();
  gobjpush(disp);
  
  bsptreeD2dispregions01<pt2,double,uint> *dispregions
    = new bsptreeD2dispregions01<pt2,double,uint>(bsp);
  dispregions->delta=0.4;
  dispregions->update();
  gobjpush(dispregions);

//cout << (stringc)bsp.tree << endl;

  gobjQuadric * q2 = new gobjQuadric();
  q2->radius = 0.1;
  q2->slices=30;
  q2->loops=7;
  gobjpush(q2);

  gobjpush(new gobjglPushAttrib(GL_CURRENT_BIT));
  gobjpush(new gobjglPushAttrib(GL_LIGHTING));
  gobjpush(new gobjglEnable(GL_LIGHTING));
  targetsphere = new gobjMySphereDraw(target,q2);
  gobjpush( new 
    gobjglColor4f( 153.0/255.0, 50.0/255.0, 204.0/255.0, 0.92));
  gobjpush(targetsphere);
  gobjpush( new gobjglPopAttrib() );
  gobjpush( new gobjglPopAttrib() );

  target=pt2(2.5,0.5);
  update05();

  //gobjpush(new gobjglDisable(GL_LIGHTING));
  menusystem * menu = 
    new menusystem(0,0,true,point2<GLint>(60,30),10);
  menu->fontcolor = point4<float>(218.0/255.0,165.0/255.0,32.0/255.0,0.75);

  gobjSwitch<> * menuswitch = new gobjSwitch<>(menu,true);
  help = & menuswitch->isdrawn;
  gobjpush(menuswitch);
  //gobjpush(new gobjglEnable(GL_LIGHTING));

  menu->addfont12("BSP Tree Demo",2);

  menu->addfont10("[page up] move up",1);
  menu->addfont10("[page down] move down",1);
  menu->addfont10("[< home] move left",1);
  menu->addfont10("[end >] move right",2);
//  menu->addfont10("j k   Move ball left or right.",1);
//  menu->addfont10("d f   Move ball down or up.",2);

  menu->addfont10("t     Print the targets position.",1);
  menu->addfont10("r     Print the targets region.",1);
  menu->addfont10("T     Print the tree.",1);
  menu->addfont10("v     Print the visibility",2);

  menu->addfont10("+ -   Increase or decrease change.",1);
  menu->addfont10("h    Toggle this help menu.",2);
  menu->addfont10("ESC      Quit");
  
  zpr zz;

  zz.update();
  glutMainLoop();

  return 0;
}

static int treeindexedD2test::unittest01	(	int	argc,
		char **	argv
	)			[static]

Reading a tree from a text file.

int treeindexedD2test::unittest01	(	int	argc,
		char **	argv
	)			[static]

Reading a tree from a text file.

Definition at line 96 of file treeindexedD2test.cpp.

References assertreturnOS, tokenizermisc::comparewithoutspace(), commandline::mapvar(), and tokenizermisc::readfile().

Referenced by main().

{
  commandline cmd(argc,argv);

  string in;
  cmd.mapvar(in,"in");
  if ( in.empty() )
  {
    cout << "error: in=filename expected" << endl;
    return 1;
  }

  ifstream filein(in.c_str());
  assert(filein.good()==true);
  if (filein.good()==false)
  {
    cout << "error: " << in << " file can not be opened." << endl;
    return 1;
  }

  treeindexedD2<uint> t1;
  filein >> t1;

  cout << (stringc)t1 << endl;

  string s1;
  assertreturnOS(tokenizermisc::readfile(s1,in.c_str()));

  string s2( (stringc)t1 );

  assertreturnOS(tokenizermisc::comparewithoutspace(s1,s2));

  return 0;
}

static int treeindexedD2test::unittest02

(

)

[static]

Build a bsp tree in 2D.

Test 5 points in their 5 regions.

int treeindexedD2test::unittest02

(

)

[static]

Build a bsp tree in 2D.

Test 5 points in their 5 regions.

Definition at line 131 of file treeindexedD2test.cpp.

References treeindexedD2< INDX >::addleft(), treeindexedD2< INDX >::addright(), assertreturnOS, bsptreeD2< PT, PD, INDX >::find(), treeindexedD2< INDX >::moveright(), treeindexedD2< INDX >::reset(), bsptreeD2< PT, PD, INDX >::tree, and bsptreeD2< PT, PD, INDX >::vi.

Referenced by main().

{
  typedef point2<double> pt2;
  bsptreeD2<pt2,double,uint> t1; 

  cout << "Building a simple 2D partition." << endl;
  cout << " Using manual insertion commands : move to the node before" << endl;
  cout << " inserting new node, then adding associated half-space to vi." << endl << endl;

  t1.vi.push_back( 
    halfspaceD2<pt2,double>(pt2(0.0,0.0),pt2(0.0,1.0)) );

  t1.tree.reset();
  t1.tree.addleft();
  t1.vi.push_back(
    halfspaceD2<pt2,double>(pt2(-1.0,1.0),pt2(0.0,1.0)) );

  t1.tree.reset();
  t1.tree.addright();
  t1.vi.push_back(
    halfspaceD2<pt2,double>(pt2(0.0,-0.5),pt2(1.0,-0.5)) );

  t1.tree.reset();
  t1.tree.moveright();
  t1.tree.addleft();
  t1.vi.push_back(
    halfspaceD2<pt2,double>(pt2(4.0,0.0),pt2(4.0,1.0)) );

  cout << (stringc)t1.tree << endl << endl;

  cout << "Testing if points are in correct regions." << endl;

  uint i[5];
  t1.find(i[0],pt2(1.0,1.0));
  assertreturnOS(i[0]==2);
  t1.find(i[1],pt2(-2.0,-10.0));
  assertreturnOS(i[1]==3);
  t1.find(i[2],pt2(-5.0,-5.0));
  assertreturnOS(i[2]==3);
  t1.find(i[3],pt2(1.0,-2.0));
  assertreturnOS(i[3]==4);
  t1.find(i[4],pt2(6.0,2.0));
  assertreturnOS(i[4]==5);

  return 0;
}

static int treeindexedD2test::unittest04

(

)

[static]

Testing move(T const bpath,T const nsteps).

int treeindexedD2test::unittest04

(

)

[static]

Testing move(T const bpath,T const nsteps).

Definition at line 390 of file treeindexedD2test.cpp.

References assertreturnOS, and treeindexedD2< INDX >::move().

Referenced by main().

{
  treeindexedD2<uint> t1;
  string s(
"4 \
1 2 2 0 0 \
2 3 4 1 0 \
3 1 4 2 0 \
4 3 5 2 1");
  stringstream ss(s);
  ss >> t1;
  
  cout << (stringc)t1 << endl << endl;

  t1.move(0*1+1*2,2);
  assertreturnOS(t1.current->index==4);
  t1.move(1*1,1);
  assertreturnOS(t1.current->index==2);
  t1.move(0*1+1*2+0*4,3);
  assertreturnOS(t1.current->index==3);
  t1.move(0*1+1*2+1*4,3);
  assertreturnOS(t1.current->index==5);
  t1.move(0*1+0*2+1*4,3);
  assertreturnOS(t1.current->index==4);
  t1.move(0*1+0*2+0*4,3);
  assertreturnOS(t1.current->index==1);

  vector< uint > v;
  t1.pathindex(v,0*1+0*2+0*4,3);
  assertreturnOS(v[0]==1);
  assertreturnOS(v[1]==2);
  assertreturnOS(v[2]==3);
  t1.pathindex(v,0*1+1*2+1*4,3);
  assertreturnOS(v[0]==1);
  assertreturnOS(v[1]==2);
  assertreturnOS(v[2]==4);

  return 0;
}

---

The documentation for this class was generated from the following files:

• bsptrees/treeindexedD2test.h
• bsptrees/treeindexedtest.h
• bsptrees/treeindexedD2test.cpp