unit-tests/testFacetRecovery.cpp
/*! \fn size_t TestRecoverConstraintFacets::numberOfAlreadyPresentConstraintFacets()
 *  \brief Computes number of constraint facets already present in DT before applying recovery procedure.
 *  \return Number of constraint facets already present in DT.
 */
\fn size_t TestRecoverConstraintFacets::numberOfAlreadyPresentConstraintFacets()
\brief Computes number of constraint facets already present in DT before applying recovery procedure.
\return Number of constraint facets already present in DT.
\ fn size_t TestRecoverConstraintFacets :: numberOfAlreadyPresentConstraintFacets () \ brief Computes number of constraint facets already present in DT before applying recovery procedure . \ return Number of constraint facets already present in DT .
size_t TestRecoverConstraintFacets::numberOfAlreadyPresentConstraintFacets()
{
	size_t nConstraintFacetsAlreadyPresent = 0;
	Delaunay::Vertex_handle vh1, vh2, vh3;
	Delaunay::Cell_handle c;
	CGALPoint p[3];
	int i, j, k;
	for (LCC::One_dart_per_cell_range<2>::iterator fIter = plc.one_dart_per_cell<2>().begin(), fIterEnd = plc.one_dart_per_cell<2>().end(); fIter != fIterEnd; fIter++)
	{
		for (LCC::One_dart_per_incident_cell_range<0, 2>::iterator pIter = plc.one_dart_per_incident_cell<0, 2>(fIter).begin(), pIterEnd = plc.one_dart_per_incident_cell<0, 2>(fIter).end(); pIter != pIterEnd; pIter++)
			p[i] = plc.point(pIter);
		if (DT.is_vertex(p[0], vh1))
			if (DT.is_vertex(p[1], vh2))
				if (DT.is_vertex(p[2], vh3))
					if (DT.is_facet(vh1, vh2, vh3, c, i, j, k))
						nConstraintFacetsAlreadyPresent++;
	}
	return nConstraintFacetsAlreadyPresent;
}
size_t TestRecoverConstraintFacets :: numberOfAlreadyPresentConstraintFacets ( ) { size_t nConstraintFacetsAlreadyPresent = 0 ; Delaunay :: Vertex_handle vh1 , vh2 , vh3 ; Delaunay :: Cell_handle c ; CGALPoint p [ 3 ] ; int i , j , k ; for ( LCC :: One_dart_per_cell_range < 2 > :: iterator fIter = plc . one_dart_per_cell < 2 > ( ) . begin ( ) , fIterEnd = plc . one_dart_per_cell < 2 > ( ) . end ( ) ; fIter != fIterEnd ; fIter ++ ) { for ( LCC :: One_dart_per_incident_cell_range < 0 , 2 > :: iterator pIter = plc . one_dart_per_incident_cell < 0 , 2 > ( fIter ) . begin ( ) , pIterEnd = plc . one_dart_per_incident_cell < 0 , 2 > ( fIter ) . end ( ) ; pIter != pIterEnd ; pIter ++ ) p [ i ] = plc . point ( pIter ) ; if ( DT . is_vertex ( p [ 0 ] , vh1 ) ) if ( DT . is_vertex ( p [ 1 ] , vh2 ) ) if ( DT . is_vertex ( p [ 2 ] , vh3 ) ) if ( DT . is_facet ( vh1 , vh2 , vh3 , c , i , j , k ) ) nConstraintFacetsAlreadyPresent ++ ; } return nConstraintFacetsAlreadyPresent ; }
\fn size_t TestRecoverConstraintFacets::numberOfAlreadyPresentConstraintFacets()
  \brief Computes number of constraint facets already present in DT before applying recovery procedure.
\ fn size_t TestRecoverConstraintFacets :: numberOfAlreadyPresentConstraintFacets () \ brief Computes number of constraint facets already present in DT before applying recovery procedure .