|
The class Triangulation_3 represents a 3-dimensional tetrahedralization of points.
#include <CGAL/Triangulation_3.h>
The first template argument must be a model of the TriangulationTraits_3 concept.
The second template argument must be a model of the TriangulationDataStructure_3 concept. It has the default value Triangulation_data_structure_3< Triangulation_vertex_base_3<TriangulationTraits_3>,Triangulation_cell_base_3<TriangulationTraits_3> >.
|
| ||
|
|
||
|
|
|
|
|
| ||
|
|
||
|
| ||
|
|
||
|
| ||
|
|
||
|
| ||
|
|
||
Only vertices (0-faces) and cells (3-faces) are stored. Edges (1-faces) and facets (2-faces) are not explicitly represented and thus there are no corresponding classes (see Section 37.1).
|
| ||
|
|
||
|
| ||
|
|
||
|
| ||
|
|
||
|
| ||
|
|
||
The vertices and faces of the triangulations are accessed through handles, iterators and circulators. A handle is a model of the Handle concept, and supports the two dereference operators operator* and operator->. A circulator is a model of the concept Circulator. Iterators and circulators are bidirectional and non-mutable. The edges and facets of the triangulation can also be visited through iterators and circulators which are bidirectional and non-mutable.
Iterators and circulators are convertible to the corresponding handles, thus the user can pass them directly as arguments to the functions.
|
| ||
|
| handle to a vertex | |
|
| ||
|
| handle to a cell | |
|
| ||
|
| Reference to a simplex (vertex, edge, facet or cell) of the triangulation | |
|
| ||
|
| Size type (an unsigned integral type) | |
|
| ||
|
| Difference type (a signed integral type) | |
|
| ||
|
| iterator over cells | |
|
| ||
|
| iterator over facets | |
|
| ||
|
| iterator over edges | |
|
| ||
|
| iterator over vertices | |
|
| ||
|
| circulator over all cells incident to a given edge | |
|
| ||
|
| circulator over all facets incident to a given edge | |
The triangulation class also defines the following enum type to specify which case occurs when locating a point in the triangulation.
|
|
|
| |||
|
Introduces a triangulation t having only one vertex which is the
infinite vertex.
| |||
|
| |||
|
Copy constructor. All vertices and faces are duplicated.
| |||
|
| |||
| |||
|
Equivalent to constructing an empty triangulation with the optional
traits class argument and calling insert(first,last).
| |||
|
|
| The triangulation tr is duplicated, and modifying the copy after the duplication does not modify the original. The previous triangulation held by t is deleted. |
|
|
| The triangulations tr and t are swapped. t.swap(tr) should be preferred to t = tr or to t(tr) if tr is deleted after that. Indeed, there is no copy of cells and vertices, thus this method runs in constant time. |
|
|
| Deletes all finite vertices and all cells of t. |
|
| ||
|
|
| |
| Equality operator. Returns true iff there exist a bijection between the vertices of t1 and those of t2 and a bijection between the cells of t1 and those of t2, which preserve the geometry of the triangulation, that is, the points of each corresponding pair of vertices are equal, and the tetrahedra corresponding to each pair of cells are equal (up to a permutation of their vertices). | ||
|
| ||
|
|
| |
| The opposite of operator==. | ||
|
|
| Returns a const reference to the geometric traits object. |
|
|
| Returns a const reference to the triangulation data structure. |
|
|
| Returns a reference to the triangulation data structure. |
This method is mainly a help for users implementing their own triangulation algorithms.
|
|
| Returns the dimension of the affine hull. |
|
|
| Returns the number of finite vertices. |
|
|
| Returns the number of cells or 0 if t.dimension()<3. |
|
|
| Returns the infinite vertex. |
|
|
| Returns a cell incident to the infinite vertex. |
As previously said, the triangulation is a collection of cells that are either infinite or represent a finite tetrahedra, where an infinite cell is a cell incident to the infinite vertex. Similarly we call an edge (resp. facet) infinite if it is incident to the infinite vertex.
|
|
| |||
Returns the tetrahedron formed by the four vertices of c.
| ||||
|
|
| |||
Returns the triangle formed by the three vertices of facet
(c,i). The triangle is oriented so that its normal points to the
inside of cell c.
| ||||
|
|
|
Same as the previous method for facet f.
| ||
|
|
|
Returns the line segment formed by the vertices of e.
| ||
|
|
| |||
Same as the previous method for edge (c,i,j).
| ||||
|
|
| |||
Returns the point given by vertex i of cell c.
| ||||
|
|
|
Same as the previous method for vertex v.
| ||
|
|
| |||
| true, iff vertex v is the infinite vertex. | ||||
|
|
| |||
true, iff c is incident to the infinite vertex.
| ||||
|
|
| |||
true, iff the facet i of cell c is incident to the
infinite vertex.
| ||||
|
|
|
true iff facet f is incident to the infinite vertex.
| ||
|
|
| |||
true, iff the edge (i,j) of cell c is incident to
the infinite vertex.
| ||||
|
|
|
true iff edge e is incident to the infinite vertex.
| ||
|
|
| |||
| Tests whether p is a vertex of t by locating p in the triangulation. If p is found, the associated vertex v is given. | ||||
|
|
| |||
| Tests whether v is a vertex of t. | ||||
|
|
| |||
Tests whether (u,v) is an edge of t. If the edge is found,
it gives a cell c having this edge and the indices i
and j of the vertices u and v in c, in this order.
| ||||
|
|
| |||
Tests whether (u,v,w) is a facet of t. If the facet is found,
it computes a cell c having this facet and the indices i,
j and k of the vertices u, v and w in c,
in this order.
| ||||
|
|
| Tests whether c is a cell of t. | ||
|
|
| |||
Tests whether (u,v,w,x) is a cell of t.
If the cell c is found, the method
computes the indices i, j, k and l of the
vertices u, v, w and x in c, in this
order.
| ||||
|
|
| |||
Tests whether (u,v,w,x) is a cell of t and computes
this cell c.
| ||||
There is a method has_vertex in the cell class. The analogous methods for facets are defined here.
|
|
| |||
If v is a vertex of f, then j is the index of
v in the cell f.first, and the method returns true.
| ||||
|
|
| |||
| Same for facet (c,i). Computes the index j of v in c. | ||||
|
|
| |||
|
|
| |||
| Same as the first two methods, but these two methods do not return the index of the vertex. | ||||
The following three methods test whether two facets have the same vertices.
|
|
| |||
|
|
| |||
|
|
| |||
For these three methods:
| ||||
The class Triangulation_3<TriangulationTraits_3,TriangulationDataStructure_3> provides two functions to locate a given point with respect to a triangulation. It provides also functions to test if a given point is inside a finite face or not. Note that the class Delaunay_triangulation_3 also provides a nearest_vertex() function.
|
|
| |||
|
If the point query lies inside the convex hull of the points, the cell
that contains the query in its interior is returned. If query lies on a
facet, an edge or on a vertex, one of the cells having query on
its boundary is returned. If the point query lies outside the convex hull of the points, an infinite cell with vertices { p, q, r, ∞} is returned such that the tetrahedron ( p, q, r, query ) is positively oriented (the rest of the triangulation lies on the other side of facet ( p, q, r )). Note that locate works even in degenerate dimensions: in dimension 2 (resp. 1, 0) the Cell_handle returned is the one that represents the facet (resp. edge, vertex) containing the query point. The optional argument start is used as a starting place for the search. | ||||
|
|
| |||
| Same as above but uses hint as the starting place for the search. | ||||
|
|
| |||
|
If query lies inside the affine hull of the points, the k-face
(finite or infinite) that contains query in its interior is
returned, by means of the cell returned together with lt, which
is set to the locate type of the query (VERTEX, EDGE, FACET, CELL, or OUTSIDE_CONVEX_HULL if the cell is infinite and query
lies strictly in it) and two indices li and lj that
specify the k-face of the cell containing query. If the k-face is a cell, li and lj have no meaning; if it is a facet (resp. vertex), li gives the index of the facet (resp. vertex) and lj has no meaning; if it is and edge, li and lj give the indices of its vertices. If the point query lies outside the affine hull of the points, which can happen in case of degenerate dimensions, lt is set to OUTSIDE_AFFINE_HULL, and the cell returned has no meaning. As a particular case, if there is no finite vertex yet in the triangulation, lt is set to OUTSIDE_AFFINE_HULL and locate returns the default constructed handle. The optional argument start is used as a starting place for the search. | ||||
|
|
| |||
| Same as above but uses hint as the starting place for the search. | ||||
|
|
| |||
|
Returns a value indicating on which side of the oriented boundary
of c the point p lies. More precisely, it returns: - ON_BOUNDED_SIDE if p is inside the cell. For an infinite cell this means that p lies strictly in the half space limited by its finite facet and not containing any other point of the triangulation. - ON_BOUNDARY if p on the boundary of the cell. For an infinite cell this means that p lies on the finite facet. Then lt together with li and lj give the precise location on the boundary. (See the descriptions of the locate methods.) - ON_UNBOUNDED_SIDE if p lies outside the cell. For an infinite cell this means that p does not satisfy either of the two previous conditions.
| ||||
|
|
| |||
|
Returns a value indicating on which side of the oriented boundary
of f the point p lies: - ON_BOUNDED_SIDE if p is inside the facet. For an infinite facet this means that p lies strictly in the half plane limited by its finite edge and not containing any other point of the triangulation . - ON_BOUNDARY if p is on the boundary of the facet. For an infinite facet this means that p lies on the finite edge. lt, li and lj give the precise location of p on the boundary of the facet. li and lj refer to indices in the degenerate cell c representing f. - ON_UNBOUNDED_SIDE if p lies outside the facet. For an infinite facet this means that p does not satisfy either of the two previous conditions.
| ||||
|
|
| |||
| Same as the previous method for the facet (c,3). | ||||
|
|
| |||
|
Returns a value indicating on which side of the oriented boundary
of e the point p lies: - ON_BOUNDED_SIDE if p is inside the edge. For an infinite edge this means that p lies in the half line defined by the vertex and not containing any other point of the triangulation. - ON_BOUNDARY if p equals one of the vertices, li give the index of the vertex in the cell storing e - ON_UNBOUNDED_SIDE if p lies outside the edge. For an infinite edge this means that p lies on the other half line, which contains the other points of the triangulation.
| ||||
|
|
| |||
| Same as the previous method for edge (c,0,1). | ||||
Two kinds of flips exist for a three-dimensional triangulation. They are reciprocal. To be flipped, an edge must be incident to three tetrahedra. During the flip, these three tetrahedra disappear and two tetrahedra appear. Figure 37.10(left) shows the edge that is flipped as bold dashed, and one of its three incident facets is shaded. On the right, the facet shared by the two new tetrahedra is shaded.
Flips are possible only under the following conditions:
- the edge or facet to be flipped is not on the boundary of the convex
hull of the triangulation
- the five points involved are in convex position.
The following methods guarantee the validity of the resulting 3D triangulation.
Flips for a 2d triangulation are not implemented yet
|
|
|
|||
|
|
| |||
| Before flipping, these methods check that edge e=(c,i,j) is flippable (which is quite expensive). They return false or true according to this test. | ||||
|
|
|
|||
|
|
| |||
Should be preferred to the previous methods when the edge is
known to be flippable.
| ||||
|
|
|
|||
|
|
| Before flipping, these methods check that facet f=(c,i) is flippable (which is quite expensive). They return false or true according to this test. | ||
|
|
|
|||
|
|
| |||
Should be preferred to the previous methods when the facet is
known to be flippable.
| ||||
The following operations are guaranteed to lead to a valid triangulation when they are applied on a valid triangulation.
|
|
| |||
|
Inserts point p in the triangulation and returns the corresponding
vertex. If point p coincides with an already existing vertex, this vertex is returned and the triangulation remains unchanged. If point p lies in the convex hull of the points, it is added naturally: if it lies inside a cell, the cell is split into four cells, if it lies on a facet, the two incident cells are split into three cells, if it lies on an edge, all the cells incident to this edge are split into two cells. If point p is strictly outside the convex hull but in the affine hull, p is linked to all visible points on the convex hull to form the new triangulation. See Figure 37.11. If point p is outside the affine hull of the points, p is linked to all the points, and the dimension of the triangulation is incremented. All the points now belong to the boundary of the convex hull, so, the infinite vertex is linked to all the points to triangulate the new infinite face. See Figure 37.12. The optional argument start is used as a starting place for the search. | ||||
|
|
| |||
| Same as above but uses hint as the starting place for the search. | ||||
|
|
| |||
| Inserts point p in the triangulation and returns the corresponding vertex. Similar to the above insert() function, but takes as additional parameter the return values of a previous location query. See description of locate() above. | ||||
|
| ||||
|
|
| |||
Inserts the points in the range [.first,
last.). Returns the number of inserted points.
Note that this function is not guaranteed to insert the points
following the order of InputIterator.
| ||||
The previous methods are sufficient to build a whole triangulation. We also provide some other methods that can be used instead of insert(p) when the place where the new point p must be inserted is already known. They are also guaranteed to lead to a valid triangulation when they are applied on a valid triangulation.
|
|
| |||
Inserts point p in cell c. Cell c is split into 4
tetrahedra.
| ||||
|
|
| |||
Inserts point p in facet f. In dimension 3, the 2
neighboring cells are split into 3 tetrahedra; in dimension 2, the facet
is split into 3 triangles.
| ||||
|
|
| |||
As above, insertion in facet (c,i).
| ||||
|
|
| |||
Inserts p in edge e. In dimension 3,
all the cells having this edge are split into 2 tetrahedra; in
dimension 2, the 2 neighboring facets are split into 2 triangles; in
dimension 1, the edge is split into 2 edges.
| ||||
|
|
| |||
As above, inserts p in edge (i, j) of c.
| ||||
|
|
| |||
|
The cell c must be an infinite cell containing p. Links p to all points in the triangulation that are visible from p. Updates consequently the infinite faces. See Figure 37.11.
| ||||
Figure 37.11: insert_outside_convex_hull (2-dimensional case).
|
|
| |||
|
p is linked to all the points, and the infinite vertex is linked
to all the points (including p) to triangulate the new infinite
face, so that all the points now belong to the boundary of the convex
hull. See Figure 37.12. This method can be used to insert the first point in an empty triangulation.
| ||||
Figure 37.12: insert_outside_affine_hull (2-dimensional case).
|
| ||||
|
|
| |||
|
Creates a new vertex by starring a hole. It takes an iterator range
[cell_begin; cell_end[ of Cell_handles which specifies
a hole: a set of connected cells (resp. facets in dimension 2) which is
star-shaped wrt p.
(begin, i) is a facet (resp. an edge) on the boundary of the hole,
that is, begin belongs to the set of cells (resp. facets) previously
described, and begin->neighbor(i) does not. Then this function deletes
all the cells (resp. facets) describing the hole, creates a new vertex
v, and for each facet (resp. edge) on the boundary of the hole, creates
a new cell (resp. facet) with v as vertex. Then v->set_point(p)
is called and v is returned. This operation is equivalent to calling tds().insert_in_hole(cell_begin, cell_end, begin, i); v->set_point(p).
| ||||
|
| ||||
|
|
| |||
| Same as above, except that newv will be used as the new vertex, which must have been allocated previously with e.g. create_vertex. | ||||
The triangulation class provides several iterators and circulators that allow one to traverse it (completely or partially).
The following iterators allow the user to visit cells, facets, edges and vertices of the triangulation. These iterators are non-mutable, bidirectional and their value types are respectively Cell, Facet, Edge and Vertex. They are all invalidated by any change in the triangulation.
The following circulators respectively visit all cells or all facets incident to a given edge. They are non-mutable and bidirectional. They are invalidated by any modification of one of the cells traversed.
|
|
|
Starts at an arbitrary cell incident to e.
| ||
|
|
| |||
| As above for edge (i,j) of c. | ||||
|
|
| |||
Starts at cell start.
| ||||
|
|
| |||
| As above for edge (i,j) of c. | ||||
The following circulators on facets are defined only in dimension 3, though facets are defined also in dimension 2: there are only two facets sharing an edge in dimension 2.
|
|
|
Starts at an arbitrary facet incident to e.
| ||
|
|
| |||
| As above for edge (i,j) of c. | ||||
|
|
| |||
Starts at facet start.
| ||||
|
|
| |||
| Starts at facet of index f in start. | ||||
|
|
| |||
| As above for edge (i,j) of c. | ||||
|
|
| |||
| As above for edge (i,j) of c and facet (start,f). | ||||
|
|
| |||
Returns the index of c in its ith neighbor.
| ||||
|
|
| |||
Returns the vertex of the ith neighbor of c that is opposite to
c.
| ||||
|
|
| Returns the same facet seen from the other adjacent cell. | ||
|
|
| |
|
Checks the combinatorial validity of the triangulation. Checks also the
validity of its geometric embedding (see
Section 37.1). When verbose is set to true, messages describing the first invalidity encountered are printed. | ||
|
|
| |
|
Checks the combinatorial validity of the cell by calling the
is_valid method of the TriangulationDataStructure_3 cell class. Also checks the
geometric validity of c, if c is finite. (See
Section \icon.) When verbose is set to true, messages are printed to give a precise indication of the kind of invalidity encountered. | ||
Cgal provides an interface to Geomview for a 3D-triangulation, see Chapter 78 on Geomview_stream. #include <CGAL/IO/Triangulation_geomview_ostream_3.h>
|
|
| |
| Reads the underlying combinatorial triangulation from is by calling the corresponding input operator of the triangulation data structure class (note that the infinite vertex is numbered 0), and the non-combinatorial information by calling the corresponding input operators of the vertex and the cell classes (such as point coordinates), which are provided by overloading the stream operators of the vertex and cell types. Assigns the resulting triangulation to t. | ||
|
|
| |
| Writes the triangulation t into os. | ||
The information in the iostream is: the dimension, the number of finite vertices, the non-combinatorial information about vertices (point, etc; note that the infinite vertex is numbered 0), the number of cells, the indices of the vertices of each cell, plus the non-combinatorial information about each cell, then the indices of the neighbors of each cell, where the index corresponds to the preceding list of cells. When dimension < 3, the same information is stored for faces of maximal dimension instead of cells.
TriangulationDataStructure_3::Vertex
TriangulationDataStructure_3::Cell