|
versor
3.0
C++11 library for Geometric algebra
|
This is the complete list of members for vsr::HEGraph< T >, including all inherited members.
| add(T &v) (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| addAt(T &v, HalfEdge &e) (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| addAt(T &v, int x) (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| addNode(T &v) (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| clear() (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| close(HalfEdge &ha, HalfEdge &hb) | vsr::HEGraph< T > | inline |
| close(HalfEdge &e, Node &n) (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| close(HalfEdge &e) (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| edge(int idx) (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| edge() (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| edge() const (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| edgeLoop(vector< HalfEdge * > loop) (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| edgeLoop0(vector< HalfEdge * > loop) (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| emanatingEdges(vector< HalfEdge * > loop) (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| face(int idx) (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| face() (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| face() const (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| facet(HalfEdge *ea, HalfEdge *eb, HalfEdge *ec, Face *f) (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| fillFace(int a, int b, int c) (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| firstNull() | vsr::HEGraph< T > | inline |
| hasBorder() | vsr::HEGraph< T > | inline |
| insert(T &pa, HalfEdge &e) (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| lastEdge() (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| lastFace() (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| lastNode() (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| node(int idx) (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| node() (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| node() const (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| nullEdgeLoop() | vsr::HEGraph< T > | inline |
| nullEdges() | vsr::HEGraph< T > | inline |
| removeEdge(int idx) (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| removeFacet(int idx) (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| reset() (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| seed(T &a, T &b, T &c, T &d) (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| seedNodes() (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | inline |
| UV(int w, int h, S &p, bool bCloseU=false, bool bCloseV=false) (defined in vsr::HEGraph< T >) | vsr::HEGraph< T > | |
| UV(int w, int h, S &p, bool bCloseU, bool bCloseV) | vsr::HEGraph< T > | inline |
1.8.10