#ifndef __SEGMENTATOR #define __SEGMENTATOR /////need vertex-face topology in case of extended marching cubes //#ifdef _EXTENDED_MARCH // #include // #include //#else #include #include //#endif #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include class Segmentator{ public: struct DummyEdge; struct DummyTetra; struct MyFace; #ifdef _EXTENDED_MARCH struct MyVertex: public ParticleBasic > #else struct MyVertex: public ParticleBasic > #endif { public: bool blocked;//optimize after with vertex flags bool stopped; MyVertex() { blocked=false; stopped=false; Acc()=Point3f(0,0,0); Vel()=Point3f(0,0,0); ClearFlags(); //__super:: //neeed call of the super class } void UpdateAcceleration() { if ((!blocked)&&(!stopped)) { Acc()=(IntForce()+ExtForce())/Mass(); } else { Acc()=Point3f(0,0,0); Vel()=Point3f(0,0,0); } } void Reset() { IntForce()=Point3f(0.f,0.f,0.f); } void SetRestPos() { RPos()=P(); } }; ///this class implements the deformable triangle in a mass spring system struct MyFace : public TriangleMassSpring< vcg::FaceAFFNFMRT > { public: bool intersected; float kdihedral; ScalarType AreaRep; int _Mark; MyFace() { intersected=false; ClearFlags(); } void Init ( double k, double mass,float k_dihedral ) { __super::Init(k,mass); kdihedral=k_dihedral; AreaRep=((V(1)->RPos() - V(0)->RPos()) ^ (V(2)->RPos() - V(0)->RPos())).Norm(); SetS(); } bool IsActive() { return((!(((V(0)->blocked)||(V(0)->stopped))&& ((V(1)->blocked)||(V(1)->stopped))&& ((V(2)->blocked)||(V(2)->stopped))))&&(!intersected)); } bool HaveVertexActive() { return((V(0)->blocked==false)||(V(1)->blocked==false)||(V(2)->blocked==false)); } bool IsBlocked() { return((V(0)->blocked)&&(V(1)->blocked)&&(V(2)->blocked)); } double DiedralAngle(int edge) { MyFace *fopp=FFp(edge); CoordType norm1=NormalizedNormal(); CoordType norm2=fopp->NormalizedNormal(); return (norm1*norm2); } int &Mark() {return (_Mark);} ///return the bounding box of the simplex vcg::Box3 BBox() { vcg::Box3 bb; GetBBox(bb); return (bb); } ScalarType ForceValue(ScalarType l0,ScalarType l1) { ScalarType diff=(l0-l1); if (diff>0)//compression return ((diff/(l1))*_k)+(diff *_k); else return (diff *_k); } ///update of the internal forces using the dihedral angle bool Update ( void ) { if (!IsD()&&(!intersected))//if this face is not deleted { for (int i=0;i<3;i++) { if (!IsBorder(i)) { MyFace *fopp=FFp(i); MyFace *myAddr=this; assert(!fopp->IsD()); assert(fopp!=this); if ((foppintersected))//test do not duplicate updates per edge { //normal and area based diadedral angle calcolus CoordType DirEdge=(V(i)->P()-V((i+1)%3)->P()).Normalize(); fopp=FFp(i); CoordType Ver=(NormalizedNormal()^fopp->NormalizedNormal()).Normalize(); ScalarType diaedral=DiedralAngle(i); ScalarType Force=(((-diaedral)+1.f)*kdihedral); CoordType VectF=NormalizedNormal()*(Force); if ((Ver*DirEdge)<=0)///convex { V((i+2)%3)->IntForce()+=VectF; fopp->V((FFi(i)+2)%3)->IntForce()+=VectF;///opposite vertex V(i)->IntForce()-=VectF; V((i+1)%3)->IntForce()-=VectF; } else ///non-convex { V((i+2)%3)->IntForce()-=VectF; fopp->V((FFi(i)+2)%3)->IntForce()-=VectF;///opposite vertex V(i)->IntForce()+=VectF; V((i+1)%3)->IntForce()+=VectF; } } } } ////area changing constrain penalize area goes to zero //CoordType m0=(V(0)->P()+V(1)->P())/2.f; //CoordType m1=(V(1)->P()+V(2)->P())/2.f; //CoordType m2=(V(2)->P()+V(0)->P())/2.f; //m0=(V(2)->P()-m0).Normalize();//directions //m1=(V(0)->P()-m1).Normalize(); //m2=(V(1)->P()-m2).Normalize(); //ScalarType FArea=((ScalarType)1/AreaRep-Area())*_k; //V(0)->IntForce()+=m0*FArea/3.f; //V(1)->IntForce()+=m1*FArea/3.f; //V(2)->IntForce()+=m2*FArea/3.f; ////end area constrain return(__super::Update()); ///new //double stretch; //CoordType direction; /////for each vertex //for (int i=0;i<3;i++) //{ // //spring on the face // direction=(V(i)->RPos()-V(i)->P()); // stretch=direction.Norm(); // direction.Normalize(); // V(i)-> IntForce()+=direction*(stretch * _k)/2.f; //} } return true; ///new } }; struct MyTriMesh: public vcg::tri::TriMesh,std::vector >{}; typedef Partial_Container,MyVertex> Part_VertexContainer; typedef Partial_Container,MyFace> Part_FaceContainer; typedef PDEIntegrator myIntegrator; typedef Collision_Detector > Collision; ////typedef Walker MyWalk; // //#ifdef _EXTENDED_MARCH // typedef vcg::tri::ExtendedMarchingCubes MarchingCubes; //#else // typedef vcg::tri::MarchingCubes MarchingCubes; //#endif public: Point3f scale; //VolumetricDataset d; /*MyTriMesh m; MyTriMesh new_m;*/ MyTriMesh *m; MyTriMesh *new_m; Part_FaceContainer P_Faces; Part_VertexContainer P_Vertex; Part_VertexContainer V_Stopped; myIntegrator *TrINT; MyTriMesh::CoordType InitialBarycenter; float mass; float k_elanst; float k_dihedral; float edge_size; int tolerance; int gray_init; float time_stamp; float edge_precision; float edge_init; bool end_loop; bool refined; clock_t interval_reinit; clock_t interval_selfcollision; Collision *CollDet; //Volume_Dataset_Optimized V; Volume_Dataset V; vcg::Box3 bbox; char *inDir; char *outDir; //attention static members /*int BlockFlag; int StoppedFlag;*/ Segmentator() { m=new MyTriMesh(); CollDet=new Collision(m->face); } ~Segmentator() { } private: /////return integer coordinete in volumetric dataset //Point3i MapToDataset(MyTriMesh::CoordType p) //{ // MyTriMesh::ScalarType x=((MyTriMesh::ScalarType)p.V(0)); // MyTriMesh::ScalarType y=((MyTriMesh::ScalarType)p.V(1)); // MyTriMesh::ScalarType z=((MyTriMesh::ScalarType)p.V(2)); // return Point3i((int)p.V(0),(int)p.V(1),(int)p.V(2)); //} // ///map to space coordinate from dataset coordinates MyTriMesh::CoordType MapToSpace(Point3i p) { MyTriMesh::ScalarType x=((MyTriMesh::ScalarType)p.V(0)); MyTriMesh::ScalarType y=((MyTriMesh::ScalarType)p.V(1)); MyTriMesh::ScalarType z=((MyTriMesh::ScalarType)p.V(2)); return (MyTriMesh::CoordType(x,y,z)); } #ifdef _TORUS ///torus version /*float getColor(MyTriMesh::CoordType p) { static float ray=25.f; static float diameter=4.f; float dist=p.Norm(); float difference=abs(ray-dist); float z=fabs(p.Z()); if((difference=max.V(i))||(test.V(i)<=min.V(i)))) return true; } return false; } bool IsBlocked(MyVertex *v) { //return ((v->Flags()& BlockFlag!=0)); return (v->blocked); } void SetBlocked(MyVertex *v) { //v->Flags()|= BlockFlag; v->blocked=true; //v->SetS();//for refine } void SetBlockedFace(MyFace *f) { SetBlocked(f->V(0)); SetBlocked(f->V(1)); SetBlocked(f->V(2)); } void SetIntersectedFace(MyFace *f) { f->intersected=true; f->ClearS(); //if ((!f->intersected)&&(!f->IsD())) //{ // f->intersected=true; // /////detach from Face-Face Topology // for (int i=0;i<3;i++) // if (!f->IsBorder(i)) // vcg::face::FFDetach(*f,i); // f->SetD(); // m->fn--; //} } bool IsStopped(MyVertex *v) { //return ((v->Flags()& StoppedFlag!=0)); return (v->stopped); } void SetStopped(MyVertex *v) { //v->Flags()|= StoppedFlag; v->stopped=true; V_Stopped.push_back(v); } void ClearStopped(MyVertex *v) { //v->Flags()&= ~StoppedFlag; v->stopped=false; } /////re-set physical pararmeters on the mesh //void InitPhysParam(float k_elanst,float mass,float k_dihedral) //{ // for (unsigned int i=0;iface.size();i++) // { // if (!m->face[i].IsD()) // m->face[i].Init(k_elanst,mass,k_dihedral); // } //} ///set the initial mesh of deformable object void InitMesh(MyTriMesh *m) { m->Clear(); vcg::tri::Icosahedron(*m); vcg::tri::UpdateTopology::FaceFace(*m); /* P_Vertex.clear(); P_Faces.clear();*/ for (unsigned int i=0;ivert.size();i++) { m->vert[i].P()=UnScale(m->vert[i].P());///last change m->vert[i].P()+=InitialBarycenter; m->vert[i].SetRestPos(); // m.vert[i].P()=UnScale(m.vert[i].P()); // P_Vertex.push_back(&m.vert[i]); } vcg::tri::UpdateNormals::PerVertexNormalized(*m); } ///return true if the gray level of the vertex v differ from graylevel less than tolerance bool InTolerance(MyTriMesh::VertexType *v) { return (fabs(getColor(v->P())-(float)gray_init)<(float)tolerance); } ///add to the vertex v a containing force basing on diffence from tolerance MyTriMesh::CoordType ContainingForce(MyTriMesh::VertexType *v) { //float dinstance=fabs((FindGrayMedia(v))-gray_init); float dinstance=fabs((getColor(v->P()))-(float)gray_init); assert(dinstance<=tolerance); MyTriMesh::CoordType ret=(-v->N()*((dinstance)/(float)tolerance)); return (ret); } ///find the gradient factor MyTriMesh::CoordType GradientFactor(MyTriMesh::VertexType *v) { MyTriMesh::CoordType value=Gradient(v->P()); /*float d0=getColor(v->P()+value); float d1=getColor(v->P()-value); if ((fabs(d0-(float)gray_init))>(fabs(d1-(float)gray_init))) return (-value); else */ return (value*(gray_init-getColor(v->P()))); } ///add the external forces to the deformable mesh void AddExtForces() { Part_VertexContainer::iterator vi; //PartialUpdateNormals(); end_loop=true; for (vi=P_Vertex.begin();vi1) Containing0.Normalize(); Containing0*=0.75; (*vi).ExtForce()=Inflating+Containing0;/*+Containing1+Containing0*/; } } else (*vi).ExtForce()=MyTriMesh::CoordType(0,0,0); } } } ///reinit the partial integration vectors that describe active vertices void Reinit_PVectors() { V_Stopped.clear(); P_Vertex.clear(); MyTriMesh::VertexIterator vi; for (vi=m->vert.begin();vivert.end();vi++) { if ((!vi->IsD())&&(!vi->blocked)) P_Vertex.push_back(&(*vi)); if ((!vi->IsD())&&((*vi).stopped)&&(!vi->blocked)) V_Stopped.push_back(&(*vi)); } P_Faces.clear(); MyTriMesh::FaceIterator fi; for (fi=m->face.begin();fiface.end();fi++) { if ((!fi->IsD())&&(!fi->IsBlocked())) P_Faces.push_back(&(*fi)); } } ///erase the stopped entities from the partial containers void Refresh_PVectors() { Part_FaceContainer P_FacesAux; Part_VertexContainer P_VertexAux; P_FacesAux.clear(); P_VertexAux.clear(); unsigned int i=0; for (i=0;iIsD())&&(!P_Vertex[i]->blocked)) P_VertexAux.push_back(P_Vertex[i]); } for (i=0;iIsD())&&(!P_Faces[i]->IsBlocked())) P_FacesAux.push_back(P_Faces[i]); } P_Faces.clear(); P_Vertex.clear(); P_Faces=P_FacesAux; P_Vertex=P_VertexAux; } ///add the new elements on partial vectors when allocate space for new vertices void AddNewElements(MyTriMesh::VertexIterator vi,MyTriMesh::FaceIterator fi) { while (vi!=m->vert.end()) { if ((!(*vi).IsD())&&(!(*vi).blocked)&&(!(*vi).stopped)) P_Vertex.push_back(&(*vi)); vi++; } while (fi!=m->face.end()) { if ((!(*fi).IsD())&&((*fi).IsActive())) P_Faces.push_back(&(*fi)); fi++; } } ///verify and eventually stop the vertices of the mesh void VerifyForces() { float proj; Part_VertexContainer::iterator vi; for (vi=P_Vertex.begin();viinterval_reinit) { time=clock(); return true; } return false; } bool TimeSelfIntersection() { static clock_t time=0; clock_t elapsedsecs=abs(time-clock()); if (elapsedsecs>interval_selfcollision) { time=clock(); return true; } return false; } void PartialUpdateNormals() { //vcg::tri::UpdateNormals::PerFaceNormalized(*m); //vcg::tri::UpdateNormals::PerVertexNormalized(*m); Part_FaceContainer::iterator fi; for (fi=P_Faces.begin();fiIsD() && (*fi).V(j)->IsRW() ) (*fi).V(j)->N() += t; } for(vi=P_Vertex.begin();vi!=P_Vertex.end();++vi) if( !(*vi).IsD() && (*vi).IsRW() ) (*vi).N().Normalize(); } //bool SelectToRefine() //{ // MyTriMesh::FaceIterator fi; // for (fi=m->face.begin();pfiface.end();++pfi) // { // if (((*fi).QualityFace()<0.1f)) // fi->ClearS(); // } //} template struct MyMidPoint:vcg::MidPoint { void operator()(typename MESH_TYPE::VertexType &nv, face::Pos ep){ nv.P()= (ep.f->V(ep.z)->P()+ep.f->V1(ep.z)->P())/2.0; nv.RPos()=(ep.f->V(ep.z)->RPos()+ep.f->V1(ep.z)->RPos())/2.0; if( MESH_TYPE::HasPerVertexNormal()) nv.N()= (ep.f->V(ep.z)->N()+ep.f->V1(ep.z)->N()).Normalize(); if( MESH_TYPE::HasPerVertexColor()) nv.C().lerp(ep.f->V(ep.z)->C(),ep.f->V1(ep.z)->C(),.5f); } }; ///refine the mesh and re-update eventually void RefineStep(float _edge_size) { MyTriMesh::VertexIterator vinit=m->vert.begin(); MyTriMesh::FaceIterator finit=m->face.begin(); MyTriMesh::VertexIterator vend=m->vert.end(); MyTriMesh::FaceIterator fend=m->face.end(); // bool to_refine=SelectToRefine(); /*if (to_refine)*/ //refined=vcg::Refine(*m,MidPoint(),_edge_size,true); refined=vcg::Refine(*m,MyMidPoint(),_edge_size,true); /*else refined=false;*/ if (refined) { MyTriMesh::VertexIterator vinit2=m->vert.begin(); MyTriMesh::FaceIterator finit2=m->face.begin(); if ((vinit2!=vinit)||(finit2!=finit)) { Reinit_PVectors(); CollDet->RefreshElements(); } else { AddNewElements(vend,fend); CollDet->UpdateStep(P_Faces); } /*vcg::tri::UpdateNormals::PerFaceNormalized(*m); vcg::tri::UpdateNormals::PerVertexNormalized(*m);*/ PartialUpdateNormals(); //#ifdef _DEBUG // vcg::tri::UpdateTopology::TestFaceFace(*m); //#endif //CollDet->RefreshElements(); } } ///reset vertex position and unblock them void ReinitPhysicMesh() { Part_FaceContainer::iterator pfi; /*for (pfi=P_Faces.begin();pfiUpdateStep(P_Faces); std::vector coll=CollDet->computeSelfIntersection(); for (std::vector::iterator it=coll.begin();itIsD()) { SetBlockedFace(*it); SetIntersectedFace(*it); } } } public: ///set the initial barycenter where the triangle mesh start to expand //void SetInitialBarycenter(MyTriMesh::CoordType b) //{ // InitialBarycenter=b; // gray_init=getColor(b); // /*InitMesh(m);*/ //} ///set the input output directory of images void LoadFromDir(char *in, char *out) { inDir=in; outDir=out; //caso optimized /*V.Resample(inDir,outDir); V.Init(1000,outDir);*/ V.Load(inDir); bbox=vcg::Box3(MapToSpace((V.Min())),(MapToSpace(V.Max()))); } ///set parameters for segmentation void SetSegmentParameters(int tol,float Mass=0.5f,float K_elanst=0.2f,float Dihedral=0.2f,float Time_stamp=0.2f, float Edge_precision=4.f,Point3f ScaleFactor=Point3f(1.f,1.f,1.f), clock_t _interval=2000,clock_t _interval2=250) { mass=Mass; k_elanst=K_elanst; tolerance=tol; interval_reinit=_interval; interval_selfcollision=_interval2; edge_size=16.f; edge_init=edge_size; edge_precision=Edge_precision; time_stamp=Time_stamp; k_dihedral=Dihedral; scale=ScaleFactor; bbox=vcg::Box3(UnScale(MapToSpace(V.Min())),(UnScale(MapToSpace(V.Max()))));//last change! } ///init the segmentation of the mesh void InitSegmentation(MyTriMesh::CoordType b) { InitialBarycenter=b; gray_init=getColor(b); TrINT= new myIntegrator(P_Faces,P_Vertex); TrINT->SetPDESolver(PDESolvers::EULER_METHOD); InitMesh(m); //init the mesh with new Reinit_PVectors(); ReinitPhysicMesh(); CollDet->Init(bbox.min,bbox.max,5.f); } ///return the bounding box of the mesh vcg::Box3& BBox() { return (bbox); } ///one step of moving for the deformable object void Step(float t,float _edge_size) { if (m->face.size()!=0) { AddExtForces(); TrINT->Step(t); VerifyForces(); Refresh_PVectors(); if (end_loop) { RefineStep(_edge_size); ReinitPhysicMesh(); ClearStopped(); } if (TimeSelfIntersection()) CollisionDetection(); } } void Smooth() { ScaleLaplacianSmooth(*m,1,0.5); } void AutoStep() { refined=false; Step(time_stamp,edge_size); //test on 80% of the vertex blocked if ((((float)P_Vertex.size()/(float)m->vn)<0.2)&&(end_loop)&&(!refined)&&(edge_size>edge_precision)) { edge_size/=2.f; if (edge_sizeface.begin();fiface.end();fi++) #ifdef _TORUS if (((*fi).intersected==true))///||((*fi).HaveVertexActive())) { m->fn--; (*fi).SetD(); } #else if (((*fi).intersected==true))//||((*fi).HaveVertexActive())) { m->fn--; (*fi).SetD(); } #endif } ///first version void Resample() { ClearIntersectedFaces(); new_m=new MyTriMesh(); vcg::tri::UpdateBounding::Box(*m); #ifdef _TORUS vcg::trimesh::Resampler::Resample(*m,*new_m, Point3i((int) edge_precision,(int) edge_precision,(int) edge_precision),edge_init); #else vcg::trimesh::Resampler::Resample(*m,*new_m, Point3i((int) edge_precision,(int) edge_precision,(int) edge_precision),edge_size*2.f); #endif // delete(new_m0); delete(m); m=new_m; Reinit_PVectors(); ReinitPhysicMesh(); CollDet->Init(bbox.min,bbox.max,5.f); } }; #endif