TriangulationDataStructure_2

Definition

The concept TriangulationDataStructure_2 describes the requirements for the second template parameter of the basic triangulation class Triangulation_2<Traits,Tds> and of all other 2D triangulation classes.

The concept can be seen as a container for the faces and vertices of the triangulation. The concept TriangulationDataStructure_2 includes two sub-concepts TriangulationDataStructure_2::Vertex and TriangulationDataStructure_2::Face.

The TriangulationDataStructure_2 maintains incidence and adjacency relations among vertices and faces.

Each triangular face gives access to its three incident vertices and to its three adjacent faces. Each vertex gives access to one of its incident faces and through that face to the circular list of its incident faces.

The three vertices of a face are indexed with 0, 1 and 2. The neighbors of a face are also indexed with 0,1,2 in such a way that the neighbor indexed by i is opposite to the vertex with the same index.

Each edge has two implicit representations : the edge of a face f which is opposed to the vertex indexed i, can be represented as well as an edge of the neighbor(i) of f. See Figure 29.2

The triangulation data structure is responsible for the combinatorial integrity of the triangulation. This means that the triangulation data structure allows to perform some combinatorial operations on the triangulation and guarantees the maintenance on proper incidence and adjacency relations among the vertices and faces. The term combinatorial operations means that those operations are purely topological and do not depend on the geometric embedding. Insertion of a new vertex in a given face, or in a given edge, suppression of a vertex of degree three, flip of two edges are examples of combinatorial operations.

Types

Vertices and faces are accessed via Vertex_handle and Face_handle. These types are models of the concept Handles which basically supports the two dereference operators * and ->.

The following iterators allow one to visit all the vertices, edges and faces of a triangulation data structure. They are all bidirectional, non-mutable iterators.

The following circulators allow to visit all the edges or faces incident to a given vertex and all the vertices adjacent to a given vertex. They are all bidirectional and non mutable.

Iterators and circulators are convertible to the corresponding handles, thus they can be passed directly as argument to the functions expecting a handle.

Creation

Access Functions

advanced

Setting

void

tds.set_dimension ( int n)

sets the dimension.

advanced

Queries

Traversing the triangulation

Three circulator classes allow to traverse the edges or faces incident to a vertex or the vertices adjacent to this vertex.. A face circulator is invalidated by any modification of the face it points to. An edge circulator is invalidated by any modification of anyone of the two faces incident to the edge pointed to. A vertex circulator that turns around vertex v and that has as value a pointer to vertex w, is invalidated by any modification of anyone of the two faces incident to v and w.

Modifiers

Figure 30.4:  Flip.

advanced

The following modifiers are required for convenience of the advanced user. They do not guarantee the combinatorial validity of the resulting triangulation.

template< class EdgeIt>
Vertex_handle	tds.star_hole ( EdgeIt edge_begin, EdgeIt edge_end)
		creates a new vertex v and use it to star the hole whose boundary is described by the sequence of edges [edge_begin, edge_end[. Returns a pointer to the vertex.
template< class EdgeIt, class FaceIt>
Vertex_handle	tds.star_hole ( EdgeIt edge_begin, EdgeIt edge_end, FaceIt face_begin, FaceIt face_end)
		same as above, except that, to build the new faces, the algorithm first recycles faces in the sequence [face_begin, face_end[ and create new ones when the sequence is exhausted.
template< class EdgeIt>
void	tds.star_hole ( Vertex_handle v, EdgeIt edge_begin, EdgeIt edge_end)
		uses vertex v to star the hole whose boundary is described by the sequence of edges[edge_begin, edge_end[.
template< class EdgeIt, class FaceIt>
void	tds.star_hole ( Vertex_handle v, EdgeIt edge_begin, EdgeIt edge_end, FaceIt face_begin, FaceIt face_end)
		same as above, recycling faces in the sequence [face_begin, face_end[ .
void	tds.make_hole ( Vertex_handle v, List_edges& hole)
		removes the vertex v, and store in hole the list of edges on the boundary of the hole.
Vertex_handle	tds.create_vertex ()	adds a new vertex.
Face_handle	tds.create_face ( Face_handle f1, int i1, Face_handle f2, int i2, Face_handle f3, int i3)
		adds a face which is the neighbor i1 of f1, i2 of f2 and i3 of f3.
Face_handle	tds.create_face ( Face_handle f1, int i1, Face_handle f2, int i2)
		adds a face which is the neighbor i1 of f1, and the neighbor i2 of f2.
Face_handle	tds.create_face ( Face_handle f1, int i1, Vertex_handle v)
		adds a face which is the neighbor i1 of f1, and has v as vertex.
Face_handle	tds.create_face ( Vertex_handle v1, Vertex_handle v2, Vertex_handle v3)
		adds a face with vertices v1, v2 and v3.
Face_handle	tds.create_face ( Vertex_handle v1, Vertex_handle v2, Vertex_handle v3, Face_handle f1, Face_handle f2, Face_handle f3)
		adds a face with vertices v1, v2 and v3, and neighbors f1, f2, f3.
Face_handle	tds.create_face ()	adds a face whose vertices and neighbors are set to NULL.
void	tds.delete_face ( Face_handle)	deletes a face.
void	tds.delete_vertex ( Vertex_handle)
		deletes a vertex.

advanced

Miscellaneous

int	tds.ccw ( int i)	returns $$i+1 modulo 3. Precondition:  $$0 i 2.
int	tds.cw ( int i)	returns $$i+2 modulo 3. Precondition:  $$0 i 2.
bool	tds.is_valid ()	checks the combinatorial validity of the triangulation: call the is_valid() member function for each vertex and each face, checks the number of vertices and the Euler relation between numbers of vertices, faces and edges.
size_type	tds.degree ( Vertex_handle v)	Returns the degree of v in the triangulation.

I/O

The information output in the iostream is: the dimension, the number of (finite) vertices, the number of (finite) faces. Then comes for each vertex, the non combinatorial information stored in that vertex if any. Then comes for each faces, the indices of its vertices and the non combinatorial information (if any) stored in this face. Then comes for each face again the indices of the neighboring faces. The index of an item (vertex of face) the rank of this item in the output order. When dimension $$< 2, the same information is output for faces of maximal dimension instead of faces.

Has Models

See Also