1 // SMESH SMDS : implementaion of Salome mesh data structure
3 // Copyright (C) 2003 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
4 // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
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.opencascade.org/SALOME/ or email : webmaster.salome@opencascade.org
24 // File : SMDS_MeshQuadrangle.cxx
25 // Author : Jean-Michel BOULCOURT
29 #include "SMDS_MeshQuadrangle.ixx"
33 //=======================================================================
34 //function : SMDS_MeshQuadrangle
36 //=======================================================================
38 SMDS_MeshQuadrangle::SMDS_MeshQuadrangle(const Standard_Integer ID,
39 const Standard_Integer idnode1,
40 const Standard_Integer idnode2,
41 const Standard_Integer idnode3,
42 const Standard_Integer idnode4):SMDS_MeshFace(ID,4)
44 SetConnections(idnode1,idnode2,idnode3,idnode4);
50 //=======================================================================
51 //function : SetConnections
53 //=======================================================================
54 void SMDS_MeshQuadrangle::SetConnections(const Standard_Integer idnode1,
55 const Standard_Integer idnode2,
56 const Standard_Integer idnode3,
57 const Standard_Integer idnode4)
59 Standard_Integer idmin = (idnode1 < idnode2 ? idnode1 : idnode2);
60 idmin = (idmin < idnode3 ? idmin : idnode3);
61 idmin = (idmin < idnode4 ? idmin : idnode4);
64 if (idmin == idnode1) {
68 } else if (idmin == idnode2) {
72 } else if (idmin == idnode3) {