Periodic_3TriangulationDSCellBase

Navigation: Up Table of Contents Package Overview Bibliography Index Title Acknowledging CGAL

Periodic_3TriangulationDSCellBase_3

Definition

At the base level (see Sections 39.5 and 38.2), a cell stores handles to its four vertices and to its four neighbor cells. The vertices and neighbors are indexed 0, 1, 2 and 3. Neighbor i lies opposite to vertex i.

Refines

TriangulationDSCellBase_3

For periodic triangulation the cell base class needs to additionally store an offset for each vertex. Only the last three bits of each integer are required to be stored. The remaining part does not contain any information.

Access Functions

int

c.offset ( int i)

Returns the offset of vertex i.

Precondition:

i ∈ {0, 1, 2, 3}.

Setting

void	c.set_offsets ( int off0, int off1, int off2, int off3)
		Sets the vertex offsets according to off0 to off3.

Has Models

CGAL::Periodic_3_triangulation_ds_cell_base_3