kev.cpp

Go to the documentation of this file.

/**
 *\file         kev.cpp
 *
 *\brief        merging edge cycles at 2 neighboring vertices.
 *
 *              kev(e) is inverse of mev: edge cycle (at tail of e) is merged to that at head of e.
 *
 *\author       Xianming Chen\n
 *              Computer Science Department\n
 *              University of Utah
 *
 *\date         16 Aug 2006\n
 *              Copyright (c) 2006, University of Utah
 */



#include "print.h"
#include <cassert>

namespace euler
{
  void solid_t :: kev(edge_t* e)
  { 
    assert(e->l->f != e->o->l->f); 
    return _kev(e); 
  }            

  void solid_t :: _kev(edge_t* e)
  {
    assert(e->o);
    
    edge_t *front = e->o->nxt, *end = e->nxt;
    vertex_t *v1 = end->v, *v2 = e->v;

    del_edge_pair(e);

    if(e->o->nxt != e)
      if(!front->o)
        front->v = front->nxt->v = v1;
      else
        for(; front != end; front = front->o->nxt)
          front->v = v1;

    del_vertex(v2);

    solid_t::assert_consistent_B_rep();
  }

  void loop_t :: kev(edge_t* e)              
  { 
    assert(e->l == e->o->l);
    f->s->_kev(e);
  }  


}//end namespace euler
 

---