#include <Vertex.h>
Definition at line 11 of file Vertex.h.
Public Member Functions | |
Vertex (const Vector3 &_pos=Vector3(0, 0, 0)) | |
void | assignData (const Vertex &rhs) |
bool | isBoundary () |
EdgeAroundIterator | iterator () |
EdgeAroundIterator | iterator (Edge *eFrom) |
int | getValence () |
Public Attributes | |
Edge * | edge |
Vector3 | p |
Vector3 | uv |
double | min_cone_angle |
double | max_cone_angle |
bool | constrained |
double | cone_angle |
int | ID |
int | patchID |
bool | check |
Private Member Functions | |
const Vertex & | operator= (const Vertex &rhs) |
Classes | |
class | EdgeAroundIterator |
The iterator that visits edges or vertices in one ring of the current face in order. More... |
|
Definition at line 37 of file Vertex.h. 00037 : 00038 edge(NULL), p(_pos), uv(0,0,0) 00039 { 00040 cone_angle = min_cone_angle = max_cone_angle = 2; 00041 constrained = false; 00042 patchID = 0; 00043 }
|
|
Definition at line 46 of file Vertex.h. 00046 { 00047 if (this != &rhs) { 00048 p = rhs.p; 00049 uv = rhs.uv; 00050 cone_angle = rhs.cone_angle; 00051 min_cone_angle = rhs.min_cone_angle; 00052 max_cone_angle = rhs.max_cone_angle; 00053 } 00054 }
|
|
Definition at line 93 of file Vertex.h. 00093 { 00094 Vertex::EdgeAroundIterator iter = iterator(); 00095 int res = 0; 00096 for (; !iter.end(); iter++) 00097 res++; 00098 return res; 00099 }
|
|
Definition at line 57 of file Vertex.h.
|
|
Definition at line 91 of file Vertex.h.
|
|
Definition at line 90 of file Vertex.h. 00090 {return EdgeAroundIterator(edge);}
|
|
Definition at line 14 of file Vertex.h.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|