2 // Class : Gestion des tutaux en T (like castles in scotland)
4 // Copyright (C) 2009-2011 CEA/DEN, EDF R&D
6 // This library is free software; you can redistribute it and/or
7 // modify it under the terms of the GNU Lesser General Public
8 // License as published by the Free Software Foundation; either
9 // version 2.1 of the License.
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // Lesser General Public License for more details.
16 // You should have received a copy of the GNU Lesser General Public
17 // License along with this library; if not, write to the Free Software
18 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 // See http://www.salome-platform.org/
21 // or email : webmaster.salome@opencascade.com
23 #ifndef __BI_CYLINDER_H_
24 #define __BI_CYLINDER_H_
26 #include "HexElements.hxx"
31 class BiCylinder : public Elements
34 BiCylinder (Document* doc);
36 Hexa* getHexaIJK (int part, int nx, int ny, int nz);
37 Quad* getQuadIJ (int part, int nx, int ny, int nz);
38 Quad* getQuadJK (int part, int nx, int ny, int nz);
39 Quad* getQuadIK (int part, int nx, int ny, int nz);
40 Edge* getEdgeI (int part, int nx, int ny, int nz);
41 Edge* getEdgeJ (int part, int nx, int ny, int nz);
42 Edge* getEdgeK (int part, int nx, int ny, int nz);
43 Vertex* getVertexIJK (int part, int nx, int ny, int nz);
47 virtual ~BiCylinder () {}
48 // Tutaux en T (like castles in scotland)
49 int makeCylinders (Vertex* ori1, double* vz1, double ray1, double h1,
50 Vertex* ori2, double* vz2, double ray2, double h2);
52 int makePipes (Vertex* ori1, double* z1, double ri1, double rx1, double h1,
53 Vertex* ori2, double* z2, double ri2, double rx2, double h2,
56 virtual int countHexa () { return nbr_hexas ; }
57 virtual int countQuad () { return nbr_quads ; }
58 virtual int countEdge () { return nbr_edges ; }
59 virtual int countVertex () { return nbr_vertex ; }
61 // int crossCylinders (Cylinder* cyl1, Cylinder* cyl2); // perime
65 enum { NbrSlices=5, NbrVslices=NbrSlices+1, NbrCotes=4 };
67 void createLittlePipe ();
68 void createBigPipe ();
69 void createLittleCyl ();
71 void adjustLittleSlice (int nx, int nzs);
72 void adjustLittleSquare (int nk);
74 Vertex* addVertex (double px, double py, double pz,
75 int cyl, int ni, int nj, int nk);
76 Edge* addEdge (Vertex* v1, Vertex* v2,
77 int cyl, int dir, int nx, int ny, int nz);
78 Quad* addQuad (Edge* e1, Edge* e2, Edge* e3, Edge* e4,
79 int cyl, int dir, int nx, int ny, int nz);
80 Hexa* addHexa (Quad* qa, Quad* qb, Quad* qc, Quad* qd, Quad* qe, Quad* qf,
81 int cyl, int nx, int ny, int nz);
83 Vertex* findVertex (double px, double py, double pz, int ni, int nj, int nk);
84 Edge* findEdge (Vertex* v1, Vertex* v2, int dir, int nx, int ny, int nz);
85 Quad* findQuad (Vertex* v1, Vertex* v2, int dir, int nx, int ny, int nz);
86 Quad* findQuad (Edge* e1, Edge* e2, int dir, int nx, int ny, int nz);
87 Hexa* findHexa (Quad* qa, Quad* qb, int nx, int ny, int nz);
89 Edge* findEdge (Vertex* v1, Vertex* v2);
90 Quad* findQuad (Edge* e1, Edge* e2);
92 void assoCylinder (int cyl, double* normal);
93 void assoCylinders (double* snormal, double* gnormal);
94 void assoSlice (int cyl, int nx, int nzs, double* norm);
95 void assoArc (int cyl, int nx, int ny, int nz, int subid);
96 int assoIntersection (int nx, int nzlice, double* snorm, double* bnorm);
99 void addSlice (int cyl, int i, int k, double h, double r, bool find=false);
100 void addCarre (int cyl, int k, double h, double r, bool find=false);
101 void addCube (int cyl, int k, int i=0, int k1=-1);
102 void fillSlice (int cyl, int nia, int nka, int nib, int nkb, int nic,
103 int nkc, int nid, int nkd, bool med=false);
105 double getAngle (int nj) { return (2*((nj)%4)+1)*M_PI/4; }
106 int getKey (int cyl, int ni, int nj, int nk)
107 { return 1000*(cyl+1) + 100*ni + 10*nj + nk; }
108 int getKey (int cyl, int dd, int ni, int nj, int nk)
109 { return 10000*(cyl+1) + 1000*dd + 100*ni + 10*nj + nk; }
112 Real3 cross_oribig, cross_dirbig;
113 Real3 cross_orismall, cross_dirsmall;
115 map <int,int> map_vertex, map_edge, map_quad, map_hexa;
116 map <int,int> :: iterator it_map;
118 int nbr_hexas1, nbr_quads1, nbr_edges1, nbr_vertex1;
119 double cross_rayext [V_TWO];
120 double cross_rayint [V_TWO];
121 double cross_hauteur [V_TWO];
123 bool at_right, at_left;