Modules/ImageProcessor/VLCImageProcessor/VLCClusterliste.cpp

Go to the documentation of this file.

#include "VLCClusterliste.h"
using namespace std;

VLCClusterliste::VLCClusterliste(){
}


/*a method that add a cluster to the clusterlist and updates the navigation information in vNavi/hNavi.
 * if v equals to true, the direction of scanning is vertical and the iterator i gives the position of the new cluster
 * in vNavi.
 * if v equals to false, the direction of scanning is horizontal and the iterator i gives the position of the new 
 * cluster in hNavi.
 */
void VLCClusterliste::addCluster(VLCCluster c, list<list<VLCCluster>::iterator>::iterator i, bool v)
{
  /* clusterliste clist is empty, so the cluster can be inserted at the front of clist and the navigation-information 
   * at the front of vNavi and hNavi.
   * the cluster stores the iterators of the elements in vNavi and hNavi, which points on it.
   */
  if(clist.empty())
  {
    //inserting the elements at the front
    
    clist.push_front(c);
    vNavi.push_front(clist.begin());
    hNavi.push_front(clist.begin());
    
    //store the iterators of the element of vNavi and hNavi
    clist.begin()->setVPointer(vNavi.begin());
    clist.begin()->setHPointer(hNavi.begin());
  }
  else
  {
    clist.push_front(c);
    vhIter = NULL;
    
    if(v) //if scan-line direction is vertical
    { 
      /* update navigation-information vNavi and hNavi.
       * the position of the new element in vNavi is given: i
       * the position of the new element in hNavi has to be calculated
       */
      vNavi.insert(i,clist.begin());
      //stores the iterator of the element in vNavi, which points on the new inserted cluster
      --i;
      clist.begin()->setVPointer(i);
      
      
      //calculating the position in hNavi
      vhIter = hNavi.begin();
      posGefunden = false;
      while((posGefunden == false) && (vhIter != hNavi.end()))
      {
        cIter = *vhIter;
        if(clist.begin()->getYMin() <= cIter->getYMin())
        {
          posGefunden = true;
        }
        ++vhIter;
      }
      
      
      
      //in case that vhIter doesn´t point to after last element (null)
      if(posGefunden)
      {
        //if posGefunden is set to true, the right position (--vhIter) is found. but at the end of the while-run
        //vhIter will be incremented one time. so that has to be set back through --vhIter.
        --vhIter;
        hNavi.insert(vhIter, clist.begin());
        //stores the iterator of the element in hNavi, which points on the new inserted cluster
        --vhIter;
        clist.begin()->setHPointer(vhIter);
      }

      //in case that the end of the list is reached, the new element will be inserted at the end of hNavi
      else if((posGefunden == false) && (vhIter == hNavi.end()))
      {
        hNavi.push_back(clist.begin());
        //stores the iterator of the element in hNavi, which points on the new inserted cluster
        //hNavi.end() returns the iterator to after last element (null), so last element can be reached through --vhIter
        --vhIter;
        clist.begin()->setHPointer(vhIter);
      }

    }//end of if(v)

    
    
    else //the same process as above for horizontal scan-lines
    {
      /* update navigation-information vNavi and hNavi.
       * the position of the new element in hNavi is given: i
       * the position of the new element in vNavi has to be calculated
       */

      //inserting in hNavi
      hNavi.insert(i,clist.begin());
      //stores the iterator of the element in hNavi, which points on the new inserted cluster
      --i;
      clist.begin()->setHPointer(i);
      
      
      //calculating the position in vNavi
      vhIter = vNavi.begin();
      posGefunden = false;
      while((posGefunden == false) && (vhIter != vNavi.end()))
      {
        cIter = *vhIter;
        if(clist.begin()->getXMin() <= cIter->getXMin())
        {
          posGefunden = true;
        }
        ++vhIter;
      }

      
      
      //in case that vhIter doesn´t point to after last element (null)
      if(posGefunden)
      {
        //if posGefunden is set to true, the right position (--vhIter) is found. but at the end of the while-run
        //vhIter will be incremented one time. so that has to be set back through --vhIter.
        --vhIter;
        vNavi.insert(vhIter, clist.begin());
        --vhIter;
        clist.begin()->setVPointer(vhIter);
      }
      //in case that the end of the list is reached, the new element will be inserted at the end of vNavi
      else if((posGefunden == false) && (vhIter == vNavi.end()))
      {
        vNavi.push_back(clist.begin());
        --vhIter;
        clist.begin()->setVPointer(vhIter);
      }
      
      
    }//end of else() of if(v)


  }//end else() of if(clist.empty())

}//end of addCluster



//a method that delete all clusters and navigation information
void VLCClusterliste::deleteAll()
{
  clist.clear();
  vNavi.clear();
  hNavi.clear();
  midlist.clear();
}



//this method is used in clustering. rc is a iterator that points on the element of clist that contains the cluster
//which should be removed
void VLCClusterliste::removeCluster(list<VLCCluster>::iterator rc)
{
  //navigation-information of this cluster (elements in vNavi and hNavi)will be removed first
  
  //vNavi
  vhIter = rc->getVPointer();
  vNavi.erase(vhIter);
  
  //hNavi
  vhIter = rc->getHPointer(); 
    hNavi.erase(vhIter);
  
  //clist
  cIter = clist.erase(rc);
  
}


//return of a list,which stores the midpoints of the cluster
list<Vector2<double> > VLCClusterliste::getMidpoints()
{
  midlist.clear();
  for(cIter = clist.begin(); cIter != clist.end(); ++cIter )
  {
    midlist.push_back(cIter->getMidpoint());  
  }
  return(midlist);
}


list<VLCCluster>::iterator VLCClusterliste::getCListBegin()
{
  return(clist.begin());
}


list<VLCCluster>::iterator VLCClusterliste::getCListEnd()
{
  return(clist.end());
}



list<list<VLCCluster>::iterator>::iterator VLCClusterliste::getVNaviBegin()
{
  return(vNavi.begin());
}

list<list<VLCCluster>::iterator>::iterator VLCClusterliste::getVNaviEnd()
{
  return(vNavi.end());
}


list<list<VLCCluster>::iterator>::iterator VLCClusterliste::getHNaviBegin()
{
  return(hNavi.begin());
}



list<list<VLCCluster>::iterator>::iterator VLCClusterliste::getHNaviEnd()
{
  return(hNavi.end());
}


bool VLCClusterliste::getEmpty()
{
  return(clist.empty());
}

---