| 1 |
// SPDX-FileCopyrightInfo: Copyright © DUNE Project contributors, see file LICENSE.md in module root |
| 2 |
// SPDX-License-Identifier: LGPL-2.1-or-later |
| 3 |
/*! \file shapes.h |
| 4 |
* \ingroup gm |
| 5 |
*/ |
| 6 |
|
| 7 |
|
| 8 |
/****************************************************************************/ |
| 9 |
/* */ |
| 10 |
/* File: shapes.h */ |
| 11 |
/* */ |
| 12 |
/* Purpose: header file for shape functions */ |
| 13 |
/* */ |
| 14 |
/* Author: Klaus Johannsen */ |
| 15 |
/* Interdisziplinaeres Zentrum fuer Wissenschaftliches Rechnen */ |
| 16 |
/* Universitaet Heidelberg */ |
| 17 |
/* Im Neuenheimer Feld 368 */ |
| 18 |
/* 6900 Heidelberg */ |
| 19 |
/* internet: [email protected] */ |
| 20 |
/* */ |
| 21 |
/* History: 28.11.95 begin, ug version 3.1 */ |
| 22 |
/* */ |
| 23 |
/* Remarks: */ |
| 24 |
/* */ |
| 25 |
/****************************************************************************/ |
| 26 |
|
| 27 |
|
| 28 |
/****************************************************************************/ |
| 29 |
/* */ |
| 30 |
/* auto include mechanism and other include files */ |
| 31 |
/* */ |
| 32 |
/****************************************************************************/ |
| 33 |
|
| 34 |
#ifndef __SHAPES__ |
| 35 |
#define __SHAPES__ |
| 36 |
|
| 37 |
#include <cmath> |
| 38 |
|
| 39 |
#include "gm.h" |
| 40 |
#include "evm.h" |
| 41 |
|
| 42 |
#include <dune/uggrid/low/namespace.h> |
| 43 |
|
| 44 |
START_UGDIM_NAMESPACE |
| 45 |
|
| 46 |
/****************************************************************************/ |
| 47 |
/* */ |
| 48 |
/* defines in the following order */ |
| 49 |
/* */ |
| 50 |
/* compile time constants defining static data size (i.e. arrays) */ |
| 51 |
/* other constants */ |
| 52 |
/* macros */ |
| 53 |
/* */ |
| 54 |
/****************************************************************************/ |
| 55 |
|
| 56 |
#ifdef UG_DIM_2 |
| 57 |
|
| 58 |
#define CORNER_COORDINATES_TRIANGLE(e,n,x) \ |
| 59 |
{(n)=3; \ |
| 60 |
(x)[0]=CVECT(MYVERTEX(CORNER((e),0))).data(); \ |
| 61 |
(x)[1]=CVECT(MYVERTEX(CORNER((e),1))).data(); \ |
| 62 |
(x)[2]=CVECT(MYVERTEX(CORNER((e),2))).data();} |
| 63 |
|
| 64 |
#define CORNER_COORDINATES_QUADRILATERAL(e,n,x) \ |
| 65 |
{(n)=4; \ |
| 66 |
(x)[0]=CVECT(MYVERTEX(CORNER((e),0))).data(); \ |
| 67 |
(x)[1]=CVECT(MYVERTEX(CORNER((e),1))).data(); \ |
| 68 |
(x)[2]=CVECT(MYVERTEX(CORNER((e),2))).data(); \ |
| 69 |
(x)[3]=CVECT(MYVERTEX(CORNER((e),3))).data();} |
| 70 |
|
| 71 |
#define CORNER_COORDINATES(e,n,x) \ |
| 72 |
{if (TAG((e))==TRIANGLE) \ |
| 73 |
CORNER_COORDINATES_TRIANGLE((e),(n),(x)) \ |
| 74 |
else CORNER_COORDINATES_QUADRILATERAL((e),(n),(x))} |
| 75 |
|
| 76 |
#endif /* UG_DIM_2 */ |
| 77 |
|
| 78 |
|
| 79 |
#define LOCAL_TO_GLOBAL_TRIANGLE(x,local,global) \ |
| 80 |
{(global)[0] = (1.0-(local)[0]-(local)[1])*(x)[0][0] \ |
| 81 |
+(local)[0]*(x)[1][0] + (local)[1]*(x)[2][0]; \ |
| 82 |
(global)[1] = (1.0-(local)[0]-(local)[1])*(x)[0][1] \ |
| 83 |
+(local)[0]*(x)[1][1] + (local)[1]*(x)[2][1]; } |
| 84 |
|
| 85 |
#define LOCAL_TO_GLOBAL_QUADRILATERAL(x,local,global) \ |
| 86 |
{(global)[0] = (1.0-(local)[0])*(1.0-(local)[1])*(x)[0][0] \ |
| 87 |
+ (local)[0]*(1.0-(local)[1])*(x)[1][0] \ |
| 88 |
+ (local)[0]*(local)[1]*(x)[2][0] \ |
| 89 |
+ (1.0-(local)[0])*(local)[1]*(x)[3][0]; \ |
| 90 |
(global)[1] = (1.0-(local)[0])*(1.0-(local)[1])*(x)[0][1] \ |
| 91 |
+ (local)[0]*(1.0-(local)[1])*(x)[1][1] \ |
| 92 |
+ (local)[0]*(local)[1]*(x)[2][1] \ |
| 93 |
+ (1.0-(local)[0])*(local)[1]*(x)[3][1];} |
| 94 |
|
| 95 |
#define LOCAL_TO_GLOBAL_2D(n,x,local,global) \ |
| 96 |
{if ((n) == 3) LOCAL_TO_GLOBAL_TRIANGLE((x),(local),(global)) \ |
| 97 |
else if ((n) == 4) LOCAL_TO_GLOBAL_QUADRILATERAL((x),(local),(global))} |
| 98 |
|
| 99 |
#define AREA_OF_TRIANGLE(x,area) {DOUBLE detJ; DOUBLE_VECTOR a,b; \ |
| 100 |
V2_SUBTRACT((x)[1],(x)[0],a); \ |
| 101 |
V2_SUBTRACT((x)[2],(x)[0],b); \ |
| 102 |
V2_VECTOR_PRODUCT(a,b,detJ); \ |
| 103 |
(area) = std::abs(detJ) * 0.5;} |
| 104 |
|
| 105 |
#define AREA_OF_QUADRILATERAL(x,area) {DOUBLE detJ,ar; DOUBLE_VECTOR a,b; \ |
| 106 |
V2_SUBTRACT((x)[1],(x)[0],a); \ |
| 107 |
V2_SUBTRACT((x)[2],(x)[0],b); \ |
| 108 |
V2_VECTOR_PRODUCT(a,b,detJ); \ |
| 109 |
ar = std::abs(detJ) * 0.5; \ |
| 110 |
V2_SUBTRACT((x)[3],(x)[0],a); \ |
| 111 |
V2_VECTOR_PRODUCT(a,b,detJ); \ |
| 112 |
(area) = std::abs(detJ) * 0.5 + ar;} |
| 113 |
|
| 114 |
#define AREA_OF_ELEMENT_2D(n,x,area) \ |
| 115 |
{if ((n) == 3) AREA_OF_TRIANGLE((x),(area)) \ |
| 116 |
else if ((n) == 4) AREA_OF_QUADRILATERAL((x),(area)) } |
| 117 |
|
| 118 |
#define TRANSFORMATION_OF_TRIANGLE(x,M) \ |
| 119 |
{ V2_SUBTRACT((x)[1],(x)[0],(M)[0]); \ |
| 120 |
V2_SUBTRACT((x)[2],(x)[0],(M)[1]); } |
| 121 |
|
| 122 |
#define TRANSFORMATION_OF_QUADRILATERAL(x,local,M) \ |
| 123 |
{ DOUBLE a; \ |
| 124 |
a = 1.0 - (local)[1]; \ |
| 125 |
(M)[0][0] = a*((x)[1][0]-x[0][0])+(local)[1]*((x)[2][0]-(x)[3][0]); \ |
| 126 |
(M)[0][1] = a*((x)[1][1]-x[0][1])+(local)[1]*((x)[2][1]-(x)[3][1]); \ |
| 127 |
a = 1.0 - (local)[0]; \ |
| 128 |
(M)[1][0] = a*((x)[3][0]-x[0][0])+(local)[0]*((x)[2][0]-(x)[1][0]); \ |
| 129 |
(M)[1][1] = a*((x)[3][1]-x[0][1])+(local)[0]*((x)[2][1]-(x)[1][1]); } |
| 130 |
|
| 131 |
#define TRANSFORMATION_2D(n,x,local,M) \ |
| 132 |
{if ((n) == 3) {TRANSFORMATION_OF_TRIANGLE((x),(M));} \ |
| 133 |
else TRANSFORMATION_OF_QUADRILATERAL((x),(local),(M)); } |
| 134 |
|
| 135 |
|
| 136 |
#ifdef UG_DIM_3 |
| 137 |
#define CORNER_COORDINATES_TETRAHEDRON(e,n,x) \ |
| 138 |
{(n) = 4; \ |
| 139 |
(x)[0]=CVECT(MYVERTEX(CORNER((e),0))).data(); \ |
| 140 |
(x)[1]=CVECT(MYVERTEX(CORNER((e),1))).data(); \ |
| 141 |
(x)[2]=CVECT(MYVERTEX(CORNER((e),2))).data(); \ |
| 142 |
(x)[3]=CVECT(MYVERTEX(CORNER((e),3))).data();} |
| 143 |
|
| 144 |
#define CORNER_COORDINATES_PYRAMID(e,n,x) \ |
| 145 |
{(n) = 5; \ |
| 146 |
(x)[0]=CVECT(MYVERTEX(CORNER((e),0))).data(); \ |
| 147 |
(x)[1]=CVECT(MYVERTEX(CORNER((e),1))).data(); \ |
| 148 |
(x)[2]=CVECT(MYVERTEX(CORNER((e),2))).data(); \ |
| 149 |
(x)[3]=CVECT(MYVERTEX(CORNER((e),3))).data(); \ |
| 150 |
(x)[4]=CVECT(MYVERTEX(CORNER((e),4))).data();} |
| 151 |
|
| 152 |
#define CORNER_COORDINATES_PRISM(e,n,x) \ |
| 153 |
{(n) = 6; \ |
| 154 |
(x)[0]=CVECT(MYVERTEX(CORNER((e),0))).data(); \ |
| 155 |
(x)[1]=CVECT(MYVERTEX(CORNER((e),1))).data(); \ |
| 156 |
(x)[2]=CVECT(MYVERTEX(CORNER((e),2))).data(); \ |
| 157 |
(x)[3]=CVECT(MYVERTEX(CORNER((e),3))).data(); \ |
| 158 |
(x)[4]=CVECT(MYVERTEX(CORNER((e),4))).data(); \ |
| 159 |
(x)[5]=CVECT(MYVERTEX(CORNER((e),5))).data();} |
| 160 |
|
| 161 |
#define CORNER_COORDINATES_HEXAHEDRON(e,n,x) \ |
| 162 |
{(n) = 8; \ |
| 163 |
(x)[0]=CVECT(MYVERTEX(CORNER((e),0))).data(); \ |
| 164 |
(x)[1]=CVECT(MYVERTEX(CORNER((e),1))).data(); \ |
| 165 |
(x)[2]=CVECT(MYVERTEX(CORNER((e),2))).data(); \ |
| 166 |
(x)[3]=CVECT(MYVERTEX(CORNER((e),3))).data(); \ |
| 167 |
(x)[4]=CVECT(MYVERTEX(CORNER((e),4))).data(); \ |
| 168 |
(x)[5]=CVECT(MYVERTEX(CORNER((e),5))).data(); \ |
| 169 |
(x)[6]=CVECT(MYVERTEX(CORNER((e),6))).data(); \ |
| 170 |
(x)[7]=CVECT(MYVERTEX(CORNER((e),7))).data();} |
| 171 |
|
| 172 |
#define CORNER_COORDINATES(e,n,x) \ |
| 173 |
{if (TAG((e))==TETRAHEDRON) CORNER_COORDINATES_TETRAHEDRON((e),(n),(x))\ |
| 174 |
else if (TAG((e))==PYRAMID) CORNER_COORDINATES_PYRAMID((e),(n),(x)) \ |
| 175 |
else if (TAG((e))==PRISM) CORNER_COORDINATES_PRISM((e),(n),(x)) \ |
| 176 |
else CORNER_COORDINATES_HEXAHEDRON((e),(n),(x))} |
| 177 |
|
| 178 |
#endif /* UG_DIM_3 */ |
| 179 |
|
| 180 |
|
| 181 |
#define LOCAL_TO_GLOBAL_TETRAHEDRON(x,local,global) \ |
| 182 |
{(global)[0] = (1.0-(local)[0]-(local)[1]-(local)[2])*(x)[0][0] \ |
| 183 |
+(local)[0]*(x)[1][0] + (local)[1]*(x)[2][0] + (local)[2]*(x)[3][0]; \ |
| 184 |
(global)[1] = (1.0-(local)[0]-(local)[1]-(local)[2])*(x)[0][1] \ |
| 185 |
+(local)[0]*(x)[1][1] + (local)[1]*(x)[2][1] + (local)[2]*(x)[3][1]; \ |
| 186 |
(global)[2] = (1.0-(local)[0]-(local)[1]-(local)[2])*(x)[0][2] \ |
| 187 |
+(local)[0]*(x)[1][2] + (local)[1]*(x)[2][2] + (local)[2]*(x)[3][2]; } |
| 188 |
|
| 189 |
#define LOCAL_TO_GLOBAL_PYRAMID(x,local,global) \ |
| 190 |
{DOUBLE a,b,a0,a1,a2,a3; \ |
| 191 |
a = 1.0 - (local)[0]; \ |
| 192 |
b = 1.0 - (local)[1]; \ |
| 193 |
if ((local)[0] > (local)[1]) { \ |
| 194 |
a0 = a * b - (local)[2] * b; \ |
| 195 |
a1 = (local)[0] * b - (local)[2]*(local)[1]; \ |
| 196 |
a2 = (local)[0] * (local)[1] + (local)[2]*(local)[1]; \ |
| 197 |
a3 = a * (local)[1] - (local)[2] * (local)[1]; \ |
| 198 |
(global)[0] = \ |
| 199 |
a0*(x)[0][0]+a1*(x)[1][0]+a2*(x)[2][0]+a3*(x)[3][0]+(local)[2]*(x)[4][0]; \ |
| 200 |
(global)[1] = \ |
| 201 |
a0*(x)[0][1]+a1*(x)[1][1]+a2*(x)[2][1]+a3*(x)[3][1]+(local)[2]*(x)[4][1]; \ |
| 202 |
(global)[2] = \ |
| 203 |
a0*(x)[0][2]+a1*(x)[1][2]+a2*(x)[2][2]+a3*(x)[3][2]+(local)[2]*(x)[4][2];}\ |
| 204 |
else { \ |
| 205 |
a0 = a * b - (local)[2] * a; \ |
| 206 |
a1 = (local)[0] * b - (local)[2]*(local)[0]; \ |
| 207 |
a2 = (local)[0] * (local)[1] + (local)[2]*(local)[0]; \ |
| 208 |
a3 = a * (local)[1] - (local)[2] * (local)[0]; \ |
| 209 |
(global)[0] = \ |
| 210 |
a0*(x)[0][0]+a1*(x)[1][0]+a2*(x)[2][0]+a3*(x)[3][0]+(local)[2]*(x)[4][0]; \ |
| 211 |
(global)[1] = \ |
| 212 |
a0*(x)[0][1]+a1*(x)[1][1]+a2*(x)[2][1]+a3*(x)[3][1]+(local)[2]*(x)[4][1]; \ |
| 213 |
(global)[2] = \ |
| 214 |
a0*(x)[0][2]+a1*(x)[1][2]+a2*(x)[2][2]+a3*(x)[3][2]+(local)[2]*(x)[4][2];}} |
| 215 |
|
| 216 |
#define LOCAL_TO_GLOBAL_PRISM(x,local,global) \ |
| 217 |
{DOUBLE a,b,a0,a1,a2,a3,a4,a5; \ |
| 218 |
a = 1.0 - (local)[0] - (local)[1]; \ |
| 219 |
b = 1.0 - (local)[2]; \ |
| 220 |
a0 = a * b; \ |
| 221 |
a1 = (local)[0] * b; \ |
| 222 |
a2 = (local)[1] * b; \ |
| 223 |
a3 = a * (local)[2]; \ |
| 224 |
a4 = (local)[0] * (local)[2]; \ |
| 225 |
a5 = (local)[1] * (local)[2]; \ |
| 226 |
(global)[0] = \ |
| 227 |
a0*(x)[0][0]+a1*(x)[1][0]+a2*(x)[2][0]+a3*(x)[3][0]+ \ |
| 228 |
a4*(x)[4][0]+a5*(x)[5][0]; \ |
| 229 |
(global)[1] = \ |
| 230 |
a0*(x)[0][1]+a1*(x)[1][1]+a2*(x)[2][1]+a3*(x)[3][1]+ \ |
| 231 |
a4*(x)[4][1]+a5*(x)[5][1]; \ |
| 232 |
(global)[2] = \ |
| 233 |
a0*(x)[0][2]+a1*(x)[1][2]+a2*(x)[2][2]+a3*(x)[3][2]+ \ |
| 234 |
a4*(x)[4][2]+a5*(x)[5][2]; } |
| 235 |
|
| 236 |
#define LOCAL_TO_GLOBAL_HEXAHEDRON(x,local,global) \ |
| 237 |
{DOUBLE a,b,c,a0,a1,a2,a3,a4,a5,a6,a7; \ |
| 238 |
a = 1.0 - (local)[0]; \ |
| 239 |
b = 1.0 - (local)[1]; \ |
| 240 |
c = 1.0 - (local)[2]; \ |
| 241 |
a0 = a * b * c; \ |
| 242 |
a1 = (local)[0] * b * c; \ |
| 243 |
a2 = (local)[0] * (local)[1] * c; \ |
| 244 |
a3 = a * (local)[1] * c; \ |
| 245 |
a4 = a * b * (local)[2]; \ |
| 246 |
a5 = (local)[0] * b * (local)[2]; \ |
| 247 |
a6 = (local)[0] * (local)[1] * (local)[2]; \ |
| 248 |
a7 = a * (local)[1] * (local)[2]; \ |
| 249 |
(global)[0] = \ |
| 250 |
a0*(x)[0][0]+a1*(x)[1][0]+a2*(x)[2][0]+a3*(x)[3][0]+ \ |
| 251 |
a4*(x)[4][0]+a5*(x)[5][0]+a6*(x)[6][0]+a7*(x)[7][0]; \ |
| 252 |
(global)[1] = \ |
| 253 |
a0*(x)[0][1]+a1*(x)[1][1]+a2*(x)[2][1]+a3*(x)[3][1]+ \ |
| 254 |
a4*(x)[4][1]+a5*(x)[5][1]+a6*(x)[6][1]+a7*(x)[7][1]; \ |
| 255 |
(global)[2] = \ |
| 256 |
a0*(x)[0][2]+a1*(x)[1][2]+a2*(x)[2][2]+a3*(x)[3][2]+ \ |
| 257 |
a4*(x)[4][2]+a5*(x)[5][2]+a6*(x)[6][2]+a7*(x)[7][2]; } |
| 258 |
|
| 259 |
#define LOCAL_TO_GLOBAL_3D(n,x,local,global) \ |
| 260 |
{if ((n) == 4) LOCAL_TO_GLOBAL_TETRAHEDRON((x),(local),(global)) \ |
| 261 |
else if ((n) == 5) LOCAL_TO_GLOBAL_PYRAMID((x),(local),(global)) \ |
| 262 |
else if ((n) == 6) LOCAL_TO_GLOBAL_PRISM((x),(local),(global)) \ |
| 263 |
else if ((n) == 8) LOCAL_TO_GLOBAL_HEXAHEDRON((x),(local),(global))} |
| 264 |
|
| 265 |
#define AREA_OF_TETRAHEDRON(x,area) {DOUBLE detJ; DOUBLE_VECTOR a,b,c; \ |
| 266 |
V3_SUBTRACT((x)[1],(x)[0],a); \ |
| 267 |
V3_SUBTRACT((x)[2],(x)[0],b); \ |
| 268 |
V3_VECTOR_PRODUCT(a,b,c); \ |
| 269 |
V3_SUBTRACT((x)[3],(x)[0],a); \ |
| 270 |
V3_SCALAR_PRODUCT(a,c,detJ); \ |
| 271 |
(area) = std::abs(detJ)/6.0;} |
| 272 |
|
| 273 |
#define AREA_OF_PYRAMID(x,area) {DOUBLE detJ,ar; DOUBLE_VECTOR a,b,c,d;\ |
| 274 |
V3_SUBTRACT((x)[1],(x)[0],a); \ |
| 275 |
V3_SUBTRACT((x)[2],(x)[0],b); \ |
| 276 |
V3_VECTOR_PRODUCT(a,b,c); \ |
| 277 |
V3_SUBTRACT((x)[4],(x)[0],d); \ |
| 278 |
V3_SCALAR_PRODUCT(c,d,detJ); \ |
| 279 |
ar = std::abs(detJ)/6.0; \ |
| 280 |
V3_SUBTRACT((x)[3],(x)[0],a); \ |
| 281 |
V3_VECTOR_PRODUCT(a,b,c); \ |
| 282 |
V3_SCALAR_PRODUCT(c,d,detJ); \ |
| 283 |
(area) = std::abs(detJ)/6.0 + ar;} |
| 284 |
|
| 285 |
#define AREA_OF_PRISM(x,area) {DOUBLE detJ,ar; DOUBLE_VECTOR a,b,c; \ |
| 286 |
V3_SUBTRACT((x)[1],(x)[0],a); \ |
| 287 |
V3_SUBTRACT((x)[2],(x)[0],b); \ |
| 288 |
V3_VECTOR_PRODUCT(a,b,c); \ |
| 289 |
V3_SUBTRACT((x)[3],(x)[0],a); \ |
| 290 |
V3_SCALAR_PRODUCT(a,c,detJ); \ |
| 291 |
ar = std::abs(detJ)/6.0; \ |
| 292 |
V3_SUBTRACT((x)[2],(x)[1],a); \ |
| 293 |
V3_SUBTRACT((x)[3],(x)[1],b); \ |
| 294 |
V3_VECTOR_PRODUCT(a,b,c); \ |
| 295 |
V3_SUBTRACT((x)[4],(x)[1],a); \ |
| 296 |
V3_SCALAR_PRODUCT(a,c,detJ); \ |
| 297 |
ar += std::abs(detJ)/6.0; \ |
| 298 |
V3_SUBTRACT((x)[2],(x)[5],a); \ |
| 299 |
V3_SUBTRACT((x)[3],(x)[5],b); \ |
| 300 |
V3_VECTOR_PRODUCT(a,b,c); \ |
| 301 |
V3_SUBTRACT((x)[4],(x)[5],a); \ |
| 302 |
V3_SCALAR_PRODUCT(a,c,detJ); \ |
| 303 |
(area) = std::abs(detJ)/6.0 + ar;} |
| 304 |
|
| 305 |
#define AREA_OF_HEXAHEDRON(x,area) {DOUBLE detJ,ar; DOUBLE_VECTOR a,b,c; \ |
| 306 |
V3_SUBTRACT((x)[1],(x)[0],a); \ |
| 307 |
V3_SUBTRACT((x)[2],(x)[0],b); \ |
| 308 |
V3_VECTOR_PRODUCT(a,b,c); \ |
| 309 |
V3_SUBTRACT((x)[5],(x)[0],a); \ |
| 310 |
V3_SCALAR_PRODUCT(a,c,detJ); \ |
| 311 |
ar = std::abs(detJ)/6.0; \ |
| 312 |
V3_SUBTRACT((x)[2],(x)[0],a); \ |
| 313 |
V3_SUBTRACT((x)[5],(x)[0],b); \ |
| 314 |
V3_VECTOR_PRODUCT(a,b,c); \ |
| 315 |
V3_SUBTRACT((x)[6],(x)[0],a); \ |
| 316 |
V3_SCALAR_PRODUCT(a,c,detJ); \ |
| 317 |
ar += std::abs(detJ)/6.0; \ |
| 318 |
V3_SUBTRACT((x)[4],(x)[0],a); \ |
| 319 |
V3_SUBTRACT((x)[5],(x)[0],b); \ |
| 320 |
V3_VECTOR_PRODUCT(a,b,c); \ |
| 321 |
V3_SUBTRACT((x)[6],(x)[0],a); \ |
| 322 |
V3_SCALAR_PRODUCT(a,c,detJ); \ |
| 323 |
ar += std::abs(detJ)/6.0; \ |
| 324 |
V3_SUBTRACT((x)[2],(x)[0],a); \ |
| 325 |
V3_SUBTRACT((x)[3],(x)[0],b); \ |
| 326 |
V3_VECTOR_PRODUCT(a,b,c); \ |
| 327 |
V3_SUBTRACT((x)[6],(x)[0],a); \ |
| 328 |
V3_SCALAR_PRODUCT(a,c,detJ); \ |
| 329 |
ar += std::abs(detJ)/6.0; \ |
| 330 |
V3_SUBTRACT((x)[3],(x)[0],a); \ |
| 331 |
V3_SUBTRACT((x)[4],(x)[0],b); \ |
| 332 |
V3_VECTOR_PRODUCT(a,b,c); \ |
| 333 |
V3_SUBTRACT((x)[6],(x)[0],a); \ |
| 334 |
V3_SCALAR_PRODUCT(a,c,detJ); \ |
| 335 |
ar += std::abs(detJ)/6.0; \ |
| 336 |
V3_SUBTRACT((x)[3],(x)[7],a); \ |
| 337 |
V3_SUBTRACT((x)[4],(x)[7],b); \ |
| 338 |
V3_VECTOR_PRODUCT(a,b,c); \ |
| 339 |
V3_SUBTRACT((x)[6],(x)[7],a); \ |
| 340 |
V3_SCALAR_PRODUCT(a,c,detJ); \ |
| 341 |
(area) = std::abs(detJ)/6.0 + ar;} |
| 342 |
|
| 343 |
#define AREA_OF_ELEMENT_3D(n,x,area) \ |
| 344 |
{if ((n) == 4) {AREA_OF_TETRAHEDRON((x),(area));} \ |
| 345 |
else if ((n) == 5) {AREA_OF_PYRAMID((x),(area));} \ |
| 346 |
else if ((n) == 6) {AREA_OF_PRISM((x),(area));} \ |
| 347 |
else if ((n) == 8) {AREA_OF_HEXAHEDRON((x),(area));}} |
| 348 |
|
| 349 |
#define TRANSFORMATION_OF_TETRAHEDRON(x,M) \ |
| 350 |
{ V3_SUBTRACT((x)[1],(x)[0],(M)[0]); \ |
| 351 |
V3_SUBTRACT((x)[2],(x)[0],(M)[1]); \ |
| 352 |
V3_SUBTRACT((x)[3],(x)[0],(M)[2]);} |
| 353 |
|
| 354 |
#define TRANSFORMATION_OF_PYRAMID(x,local,M) \ |
| 355 |
{ DOUBLE a,b,c; \ |
| 356 |
a = (x)[0][0]-(x)[1][0]+(x)[2][0]-(x)[3][0]; \ |
| 357 |
b = (x)[0][1]-(x)[1][1]+(x)[2][1]-(x)[3][1]; \ |
| 358 |
c = (x)[0][2]-(x)[1][2]+(x)[2][2]-(x)[3][2]; \ |
| 359 |
if ((local)[0] > (local)[1]) { \ |
| 360 |
(M)[0][0] = (x)[1][0]-(x)[0][0]+(local)[1]*a; \ |
| 361 |
(M)[0][1] = (x)[1][1]-(x)[0][1]+(local)[1]*b; \ |
| 362 |
(M)[0][2] = (x)[1][2]-(x)[0][2]+(local)[1]*c; \ |
| 363 |
(M)[1][0] = (x)[3][0]-(x)[0][0]+((local)[0]+(local)[2])*a; \ |
| 364 |
(M)[1][1] = (x)[3][1]-(x)[0][1]+((local)[0]+(local)[2])*b; \ |
| 365 |
(M)[1][2] = (x)[3][2]-(x)[0][2]+((local)[0]+(local)[2])*c; \ |
| 366 |
(M)[2][0] = (x)[4][0]-(x)[0][0]+(local)[1]*a; \ |
| 367 |
(M)[2][1] = (x)[4][1]-(x)[0][1]+(local)[1]*b; \ |
| 368 |
(M)[2][2] = (x)[4][2]-(x)[0][2]+(local)[1]*c;} \ |
| 369 |
else { \ |
| 370 |
(M)[0][0] = (x)[1][0]-(x)[0][0]+((local)[1]+(local)[2])*a; \ |
| 371 |
(M)[0][1] = (x)[1][1]-(x)[0][1]+((local)[1]+(local)[2])*b; \ |
| 372 |
(M)[0][2] = (x)[1][2]-(x)[0][2]+((local)[1]+(local)[2])*c; \ |
| 373 |
(M)[1][0] = (x)[3][0]-(x)[0][0]+(local)[0]*a; \ |
| 374 |
(M)[1][1] = (x)[3][1]-(x)[0][1]+(local)[0]*b; \ |
| 375 |
(M)[1][2] = (x)[3][2]-(x)[0][2]+(local)[0]*c; \ |
| 376 |
(M)[2][0] = (x)[4][0]-(x)[0][0]+(local)[0]*a; \ |
| 377 |
(M)[2][1] = (x)[4][1]-(x)[0][1]+(local)[0]*b; \ |
| 378 |
(M)[2][2] = (x)[4][2]-(x)[0][2]+(local)[0]*c;} } |
| 379 |
|
| 380 |
#define TRANSFORMATION_OF_PRISM(x,local,M) \ |
| 381 |
{ DOUBLE a0,a1,a2,b0,b1,b2; \ |
| 382 |
a0 = (x)[0][0]-(x)[1][0]-(x)[3][0]+(x)[4][0]; \ |
| 383 |
a1 = (x)[0][1]-(x)[1][1]-(x)[3][1]+(x)[4][1]; \ |
| 384 |
a2 = (x)[0][2]-(x)[1][2]-(x)[3][2]+(x)[4][2]; \ |
| 385 |
b0 = (x)[0][0]-(x)[2][0]-(x)[3][0]+(x)[5][0]; \ |
| 386 |
b1 = (x)[0][1]-(x)[2][1]-(x)[3][1]+(x)[5][1]; \ |
| 387 |
b2 = (x)[0][2]-(x)[2][2]-(x)[3][2]+(x)[5][2]; \ |
| 388 |
(M)[0][0] = (x)[1][0]-(x)[0][0]+(local)[2]*a0; \ |
| 389 |
(M)[0][1] = (x)[1][1]-(x)[0][1]+(local)[2]*a1; \ |
| 390 |
(M)[0][2] = (x)[1][2]-(x)[0][2]+(local)[2]*a2; \ |
| 391 |
(M)[1][0] = (x)[2][0]-(x)[0][0]+(local)[2]*b0; \ |
| 392 |
(M)[1][1] = (x)[2][1]-(x)[0][1]+(local)[2]*b1; \ |
| 393 |
(M)[1][2] = (x)[2][2]-(x)[0][2]+(local)[2]*b2; \ |
| 394 |
(M)[2][0] = (x)[3][0]-(x)[0][0]+(local)[0]*a0+(local)[1]*b0; \ |
| 395 |
(M)[2][1] = (x)[3][1]-(x)[0][1]+(local)[0]*a1+(local)[1]*b1; \ |
| 396 |
(M)[2][2] = (x)[3][2]-(x)[0][2]+(local)[0]*a2+(local)[1]*b2;} |
| 397 |
|
| 398 |
#define TRANSFORMATION_OF_HEXAHEDRON(x,local,M) \ |
| 399 |
{ DOUBLE a,b,c,a0,a1,a2,a3; \ |
| 400 |
a = 1.0 - (local)[0]; \ |
| 401 |
b = 1.0 - (local)[1]; \ |
| 402 |
c = 1.0 - (local)[2]; \ |
| 403 |
a0 = b * c; \ |
| 404 |
a1 = (local)[1] * c; \ |
| 405 |
a2 = (local)[1] * (local)[2]; \ |
| 406 |
a3 = b * (local)[2]; \ |
| 407 |
(M)[0][0] = a0*((x)[1][0]-x[0][0])+a1*((x)[2][0]-(x)[3][0]) \ |
| 408 |
+ a2*((x)[6][0]-x[7][0])+a3*((x)[5][0]-(x)[4][0]); \ |
| 409 |
(M)[0][1] = a0*((x)[1][1]-x[0][1])+a1*((x)[2][1]-(x)[3][1]) \ |
| 410 |
+ a2*((x)[6][1]-x[7][1])+a3*((x)[5][1]-(x)[4][1]); \ |
| 411 |
(M)[0][2] = a0*((x)[1][2]-x[0][2])+a1*((x)[2][2]-(x)[3][2]) \ |
| 412 |
+ a2*((x)[6][2]-x[7][2])+a3*((x)[5][2]-(x)[4][2]); \ |
| 413 |
a0 = a * c; \ |
| 414 |
a1 = (local)[0] * c; \ |
| 415 |
a2 = (local)[0] * (local)[2]; \ |
| 416 |
a3 = a * (local)[2]; \ |
| 417 |
(M)[1][0] = a0*((x)[3][0]-x[0][0])+a1*((x)[2][0]-(x)[1][0]) \ |
| 418 |
+ a2*((x)[6][0]-x[5][0])+a3*((x)[7][0]-(x)[4][0]); \ |
| 419 |
(M)[1][1] = a0*((x)[3][1]-x[0][1])+a1*((x)[2][1]-(x)[1][1]) \ |
| 420 |
+ a2*((x)[6][1]-x[5][1])+a3*((x)[7][1]-(x)[4][1]); \ |
| 421 |
(M)[1][2] = a0*((x)[3][2]-x[0][2])+a1*((x)[2][2]-(x)[1][2]) \ |
| 422 |
+ a2*((x)[6][2]-x[5][2])+a3*((x)[7][2]-(x)[4][2]); \ |
| 423 |
a0 = a * b; \ |
| 424 |
a1 = (local)[0] * b; \ |
| 425 |
a2 = (local)[0] * (local)[1]; \ |
| 426 |
a3 = a * (local)[1]; \ |
| 427 |
(M)[2][0] = a0*((x)[4][0]-x[0][0])+a1*((x)[5][0]-(x)[1][0]) \ |
| 428 |
+ a2*((x)[6][0]-x[2][0])+a3*((x)[7][0]-(x)[3][0]); \ |
| 429 |
(M)[2][1] = a0*((x)[4][1]-x[0][1])+a1*((x)[5][1]-(x)[1][1]) \ |
| 430 |
+ a2*((x)[6][1]-x[2][1])+a3*((x)[7][1]-(x)[3][1]); \ |
| 431 |
(M)[2][2] = a0*((x)[4][2]-x[0][2])+a1*((x)[5][2]-(x)[1][2]) \ |
| 432 |
+ a2*((x)[6][2]-x[2][2])+a3*((x)[7][2]-(x)[3][2]); } |
| 433 |
|
| 434 |
#define TRANSFORMATION_3D(n,x,local,M) \ |
| 435 |
{if ((n) == 4) {TRANSFORMATION_OF_TETRAHEDRON((x),(M));} \ |
| 436 |
else if ((n) == 5) {TRANSFORMATION_OF_PYRAMID((x),(local),(M));} \ |
| 437 |
else if ((n) == 6) {TRANSFORMATION_OF_PRISM((x),(local),(M));} \ |
| 438 |
else TRANSFORMATION_OF_HEXAHEDRON((x),(local),(M));} |
| 439 |
|
| 440 |
|
| 441 |
#ifdef UG_DIM_2 |
| 442 |
#define LOCAL_TO_GLOBAL(n,x,local,global) LOCAL_TO_GLOBAL_2D(n,x,local,global) |
| 443 |
#define AREA_OF_ELEMENT(n,x,area) AREA_OF_ELEMENT_2D(n,x,area) |
| 444 |
#define TRANSFORMATION(n,x,local,M) TRANSFORMATION_2D(n,x,local,M) |
| 445 |
#endif /* UG_DIM_2 */ |
| 446 |
|
| 447 |
#ifdef UG_DIM_3 |
| 448 |
#define TRANSFORMATION_BND(n,x,local,M) TRANSFORMATION_2D(n,x,local,M) |
| 449 |
#define LOCAL_TO_GLOBAL_BND(n,x,local,global) LOCAL_TO_GLOBAL_2D(n,x,local,global) |
| 450 |
#define AREA_OF_ELEMENT_BND(n,x,area) AREA_OF_ELEMENT_2D(n,x,area) |
| 451 |
#define AREA_OF_REF_BND(n,area) AREA_OF_REF_2D(n,area) |
| 452 |
|
| 453 |
#define LOCAL_TO_GLOBAL(n,x,local,global) LOCAL_TO_GLOBAL_3D(n,x,local,global) |
| 454 |
#define AREA_OF_ELEMENT(n,x,area) AREA_OF_ELEMENT_3D(n,x,area) |
| 455 |
#define TRANSFORMATION(n,x,local,M) TRANSFORMATION_3D(n,x,local,M) |
| 456 |
#endif /* UG_DIM_3 */ |
| 457 |
|
| 458 |
#define INVERSE_TRANSFORMATION(n,x,local,Jinv,Jdet) \ |
| 459 |
{ DOUBLE_VECTOR J[DIM]; \ |
| 460 |
TRANSFORMATION((n),(x),(local),J); \ |
| 461 |
M_DIM_INVERT(J,(Jinv),(Jdet)); } |
| 462 |
|
| 463 |
/****************************************************************************/ |
| 464 |
/* */ |
| 465 |
/* data structures exported by the corresponding source file */ |
| 466 |
/* */ |
| 467 |
/****************************************************************************/ |
| 468 |
|
| 469 |
/****************************************************************************/ |
| 470 |
/* */ |
| 471 |
/* definition of exported global variables */ |
| 472 |
/* */ |
| 473 |
/****************************************************************************/ |
| 474 |
|
| 475 |
/****************************************************************************/ |
| 476 |
/* */ |
| 477 |
/* function declarations */ |
| 478 |
/* */ |
| 479 |
/****************************************************************************/ |
| 480 |
|
| 481 |
INT UG_GlobalToLocal (INT n, const DOUBLE **Corners, const FieldVector<DOUBLE,DIM>& EvalPoint, FieldVector<DOUBLE,DIM>& LocalCoord); |
| 482 |
|
| 483 |
#ifdef UG_DIM_3 |
| 484 |
DOUBLE N (const INT i, const DOUBLE *LocalCoord); |
| 485 |
INT TetraSideNormals (ELEMENT *theElement, DOUBLE **theCorners, DOUBLE_VECTOR theNormals[MAX_SIDES_OF_ELEM]); |
| 486 |
INT TetMaxSideAngle (ELEMENT *theElement, const DOUBLE **theCorners, DOUBLE *MaxAngle); |
| 487 |
INT TetAngleAndLength (ELEMENT *theElement, const DOUBLE **theCorners, DOUBLE *Angle, DOUBLE *Length); |
| 488 |
#endif |
| 489 |
|
| 490 |
END_UGDIM_NAMESPACE |
| 491 |
|
| 492 |
#endif |