2 // Class : Gestion des tutaux en T (like castles in scotland)
4 // Copyright (C) 2009-2012 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/ or email : webmaster.salome@opencascade.com
22 #ifndef __CROSS_ELEMENTS_H
23 #define __CROSS_ELEMENTS_H
25 #include "HexElements.hxx"
29 enum { NbrSlices1=6, NbrSlices2=4 };
30 enum { SizeRay=3, BiCyl=2};
31 enum { NbrVSlices1=NbrSlices1+1, NbrVSlices2=NbrSlices2+1};
32 enum { MiddleSlice1=NbrSlices1/2};
33 enum { Cyl1=CylSmall, Cyl2=CylBig };
34 enum { NO_CYL=-1, NO_PIPE=0, IS_HERE=1 };
36 class CrossElements : public Elements
39 virtual int countHexa () { return nbr_hexas ; }
40 virtual int countQuad () { return nbr_quads ; }
41 virtual int countEdge () { return nbr_edges ; }
42 virtual int countVertex () { return nbr_vertex ; }
45 CrossElements (Document* doc, EnumGrid type=GR_BICYL);
47 virtual ~CrossElements () {}
49 Hexa* getHexaIJK (int part, int nx, int ny, int nz);
50 Quad* getQuadIJ (int part, int nx, int ny, int nz);
51 Quad* getQuadJK (int part, int nx, int ny, int nz);
52 Quad* getQuadIK (int part, int nx, int ny, int nz);
53 Edge* getEdgeI (int part, int nx, int ny, int nz);
54 Edge* getEdgeJ (int part, int nx, int ny, int nz);
55 Edge* getEdgeK (int part, int nx, int ny, int nz);
56 Vertex* getVertexIJK (int part, int nx, int ny, int nz);
58 // Tutaux en T (like castles in scotland)
59 int crossCylinders (Cylinder* cyl1, Cylinder* cyl2, bool fill=true);
67 void fillGrid (int cyl, int deb=-1, int fin=-1);
68 void fillCenter (int cyl, int deb, int fin);
69 void createLittleCyl ();
72 void copyVertex (int i1, int j1, int k1, int i2, int j2, int k2);
73 void copyEdge (int d1, int i, int j, int k, int d2, int i2, int j2, int k2);
74 void copyQuad (int d1, int i, int j, int k, int d2, int i2, int j2, int k2);
76 void setVertex (int cyl, int nx, int ny, int nz, double px, double py,
79 void setVertex (Vertex* vv, int cyl, int nx, int ny, int nz);
80 void setEdge (Edge* edge, int cyl, int dir, int nx, int ny, int nz);
81 void setQuad (Quad* quad, int cyl, int dir, int nx, int ny, int nz);
82 void setHexa (Hexa* cell, int cyl, int nx, int ny, int nz);
84 Edge* addEdge (Vertex* v1, Vertex* v2, int cyl, int dir, int nx,
86 Quad* addQuad (Edge* e1, Edge* e2, Edge* e3, Edge* e4, int cyl, int dir,
87 int nx, int ny, int nz);
88 Hexa* addHexa (Quad* qa, Quad* qb, Quad* qc, Quad* qd, Quad* qe, Quad* qf,
89 int cyl, int nx, int ny, int nz);
91 int indVertex (int cyl, int nx, int ny, int nz);
92 int indHexa (int cyl, int nx, int ny, int nz);
93 int indQuad (int cyl, int dir, int nx, int ny, int nz);
94 int indEdge (int cyl, int dir, int nx, int ny, int nz);
96 Hexa* findHexa1 (Quad* q1, Quad* q2);
97 Edge* findEdge1 (Vertex* v1, Vertex* v2);
98 Quad* findQuad1 (Edge* e1, Edge* e2);
100 void assoCylinder (int cyl, double* normal);
101 void assoSlice (int cyl, double* base, double* norm, int nx, int zlice);
102 void assoArc (int cyl, int nx, int ny, int nz, int subid);
103 void assoArcMid (double mid[], int nx, int ny, int nz, double ray, int subid);
104 void assoBigMiddle (double* base, double* normal, int nzlice);
105 int assoIntersection (int nx, int nzlice, double* snorm, double* bnorm);
106 void adjustAsso (int nx, int ny, int nz, int sens);
109 double getAngle (int cyl, int ny, int nz=0);
110 double getAngleInter (int cyl, int nz);
111 void addSlice (int cyl, int ni, int nk, double px, double rayon=-1);
112 void addVertex (int cyl, int ni, int nj, int nk, double px, double rayon);
113 void majIntersection ();
114 void adjustLittleSlice (int nx, int nk, int nxbig);
117 enum {NbrIntCotes = 4 };
118 enum {size_hiy = NbrIntCotes, size_h1z = 6, size_h2z=4};
119 enum {size_v1z = size_h1z+1, size_v2z = size_h2z+1};
122 Cylinder* cross_cyl1;
123 Cylinder* cross_cyl2;
124 Vertex* cross_center;
126 int size_vz[BiCyl], size_hz[BiCyl];
127 int nbr_hexas1, nbr_quads1, nbr_edges1, nbr_vertex1;
129 double angle_inter [BiCyl];
130 double angle_intermed;
131 double cross_rayon [BiCyl][SizeRay];
132 double big_hauteur [size_v2z];
134 bool at_right, at_left;
135 int cyl_right, cyl_left;