bsptreeD2dispregions01< PT, PD, INDX > Class Template Reference

Display a bsp tree's partition regions with numbers. More...

#include <bsptreeD2dispregions01.h>

Inheritance diagram for bsptreeD2dispregions01< PT, PD, INDX >:

Collaboration diagram for bsptreeD2dispregions01< PT, PD, INDX >:

List of all members.

Public Member Functions
	bsptreeD2dispregions01 (bsptreeD2< PT, PD, INDX > &bsp_)
	Constructor initializes but does not realize.
void	update ()
	Call update to write the graphics to itself.
Public Attributes
PD	delta
	Adjusts the region numbers away from the half-space intersection.
bsptreeD2< PT, PD, INDX > &	bsp
	The bsp tree being displayed.

---

Detailed Description

template<typename PT, typename PD, typename INDX>
class bsptreeD2dispregions01< PT, PD, INDX >

Display a bsp tree's partition regions with numbers.

Definition at line 14 of file bsptreeD2dispregions01.h.

---

Constructor & Destructor Documentation

template<typename PT, typename PD, typename INDX>

bsptreeD2dispregions01< PT, PD, INDX >::bsptreeD2dispregions01

(

bsptreeD2< PT, PD, INDX > &

bsp_

)

[inline]

Constructor initializes but does not realize.

Definition at line 25 of file bsptreeD2dispregions01.h.

    : gobjContainer(true), delta(0.2), bsp(bsp_) {}

---

Member Function Documentation

template<typename PT , typename PD , typename INDX >

void bsptreeD2dispregions01< PT, PD, INDX >::update

(

)

[inline]

Call update to write the graphics to itself.

Definition at line 37 of file bsptreeD2dispregions01.h.

References bsptreeD2dispregions01< PT, PD, INDX >::bsp, bsptreeD2dispregions01< PT, PD, INDX >::delta, halfspaceD2< PT, PD >::intersection(), halfspaceD2< PT, PD >::normal, gobjContainer::nuke(), halfspaceD2< PT, PD >::p0, halfspaceD2< PT, PD >::p1, and gobjContainer::push().

Referenced by bsptree001::bsptree001(), treeindexedD2test::test03(), and treeindexedD2test::test05().

{
  nuke();

  if (bsp.empty())
    return;

  uint sz;

  INDX region;

  INDX hpindex;
  INDX hindex;


//  gobjQuadric * q2 = new gobjQuadric();
//  q2->radius = 0.05;
//  q2->slices=30;
//  q2->loops=7;

  PT parentnormal;
  PT hnormal;

  vector<PT> ptlist;
  vector<string> ptlabels;

  for ( treeindexedD2iterleaf<INDX> i1(bsp.tree); !i1; ++i1)
  {

    region = i1()->index;

//cout << SHOW(region) << endl;

    sz = i1.path.size();
    if (sz<3)
    {
      if (sz!=2)
        continue;

      hindex = i1.path[0]->index;
//cout << SHOW(hindex) << endl;
//cout << SHOW(bsp.vi.size()) << endl;

assert(hindex<bsp.vi.size());
      halfspaceD2<PT,PD> & h( bsp.vi[ hindex ] );

      PT p0 = (h.p0 + h.p1)*0.5;
      parentnormal=h.normal;
//cout << SHOW(parentnormal) << endl;
      parentnormal.normalize();
      parentnormal *= delta;
//cout << SHOW(parentnormal) << endl;
      if (i1.path[0]->isright(region))
        parentnormal *= -1;

//cout << SHOW(p0) << endl;
      p0 += parentnormal;
//cout << SHOW(p0) << endl;

      ptlist.push_back(p0);

      {
        stringstream ss;
        ss << region;
        ptlabels.push_back(ss.str());
      }

      continue;
    }

    hpindex = i1.path[sz-3]->index;
    hindex = i1.path[sz-2]->index;
    // h2 is the parent half-space of h1.
    halfspaceD2<PT,PD> & hp( bsp.vi[ hpindex ] );
    halfspaceD2<PT,PD> & h( bsp.vi[ hindex ] );

//cout << SHOW(region) << "  " << SHOW(hpindex) << "  " << SHOW(hindex) << endl;
//cout << "hp:  " << hp.print() << endl;
//cout << "h:   " << h.print() << endl;

    PT p0;
    h.intersection(p0,hp.p0,hp.p1);

    parentnormal=hp.normal;
    parentnormal.normalize();
    parentnormal *= delta;
//cout << SHOW(parentnormal) << endl;
//cout << SHOW(i1.path[sz-3]->isrightinternal(hindex)) << endl;

    if (i1.path[sz-3]->isrightinternal(hindex))
      parentnormal *= -1;
//cout << SHOW(parentnormal) << endl;

    p0 += parentnormal;
//cout << SHOW(p0) << endl;

    hnormal = h.normal;
    hnormal.normalize();
    hnormal *= delta;

    if (i1.path[sz-2]->isright(region))
      hnormal *= -1;

//cout << SHOW(hnormal) << endl;

    p0 += hnormal;

//cout << SHOW(p0) << endl;
//cout << endl;
  
    ptlist.push_back(p0);

    {
      stringstream ss;
      ss << region;
      ptlabels.push_back(ss.str());
    }
      
//    push(new gobjMySphereDraw(p0,q2));

  }

  push(new gobjglPushAttrib(GL_LIGHTING));
  push(new gobjglPushAttrib(GL_CURRENT_BIT));

  push(new gobjglDisable(GL_LIGHTING));

  push(new gobjglColor3f(1.0,0.0,0.0));

  pointsdisplay2D< PT > pd( *this, ptlist, ptlabels );
  
  push(new gobjglPopAttrib());
  push(new gobjglPopAttrib());
}

---

Member Data Documentation

template<typename PT, typename PD, typename INDX>

bsptreeD2<PT,PD,INDX>& bsptreeD2dispregions01< PT, PD, INDX >::bsp

The bsp tree being displayed.

Definition at line 23 of file bsptreeD2dispregions01.h.

Referenced by bsptreeD2dispregions01< PT, PD, INDX >::update().

template<typename PT, typename PD, typename INDX>

PD bsptreeD2dispregions01< PT, PD, INDX >::delta

Adjusts the region numbers away from the half-space intersection.

Definition at line 20 of file bsptreeD2dispregions01.h.

Referenced by bsptree001::bsptree001(), treeindexedD2test::test03(), treeindexedD2test::test05(), and bsptreeD2dispregions01< PT, PD, INDX >::update().

---

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

• bsptrees/bsptreeD2dispregions01.h