Rev 537 | Rev 551 | Go to most recent revision | Blame | Compare with Previous | Last modification | View Log | RSS feed
/* ----------------------------------------------------------------------- *
* This file is part of GEL, www.imm.dtu.dk/GEL
* Copyright (C) the authors (see AUTHORS.txt) and DTU Informatics
*
* Principal authors:
* Christian Thode Larsen (thode2d@gmail.com)
* J. Andreas Baerentzen (jab@imm.dtu.dk)
*
* See LICENSE.txt for licensing information
* ----------------------------------------------------------------------- */
#ifndef __HMESH_HALFEDGEWALKER_H__
#define __HMESH_HALFEDGEWALKER_H__
#include "ConnectivityKernel.h"
namespace HMesh
{
class HalfEdgeWalker
{
public:
/// construct from kernel and a halfedge
HalfEdgeWalker(const ConnectivityKernel& _ck, HalfEdgeID _current);
/// returned walker has made one step to the next halfedge
HalfEdgeWalker next() const;
/// returned walker has made one step to the previous halfedge
HalfEdgeWalker prev() const;
/// returned walker has made one step to the opposite halfedge
HalfEdgeWalker opp() const;
/// returned walker has circulated vertex clockwise one step
HalfEdgeWalker circulate_vertex_cw() const;
/// returned walker has circulated vertex counterclockwise one step
HalfEdgeWalker circulate_vertex_ccw() const;
/// returned walker has circulated face clockwise one step
HalfEdgeWalker circulate_face_cw() const;
/// returned walker has circulated face counterclockwise one step
HalfEdgeWalker circulate_face_ccw() const;
/// test if the walker has reached its initial halfedge
bool full_circle() const;
/// number of steps taken
int no_steps() const;
/// get ID of vertex pointed to by current halfedge of walker
VertexID vertex() const;
/// get ID of face owning current halfedge of walker
FaceID face() const;
/// get ID of current halfedge of walker
HalfEdgeID halfedge() const;
/// assignment operator
HalfEdgeWalker operator =(const HalfEdgeWalker& w);
private:
const ConnectivityKernel* ck;
HalfEdgeID current;
HalfEdgeID last;
int counter;
HalfEdgeWalker(const ConnectivityKernel& _ck, HalfEdgeID _current, HalfEdgeID _last, int _counter);
};
inline HalfEdgeWalker::HalfEdgeWalker(const ConnectivityKernel& _ck, HalfEdgeID _current)
: ck(&_ck), current(_current), last(_current), counter(0){}
inline HalfEdgeWalker::HalfEdgeWalker(const ConnectivityKernel& _ck, HalfEdgeID _current, HalfEdgeID _last, int _counter)
: ck(&_ck), current(_current), last(_last), counter(_counter){}
inline HalfEdgeWalker HalfEdgeWalker::next() const
{ return HalfEdgeWalker(*ck, ck->next(current), last, counter + 1); }
inline HalfEdgeWalker HalfEdgeWalker::prev() const
{ return HalfEdgeWalker(*ck, ck->prev(current), last, counter + 1); }
inline HalfEdgeWalker HalfEdgeWalker::opp() const
{ return HalfEdgeWalker(*ck, ck->opp(current), last, counter + 1); }
inline HalfEdgeWalker HalfEdgeWalker::circulate_vertex_cw() const
{ return HalfEdgeWalker(*ck, ck->next(ck->opp(current)), last, counter + 1); }
inline HalfEdgeWalker HalfEdgeWalker::circulate_vertex_ccw() const
{ return HalfEdgeWalker(*ck, ck->opp(ck->prev(current)), last, counter + 1); }
inline HalfEdgeWalker HalfEdgeWalker::circulate_face_cw() const
{ return HalfEdgeWalker(*ck, ck->prev(current), last, counter + 1); }
inline HalfEdgeWalker HalfEdgeWalker::circulate_face_ccw() const
{ return HalfEdgeWalker(*ck, ck->next(current), last, counter + 1); }
inline bool HalfEdgeWalker::full_circle() const
{ return (counter > 0 && current == last) ? true : false; }
inline int HalfEdgeWalker::no_steps() const
{ return counter; }
inline VertexID HalfEdgeWalker::vertex() const
{ return ck->vert(current); }
inline FaceID HalfEdgeWalker::face() const
{ return ck->face(current); }
inline HalfEdgeID HalfEdgeWalker::halfedge() const
{ return current; }
inline HalfEdgeWalker HalfEdgeWalker::operator =(const HalfEdgeWalker& w)
{
current = w.current;
counter = w.counter;
ck = w.ck;
last = w.last;
return *this;
}
}
#endif