#include <dataStructure.h>
Public Attributes | |
icVector2 | attract_normal |
bool | attract_visited |
bool | BoundaryVisited |
int | index |
icVector2 | intersections [2] |
icMatrix2x2 | Jacobian |
QuadEdge * | next |
int | num_intersections |
bool | OnAttractBoundary |
bool | OnBoundary |
bool | OnRepellBoundary |
icVector2 | repell_normal |
bool | repell_visited |
int | tris [2] |
int | verts [2] |
bool | visited |
Definition at line 59 of file dataStructure.h.
Definition at line 72 of file dataStructure.h.
Definition at line 70 of file dataStructure.h.
Definition at line 78 of file dataStructure.h.
int QuadEdge::index |
Definition at line 60 of file dataStructure.h.
----- For recording the intersections -----
Definition at line 84 of file dataStructure.h.
Definition at line 81 of file dataStructure.h.
Definition at line 88 of file dataStructure.h.
Definition at line 85 of file dataStructure.h.
Definition at line 68 of file dataStructure.h.
bool QuadEdge::OnBoundary |
Definition at line 77 of file dataStructure.h.
Definition at line 67 of file dataStructure.h.
Definition at line 71 of file dataStructure.h.
Definition at line 69 of file dataStructure.h.
int QuadEdge::tris[2] |
Definition at line 62 of file dataStructure.h.
int QuadEdge::verts[2] |
Definition at line 61 of file dataStructure.h.
bool QuadEdge::visited |
Definition at line 63 of file dataStructure.h.