Skip to content
Snippets Groups Projects
Commit ce2c9f39 authored by Christophe Geuzaine's avatar Christophe Geuzaine
Browse files

fix compile without SOLVER+ANN

parent 0c8f1fa8
No related branches found
No related tags found
No related merge requests found
......@@ -263,7 +263,7 @@ void discreteFace::printAtlasMesh(std::vector<MElement*> elm, int I)
void discreteFace::printAtlasMesh(discreteDiskFace* ddf, int I)
{
#if defined(HAVE_SOLVER) && defined(HAVE_ANN)
std::map<MVertex*,int> mv2int;
char buffer[16];
sprintf(buffer,"atlas_mesh%d.msh",I);
......@@ -296,7 +296,7 @@ void discreteFace::printAtlasMesh(discreteDiskFace* ddf, int I)
}
fprintf(pmesh,"$EndElements\n");
fclose(pmesh);
#endif
}
......@@ -681,7 +681,7 @@ void discreteFace::updateTopology(std::vector<triangulation*>&partition)
void discreteFace::fillHoles(triangulation* trian)
{
#if defined(HAVE_SOLVER) && defined(HAVE_ANN)
std::map<double,std::vector<MVertex*> > bords = trian->bord;
std::map<double,std::vector<MVertex*> >::reverse_iterator it = bords.rbegin();
++it;
......@@ -702,16 +702,19 @@ void discreteFace::fillHoles(triangulation* trian)
addTriangle(trian,new MTriangle(mv[j],mv[j-1],center));
addTriangle(trian,new MTriangle(mv[0],mv[mv.size()-1],center));
}
#endif
}
void discreteFace::addTriangle(triangulation* trian, MTriangle* t)
{// #mark quid borders ?
{
#if defined(HAVE_SOLVER) && defined(HAVE_ANN)
// #mark quid borders ?
for(int i=0; i<3; i++){
MEdge ed = t->getEdge(i);
trian->ed2tri[ed].push_back(trian->tri.size());
}
trian->tri.push_back(t);
#endif
}
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment