The concept TriangulationDataStructure_3::Cell stores four Vertex_handles to its four vertices and four Cell_handles to its four neighbors. The vertices are indexed 0, 1, 2, and 3 in consistent order. The neighbor indexed lies opposite to vertex i.
In degenerate dimensions, cells are used to store faces of maximal dimension: in dimension 2, each cell represents only one facet of index 3, and 3 edges , and ; in dimension 1, each cell represents one edge . (See also Section 32.1.)
| ||
|
||
| ||
|
||
| ||
|
In order to obtain new cells or destruct unused cells, the user must call the create_cell() and delete_cell() methods of the triangulation data structure.
|
|
Returns the vertex i of c.
| ||
|
|
Returns the index of vertex v in c.
| ||
|
| Returns true if v is a vertex of c. | ||
|
| |||
Returns true if v is a vertex of c, and computes its index i in c. | ||||
|
|
Returns the neighbor i of c.
| ||
|
|
Returns the index corresponding to neighboring cell n.
| ||
|
| Returns true if n is a neighbor of c. | ||
|
| |||
Returns true if n is a neighbor of c, and computes its index i in c. |
|
| |||
Sets vertex i to v.
| ||||
|
| |||
Sets the vertex pointers. | ||||
|
| |||
Sets neighbor i to n.
| ||||
|
| |||
Sets the neighbors pointers. |
|
| |
User defined local validity checking function. |
TriangulationDataStructure_3::Vertex.