Navigation: Up, Table of Contents, Bibliography, Index, Title Page

Creation

Constrained_face_base f;
default constructor.

Constrained_face_base f ( void* v0, void* v1, void* v2);
constructor setting the incident vertices.

Constrained_face_base f ( void* v0,
void* v1,
void* v2,
void* n0,
void* n1,
void* n2);
constructor setting the incident vertices and the neighboring faces.

Constrained_face_base f ( void* v0,
void* v1,
void* v2,
void* n0,
void* n1,
void* n2,
bool c0,
bool c1,
bool c2);
constructor setting the incident vertices, the neighboring faces and the constrained or constrained status of the edges of the face

Access Functions

bool f.is_constrained ( int i)
returns true if the edge between f and its neighbor f.neighbor(i) is constrained.
Precondition: 0 i 2.

Modifiers

void f.set_constraint ( int i, bool b)
sets the edge between f and its neighbor f.neighbor(i) as a constrained or unconstrained edge according to b.

void f.set_constraints ( bool c0, bool c1, bool c2)
sets the status (constrained or unconstrained) of the three edges of f.

void f.reorient () Changes the orientation of fby exchanging vertex(0) with vertex(1) and neighbor(0) with neighbor(1) and the corresponding constrained status.

void f.ccw_permute () preforms a counterclockwise permutation of the vertices, neighbors and constrained status of f.

void f.cw_permute () preforms a clockwise permutation of the vertices and neighbors and constrained status of f.


begin of advanced section

Miscelleanous

bool f.is_valid () tests the validity of face f as a face of a plain triangulation and additionally checks if the edges of f are consistently marked as constrained or unconstrained edges in face fand its neighbors.

end of advanced section
Next: Class declaration of Constrained_triangulation_demo_2<Gt,Tds>
Navigation: Up, Table of Contents, Bibliography, Index, Title Page
The GALIA project. Jan 18, 2000.