songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Document fit->is_in_domain() in the user manual.

This commit is contained in:
Laurent Rineau 2010-03-26 11:38:55 +00:00
parent aeb6c47cdb
commit 14fdf772d7
2 changed files with 17 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
Mesh_2/doc_tex/Mesh_2/main.tex
View File

@ -309,6 +309,10 @@ and the reference manual for details. Note that the \ccc{CDT} should not be
externally modified during the life time of the \ccc{Delaunay_mesher_2<CDT>}
object.
Once the mesh is constructed, one can determine which faces of the
triangulation are in the mesh domain using the \ccc{is_in_domain()} member
function of the face type (see the concept \ccc{DelaunayMeshFaceBase_2}).
\subsection{Example Using the Global Function}
The following example inserts several segments into a constrained
@ -335,7 +339,11 @@ This example uses the class \ccc{Delaunay_mesher_2<CDT>} and calls
This example uses the global function \ccc{refine_Delaunay_mesh_2} but
defines a domain by using one seed. The size and shape criteria are the
default ones provided by the criteria class \ccc{Delaunay_mesh_criteria_2<K>}.
default ones provided by the criteria class
\ccc{Delaunay_mesh_criteria_2<K>}.
Once the mesh is constructed, the \ccc{is_in_domain()} member function of
faces is used to count them.
\ccIncludeExampleCode{Mesh_2/mesh_with_seeds.cpp}

8
Mesh_2/examples/Mesh_2/mesh_with_seeds.cpp
View File

@ -50,4 +50,12 @@ int main()
Criteria());
std::cout << "Number of vertices: " << cdt.number_of_vertices() << std::endl;
std::cout << "Number of finite faces: " << cdt.number_of_faces() << std::endl;
int mesh_faces_counter = 0;
for(CDT::Finite_faces_iterator fit = cdt.finite_faces_begin();
fit != cdt.finite_faces_end(); ++fit)
{
if(fit->is_in_domain()) ++mesh_faces_counter;
}
std::cout << "Number of faces in the mesh domain: " << mesh_faces_counter << std::endl;
}