/******************************************************************************* * CGoGN: Combinatorial and Geometric modeling with Generic N-dimensional Maps * * version 0.1 * * Copyright (C) 2009-2011, IGG Team, LSIIT, University of Strasbourg * * * * This library is free software; you can redistribute it and/or modify it * * under the terms of the GNU Lesser General Public License as published by the * * Free Software Foundation; either version 2.1 of the License, or (at your * * option) any later version. * * * * This library is distributed in the hope that it will be useful, but WITHOUT * * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * * FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License * * for more details. * * * * You should have received a copy of the GNU Lesser General Public License * * along with this library; if not, write to the Free Software Foundation, * * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. * * * * Web site: http://cgogn.u-strasbg.fr/ * * Contact information: cgogn@unistra.fr * * * *******************************************************************************/ namespace CGoGN { namespace Algo { namespace Modelisation { template void explodPolyhedron(typename PFP::MAP& map, Dart d, typename PFP::TVEC3 position) { map.unsewVertexUmbrella(d); unsigned int newFaceDegree = map.closeHole(map.phi1(d)); if(newFaceDegree != 3) { // chercher le brin ou demarrer std::multimap edges ; typename std::multimap::iterator it ; Dart d12 = map.phi2(map.phi1(d)); Dart fit = d12; unsigned int i; do { i = map.faceDegree(map.phi2(fit)); std::cout << "edge(" << fit << "," << i << ")" << std::endl; edges.insert(std::make_pair(fit, i)); fit = map.phi1(fit); } while(fit != d12); do { //44 44 if(edges.find(fit)->second == 4 && edges.find(map.phi1(fit))->second == 4 && !map.sameFace(map.phi2(fit), map.phi2(map.phi1(fit)))) { map.splitFace(fit, map.phi1(map.phi1(fit))); fit = map.phi2(map.phi_1(fit)); int i = map.faceDegree(fit); edges.insert(std::make_pair(fit, i)); // Dart fit2 = map.phi2(fit) ; // typename PFP::VEC3 p1 = position[fit] ; // typename PFP::VEC3 p2 = position[fit2] ; // // map.cutEdge(fit) ; // position[map.phi1(fit)] = typename PFP::REAL(0.5) * (p1 + p2); std::cout << "flip cas quad quad " << std::endl; } //3 3 if(edges.find(fit)->second == 3 && edges.find(map.phi1(fit))->second == 3 && !map.sameFace(map.phi2(fit), map.phi2(map.phi1(fit)))) { map.splitFace(fit, map.phi1(fit)); fit = map.phi2(map.phi_1(fit)); int i = map.faceDegree(fit); edges.insert(std::make_pair(fit, i)); std::cout << "flip cas tri tri" << std::endl; } //3 44 ou 44 3 if( ((edges.find(fit)->second == 4 && edges.find(map.phi1(fit))->second == 3) || (edges.find(fit)->second == 3 && edges.find(map.phi1(fit))->second == 4)) && !map.sameFace(map.phi2(fit), map.phi2(map.phi1(fit)))) { map.splitFace(fit, map.phi1(map.phi1(fit))); fit = map.phi2(map.phi_1(fit)); int i = map.faceDegree(fit); edges.insert(std::make_pair(fit, i)); std::cout << "flip cas quad tri" << std::endl; } fit = map.phi1(fit); } while(map.faceDegree(fit) > 4 && fit != d12); } } template Polyhedron::Polyhedron(const Polyhedron& p1, const Polyhedron& p2) : m_map(p1.m_map), m_dart(p1.m_dart), m_kind(COMPOSED), m_nx(-1), m_ny(-1), m_nz(-1), m_top_closed(false), m_bottom_closed(false), m_positions(p1.m_positions) { if (&(p1.map) != &(p2.map)) { CGoGNerr << "Warning, can not merge to Polyhedrons of different maps"<< CGoGNendl; } m_tableVertDarts.reserve(p1.m_tableVertDarts.size() + p2.m_tableVertDarts.size()); // can be too much but ... typename PFP::VEC3 center(0); for(typename std::vector::const_iterator di = p1.m_tableVertDarts.begin(); di != p1.m_tableVertDarts.end(); ++di) { m_tableVertDarts.push_back(*di); center += m_positions[*di]; } // O(n2) pas terrible !! for(typename std::vector::const_iterator di = p2.m_tableVertDarts.begin(); di != p2.m_tableVertDarts.end(); ++di) { unsigned int em = m_map.getEmbedding(*di, VERTEX); typename std::vector::const_iterator dj=p1.m_tableVertDarts.begin(); bool found = false; while ((dj !=p1.m_tableVertDarts.end()) && (!found)) { unsigned int xm = m_map.getEmbedding(*dj, VERTEX); if (xm == em) found = true; else ++dj; } if (!found) { m_tableVertDarts.push_back(*di); center += m_positions[*di]; } } m_center = center / typename PFP::REAL(m_tableVertDarts.size()); } template Dart Polyhedron::createTetra(typename PFP::MAP& the_map) { Dart base = the_map.newFace(3, false); Dart side1 = the_map.newFace(3, false); the_map.sewFaces(base, side1, false); Dart side2 = the_map.newFace(3, false); the_map.sewFaces(the_map.phi1(base), side2, false); the_map.sewFaces(the_map.phi_1(side1), the_map.phi1(side2), false); Dart side3 = the_map.newFace(3, false); the_map.sewFaces(the_map.phi_1(base), side3, false); the_map.sewFaces(the_map.phi_1(side2), the_map.phi1(side3), false); the_map.sewFaces(the_map.phi_1(side3), the_map.phi1(side1), false); return base; } template Dart Polyhedron::createPyra(typename PFP::MAP& the_map) { Dart base = the_map.newFace(4, false); Dart side1 = the_map.newFace(3, false); the_map.sewFaces(base, side1, false); Dart side2 = the_map.newFace(3, false); the_map.sewFaces(the_map.phi1(base), side2, false); the_map.sewFaces(the_map.phi_1(side1), the_map.phi1(side2), false); Dart side3 = the_map.newFace(3, false); the_map.sewFaces(the_map.phi1(the_map.phi1(base)), side3, false); the_map.sewFaces(the_map.phi_1(side2), the_map.phi1(side3), false); Dart side4 = the_map.newFace(3, false); the_map.sewFaces(the_map.phi_1(base), side4, false); the_map.sewFaces(the_map.phi_1(side3), the_map.phi1(side4), false); the_map.sewFaces(the_map.phi_1(side4), the_map.phi1(side1), false); return base; } template Dart Polyhedron::createHexa(typename PFP::MAP& the_map) { Dart base = the_map.newFace(4, false); Dart side1 = the_map.newFace(4, false); the_map.sewFaces(base, side1, false); Dart side2 = the_map.newFace(4, false); the_map.sewFaces(the_map.phi1(base), side2, false); the_map.sewFaces(the_map.phi_1(side1), the_map.phi1(side2), false); Dart side3 = the_map.newFace(4, false); the_map.sewFaces(the_map.phi1(the_map.phi1(base)), side3, false); the_map.sewFaces(the_map.phi_1(side2), the_map.phi1(side3), false); Dart side4 = the_map.newFace(4, false); the_map.sewFaces(the_map.phi_1(base), side4, false); the_map.sewFaces(the_map.phi_1(side3), the_map.phi1(side4), false); the_map.sewFaces(the_map.phi_1(side4), the_map.phi1(side1), false); Dart top = the_map.newFace(4, false); the_map.sewFaces(top, the_map.phi1(the_map.phi1(side1)), false); the_map.sewFaces(the_map.phi_1(top), the_map.phi1(the_map.phi1(side2)), false); the_map.sewFaces(the_map.phi1(the_map.phi1(top)), the_map.phi1(the_map.phi1(side3)), false); the_map.sewFaces(the_map.phi1(top), the_map.phi1(the_map.phi1(side4)), false); return base; } template Dart Polyhedron::createPrism(typename PFP::MAP& the_map) { Dart base = the_map.newFace(3, false); Dart side1 = the_map.newFace(4, false); the_map.sewFaces(base, side1, false); Dart side2 = the_map.newFace(4, false); the_map.sewFaces(the_map.phi1(base), side2, false); the_map.sewFaces(the_map.phi_1(side1), the_map.phi1(side2), false); Dart side3 = the_map.newFace(4, false); the_map.sewFaces(the_map.phi1(the_map.phi1(base)), side3, false); the_map.sewFaces(the_map.phi_1(side2), the_map.phi1(side3), false); the_map.sewFaces(the_map.phi_1(side3), the_map.phi1(side1), false); Dart top = the_map.newFace(3, false); the_map.sewFaces(top, the_map.phi1(the_map.phi1(side1)), false); the_map.sewFaces(the_map.phi_1(top), the_map.phi1(the_map.phi1(side2)), false); the_map.sewFaces(the_map.phi1(top), the_map.phi1(the_map.phi1(side3)), false); return base; } template Dart Polyhedron::createPolyhedron(typename PFP::MAP& the_map, unsigned int n) { Dart d; switch (n) { case 4 : d = createTetra(the_map); break; case 5 : d = createPyra(the_map); break; case 6 : d = createHexa(the_map); break; } return d; } template Dart Polyhedron::grid_topo(unsigned int x, unsigned int y) { if (m_kind != NONE) return m_dart; m_kind = GRID; m_nx = x; m_ny = y; // nb vertices int nb = (x+1)*(y+1); // vertice reservation m_tableVertDarts.reserve(nb); // creation of quads and storing vertices for (unsigned int i = 0; i < y; ++i) { for (unsigned int j = 1; j <= x; ++j) { Dart d = m_map.newFace(4,false); m_tableVertDarts.push_back(d); if (j == x) m_tableVertDarts.push_back(m_map.phi1(d)); } } // store last row of vertices for (unsigned int i = 0; i < x; ++i) { m_tableVertDarts.push_back( m_map.phi_1(m_tableVertDarts[(y-1)*(x+1) + i]) ); } m_tableVertDarts.push_back( m_map.phi1(m_tableVertDarts[(y-1)*(x+1) +x]) ); //sewing the quads for (unsigned int i = 0; i < y; ++i) { for (unsigned int j = 0; j < x; ++j) { if (i > 0) // sew with preceeding row { int pos = i*(x+1)+j; Dart d = m_tableVertDarts[pos]; Dart e = m_tableVertDarts[pos-(x+1)]; e = m_map.phi1(m_map.phi1(e)); m_map.sewFaces(d,e,false); } if (j > 0) // sew with preceeding column { int pos = i*(x+1)+j; Dart d = m_tableVertDarts[pos]; d = m_map.phi_1(d); Dart e = m_tableVertDarts[pos-1]; e = m_map.phi1(e); m_map.sewFaces(d,e,false); } } } // store & return reference dart m_dart = m_tableVertDarts[0]; // util ? m_map.closeHole(m_dart) ; return m_dart; } template Dart Polyhedron::cylinder_topo(unsigned int n, unsigned int z, bool top_closed, bool bottom_closed) { if (m_kind != NONE) return m_dart; m_kind = CYLINDER; m_nx = n; m_nz = z; m_bottom_closed = bottom_closed; m_top_closed = top_closed; int nb = (n)*(z+1); if (bottom_closed) nb++; if (top_closed) nb++; // vertice reservation m_tableVertDarts.reserve(nb); // creation of quads and storing vertices for (unsigned int i = 0; i < z; ++i) { for (unsigned int j = 0; j < n; ++j) { Dart d = m_map.newFace(4, false); m_tableVertDarts.push_back(d); } } for (unsigned int i = 0; i < n; ++i) { m_tableVertDarts.push_back( m_map.phi_1(m_tableVertDarts[(z-1)*n+i]) ); } //sewing the quads for (unsigned int i = 0; i < z; ++i) { for (unsigned int j = 0; j < n; ++j) { if (i > 0) // sew with preceeding row { int pos = i*n+j; Dart d = m_tableVertDarts[pos]; Dart e = m_tableVertDarts[pos-n]; e = m_map.phi1(m_map.phi1(e)); m_map.sewFaces(d, e, false); } if (j > 0) // sew with preceeding column { int pos = i*n+j; Dart d = m_tableVertDarts[pos]; d = m_map.phi_1(d); Dart e = m_tableVertDarts[pos-1]; e = m_map.phi1(e); m_map.sewFaces(d, e, false); } else { int pos = i*n; Dart d = m_tableVertDarts[pos]; d = m_map.phi_1(d); Dart e = m_tableVertDarts[pos+(n-1)]; e = m_map.phi1(e); m_map.sewFaces(d, e, false); } } } if (bottom_closed) { Dart d = m_tableVertDarts[0]; if(m_map.closeHole(d, false)) { d = m_map.phi2(d); if(m_map.faceDegree(d) > 3) { Algo::Modelisation::trianguleFace(m_map, d); m_tableVertDarts.push_back(m_map.phi_1(d)); } } } else m_map.closeHole(m_tableVertDarts[0]); if (top_closed) { Dart d = m_map.phi_1(m_tableVertDarts[n*z]); if(m_map.closeHole(d, true)) { d = m_map.phi2(d); if(m_map.faceDegree(d) > 3) { Algo::Modelisation::trianguleFace(m_map, d); m_tableVertDarts.push_back(m_map.phi_1(d)); } } } else m_map.closeHole(m_map.phi_1(m_tableVertDarts[n*z])); m_dart = m_tableVertDarts.front(); return m_dart; } // template // Dart Polyhedron::cone_topo(int n, int z, bool bottom_closed) // { // if (m_kind != NONE) return m_dart; // // if (z>1) // { // if (n>4) // normal case // { // Dart d = cylinder_topo(n,z-1,true,bottom_closed); // m_kind = CONE; // m_nz = z; // return d; // } // else if (n==4) // { // Dart d = cylinder_topo(n,z-1,true,false); // m_kind = CONE; // m_nz = z; // // close bottom with one quad not three triangles // if (bottom_closed) // { // Dart t= m_map.newFace(4,false); // m_map.sewFaces(m_tableVertDarts[0],t); // t=m_map.phi_1(t); // m_map.sewFaces(m_tableVertDarts[1],t); // t=m_map.phi_1(t); // m_map.sewFaces(m_tableVertDarts[2],t); // t=m_map.phi_1(t); // m_map.sewFaces(m_tableVertDarts[3],t); // } // return d; // } // else // n==3 (base is triangle) // { // Dart d = cylinder_topo(n,z-1,true,false); // m_kind = CONE; // m_nz = z; // // close bottom with one triangle not three // if (bottom_closed) // { // Dart t= m_map.newFace(3,false); // m_map.sewFaces(d,t); // d=nextDV(d); t=m_map.phi_1(t); // m_map.sewFaces(d,t); // d=nextDV(d); t=m_map.phi_1(t); // m_map.sewFaces(d,t); // } // return d; // } // } // else //z==1 only on slice // { // m_kind = CONE; // m_nx = n; // m_nz = z; // if (n>4) // normal case // { // if (bottom_closed) // m_tableVertDarts.reserve(n+2); // else // m_tableVertDarts.reserve(n+1); // // Dart ref = triangleFan_topo(m_map,n); // Dart d = ref; // for (int i=0;i(m_map,n); // m_tableVertDarts.push_back(m_map.phi_1(dd)); // for (int i=0;i(m_map,4); // for (int i=0;i<4;++i) // { // m_tableVertDarts.push_back(dd); // dd = nextDV(dd); // } // m_tableVertDarts.push_back(m_map.phi_1(dd)); // // if (bottom_closed) // { // Dart t= m_map.newFace(4,false); // m_map.sewFaces(m_tableVertDarts[0],t); // t=m_map.phi_1(t); // m_map.sewFaces(m_tableVertDarts[1],t); // t=m_map.phi_1(t); // m_map.sewFaces(m_tableVertDarts[2],t); // t=m_map.phi_1(t); // m_map.sewFaces(m_tableVertDarts[3],t); // } // m_dart=dd; // return dd; // } // else // n==3 (base is triangle, here we create a tetrahedron) // { // m_bottom_closed=false; // because no vertex in bottom // m_tableVertDarts.reserve(4); // // Dart dd = triangleFan_topo(m_map,3); // for (int i=0;i<3;++i) // { // m_tableVertDarts.push_back(dd); // dd = nextDV(dd); // } // m_tableVertDarts.push_back(m_map.phi_1(dd)); // // if (bottom_closed) // { // Dart t= m_map.newFace(3,false); // m_map.sewFaces(m_tableVertDarts[0],t); // t=m_map.phi_1(t); // m_map.sewFaces(m_tableVertDarts[1],t); // t=m_map.phi_1(t); // m_map.sewFaces(m_tableVertDarts[2],t); // } // m_dart=dd; // return dd; // } // } // } template Dart Polyhedron::cube_topo(unsigned int x, unsigned int y, unsigned int z) { if (m_kind != NONE) return m_dart; m_dart = cylinder_topo(2*(x+y),z, false,false); m_kind = CUBE; m_nx = x; m_ny = y; m_nz = z; int nb = 2*(x+y)*(z+1) + 2*(x-1)*(y-1); m_tableVertDarts.reserve(nb); // we now have the 4 sides, just need to create store and sew top & bottom // the top Polyhedron primTop(m_map, m_positions); primTop.grid_topo(x,y); std::vector& tableTop = primTop.getVertexDarts(); int index_side = 2*(x+y)*z; for(unsigned int i = 0; i < x; ++i) { Dart d = m_map.phi_1(m_tableVertDarts[index_side++]); Dart e = tableTop[i]; m_map.sewFaces(d, e, false); } for(unsigned int i = 0; i < y; ++i) { Dart d = m_map.phi_1(m_tableVertDarts[index_side++]); Dart e = tableTop[x+i*(x+1)]; m_map.sewFaces(d, e, false); } for(unsigned int i = 0; i < x; ++i) { Dart d = m_map.phi_1(m_tableVertDarts[index_side++]); Dart e = tableTop[(x+1)*(y+1)-2 - i]; e = m_map.phi_1(e); m_map.sewFaces(d, e, false); } for(unsigned int i = 0; i < y; ++i) { Dart d = m_map.phi_1(m_tableVertDarts[index_side++]); Dart e = tableTop[(y-1-i)*(x+1)]; e = m_map.phi_1(e); m_map.sewFaces(d, e, false); } // the bottom Polyhedron primBottom(m_map,m_positions); primBottom.grid_topo(x,y); std::vector& tableBottom = primBottom.getVertexDarts(); index_side = 3*(x+y)+(x-1); for(unsigned int i = 0; i < x; ++i) { Dart d = m_tableVertDarts[(index_side--)%(2*(x+y))]; Dart e = tableBottom[i]; m_map.sewFaces(d, e, false); } for(unsigned int i = 0; i < y; ++i) { Dart d = m_tableVertDarts[(index_side--)%(2*(x+y))]; Dart e = tableBottom[x+i*(x+1)]; m_map.sewFaces(d, e, false); } for(unsigned int i = 0; i < x; ++i) { Dart d = m_tableVertDarts[(index_side--)%(2*(x+y))]; Dart e = tableBottom[(x+1)*(y+1)-2 - i]; e = m_map.phi_1(e); m_map.sewFaces(d, e, false); } for(unsigned int i = 0; i < y; ++i) { Dart d = m_tableVertDarts[(index_side--)%(2*(x+y))]; Dart e = tableBottom[(y-1-i)*(x+1)]; e = m_map.phi_1(e); m_map.sewFaces(d, e, false); } // and add new vertex in m_tableVertDarts //top first for(unsigned int i = 1; i < y; ++i) { for(unsigned int j = 1; j < x; ++j) m_tableVertDarts.push_back(tableTop[i*(x+1)+j]); } // then bottom for(unsigned int i = 1; i < y; ++i) { for(unsigned int j = 1; j < x; ++j) m_tableVertDarts.push_back(tableBottom[i*(x+1)+j]); } return m_dart; } template Dart Polyhedron::tore_topo(unsigned int m, unsigned int n) { if (m_kind != NONE) return m_dart; m_dart = cylinder_topo(n, m, false, false); m_nx=n; m_ny=m; m_kind = TORE; // juste finish to sew for(unsigned int i = 0; i < n; ++i) { Dart d = m_tableVertDarts[i]; Dart e = m_tableVertDarts[(m*n)+i]; e = m_map.phi_1(e); m_map.sewFaces(d, e, true); } // remove the last n vertex darts that are no more necessary (sewed with n first) // memory not freed (but will be when destroy the Polyhedron), not important ?? m_tableVertDarts.resize(m*n); return m_dart; } template void Polyhedron::embedGrid(float x, float y, float z) { typedef typename PFP::VEC3 VEC3 ; if (m_kind != GRID) { CGoGNerr << "Warning try to embedGrid something that is not a grid"< void Polyhedron::embedCylinder(float bottom_radius, float top_radius, float height) { typedef typename PFP::VEC3 VEC3 ; if (m_kind != CYLINDER) { CGoGNerr << "Warning try to embedCylinder something that is not a cylnder"< void Polyhedron::embedCone(float radius, float height) { typedef typename PFP::VEC3 VEC3 ; if (m_kind != CONE) { CGoGNerr << "Warning try to embedCone something that is not a cone"< void Polyhedron::embedSphere(float radius) { typedef typename PFP::VEC3 VEC3 ; if (!((m_kind == CYLINDER) && (m_top_closed) && (m_bottom_closed))) { CGoGNerr << "Warning try to embedSphere something that is not a sphere (closed cylinder)"< void Polyhedron::embedTore(float big_radius, float small_radius) { typedef typename PFP::VEC3 VEC3 ; if (m_kind != TORE) { CGoGNerr << "Warning try to embedTore something that is not a tore"< void Polyhedron::embedCube(float sx, float sy, float sz) { typedef typename PFP::VEC3 VEC3 ; if (m_kind != CUBE) { CGoGNerr << "Warning try to embedCube something that is not a cube"< void Polyhedron::computeCenter() { typename PFP::VEC3 center(0); for(typename std::vector::iterator di = m_tableVertDarts.begin(); di != m_tableVertDarts.end(); ++di) { center += m_positions[*di]; } m_center = center / typename PFP::REAL(m_tableVertDarts.size()); } template //void Polyhedron::transform(float* matrice) void Polyhedron::transform(const Geom::Matrix44f& matrice) { // Geom::Vec4f v1(matrice[0],matrice[4],matrice[8], matrice[12]); // Geom::Vec4f v2(matrice[1],matrice[5],matrice[9], matrice[13]); // Geom::Vec4f v3(matrice[2],matrice[6],matrice[10],matrice[14]); // Geom::Vec4f v4(matrice[3],matrice[7],matrice[11],matrice[15]); for(typename std::vector::iterator di = m_tableVertDarts.begin(); di != m_tableVertDarts.end(); ++di) { typename PFP::VEC3& pos = m_positions[*di]; // // Geom::Vec4f VA(pos[0],pos[1],pos[2],1.0f); // // Geom::Vec4f VB((VA*v1),(VA*v2),(VA*v3),(VA*v4)); // VEC3 newPos(VB[0]/VB[3],VB[1]/VB[3],VB[2]/VB[3]); pos = Geom::transform(pos, matrice); } // transform the center m_center = Geom::transform(m_center, matrice); } template void Polyhedron::mark(CellMarker& m) { for(typename std::vector::iterator di = m_tableVertDarts.begin(); di != m_tableVertDarts.end(); ++di) { m.mark(*di); } } //template //void Polyhedron::markEmbVertices(Mark m) //{ // AttributeHandler markers(VERTEX << 24, m_map); // for(typename std::vector::iterator di = m_tableVertDarts.begin(); di != m_tableVertDarts.end(); ++di) // { // markers[*di].setMark(m); // } //} template void Polyhedron::embedTwistedStrip(float radius_min, float radius_max, float turns) { typedef typename PFP::VEC3 VEC3 ; float alpha = float(2.0*M_PI/m_ny); float beta = turns/float(m_ny); float radius = (radius_max + radius_min)/2.0f; float rdiff = (radius_max - radius_min)/2.0f; for(unsigned int i = 0; i <= m_ny; ++i) { for(unsigned int j = 0; j <= m_nx; ++j) { float rw = -rdiff + float(j)*2.0f*rdiff/float(m_nx); float r = radius + rw*cos(beta*float(i)); VEC3 pos(r*cos(alpha*float(i)), r*sin(alpha*float(i)), rw*sin(beta*float(i))); unsigned int em = m_positions.insert(pos); Dart d = m_tableVertDarts[i*(m_nx+1)+j]; m_map.embedOrbit(VERTEX, d, em); } } } template void Polyhedron::embedHelicoid(float radius_min, float radius_max, float maxHeight, float nbTurn, int orient) { typedef typename PFP::VEC3 VEC3 ; float alpha = float(2.0*M_PI/m_nx)*nbTurn; float hS = maxHeight/m_nx; // float radius = (radius_max + radius_min)/2.0f; // float rdiff = (radius_max - radius_min)/2.0f; for(unsigned int i = 0; i <= m_ny; ++i) { for(unsigned int j = 0; j <= m_nx; ++j) { // float r = radius_max + radius_min*cos(beta*float(j)); float r,x,y; // if(i==1) { // r = radius_max; // } // else { r = radius_min+(radius_max-radius_min)*float(i)/float(m_ny); // } x = orient*r*sin(alpha*float(j)); y = orient*r*cos(alpha*float(j)); VEC3 pos(x, y, j*hS); Dart d = m_tableVertDarts[i*(m_nx+1)+j]; m_positions[d]=pos; } } } // template // void onlyTriangles(typename PFP::MAP& the_map, Dart primd) // { // DartMarker m(the_map); // // // list of faces to process and processed(before pos iterator) // std::list ld; // ld.push_back(primd); // // current position in list // typename std::list::iterator pos = ld.begin(); // do // { // Dart d = *pos; // // // cut the face of first dart of list // Dart d1 = the_map.phi1(d); // Dart e = the_map.phi1(d1); // Dart e1 = the_map.phi1(e); // Dart f = the_map.phi1(e1); // m.markOrbit(FACE, d); // if (f==d) // quad // { // Dart n = the_map.cutFace(d,e); // Dart nn = the_map.phi2(n); // // mark the face // m.mark(n); // m.mark(nn); // } // // // and store neighbours faces in the list // d = the_map.phi2(d); // e = the_map.phi2(e); // d1 = the_map.phi1(the_map.phi2(d1)); // e1 = the_map.phi1(the_map.phi2(e1)); // // if (!m.isMarked(d)) // ld.push_back(d); // if (!m.isMarked(e)) // ld.push_back(e); // if (!m.isMarked(d1)) // ld.push_back(d1); // if ((f==d) && (!m.isMarked(e1))) // ld.push_back(e1); // pos++; // }while (pos!=ld.end()); // stop when no more face to process // } // template // Dart triangleFan_topo(typename PFP::MAP& the_map, int n) // { // Dart d = the_map.newFace(3,false); // Dart e = the_map.phi1(d); // for(int i=1;i