bsptreeD2disp02.h

Go to the documentation of this file.

#ifndef BSPTREED2DISP02_H
#define BSPTREED2DISP02_H

#include <bsptreeD2.h>
#include <gobj.h>
#include <treeindexedD2iter.h>


template< typename PT, typename PD, typename INDX >
class bsptreeD2disp02 : public gobjContainer
{
public:

  bsptreeD2<PT,PD,INDX> & bsp;

  PD tmin;
  PD tmax;
  
  bsptreeD2disp02
  ( 
    bsptreeD2<PT,PD,INDX> & bsp_,
    PD const tmin_,
    PD const tmax_
  )
    : gobjContainer(true), bsp(bsp_), tmin(tmin_), 
      tmax(tmax_) {}

  void update();


};

//---------------------------------------------------------
//  Implementation

template< typename PT, typename PD, typename INDX >
void bsptreeD2disp02<PT,PD,INDX>::update()
{
  nuke();

  push(new gobjglBegin(GL_LINES));

  PT La;
  PT Lm;

  PD t0;
  PD t1;

  uint index;
  uint index2;

  for ( treeindexedD2iterinternal<INDX> i1(bsp.tree); 
    !i1; ++i1 )
  {
    halfspaceD2<PT,PD> & h1(bsp.vi[i1()->index]);

    Lm = h1.p1-h1.p0;
    La = h1.p0;

    t0 = tmin;
    t1 = tmax;

    uint sz = i1.path.size();
    if (sz<=1)
    {
      if (sz==0)
        continue;

      push(new gobjglColor3f(0.0,0.0,1.0));
      push(new gobjglVertex3d(La+Lm*t0));
      push(new gobjglColor3f(1.0,0.0,0.0));
      push(new gobjglVertex3d(La+Lm*t1));
      
      continue;
    }

    --sz;
    for (uint i=0; i<sz; ++i)
    {
      //cout << SHOW(i1.path[i]->index) << endl;
      index = i1.path[i]->index;
      index2 = i1.path[i+1]->index;

      if ( i1.path[i]->isleftinternal(index2) )
        bsp.vi[index].clip(t0,t1,La,Lm);
      else
      {
        if ( i1.path[i]->isrightinternal(index2) )
        {
          bsp.vi[index].clipNeg(t0,t1,La,Lm);
        }
        else
          assert(false);
      }
    }

    push(new gobjglColor3f(0.0,0.0,1.0));
    push(new gobjglVertex3d(La+Lm*t0));
    push(new gobjglColor3f(1.0,0.0,0.0));
    push(new gobjglVertex3d(La+Lm*t1));
  }

  push(new gobjglEnd());
}


#endif