/usr/include/getfem/getfem_contact_and_friction_common.h is in libgetfem++-dev 4.2.1~beta1~svn4635~dfsg-3+b1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 | /* -*- c++ -*- (enables emacs c++ mode) */
/*===========================================================================
Copyright (C) 2011-2013 Yves Renard, Konstantinos Poulios.
This file is a part of GETFEM++
Getfem++ 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 3 of the License, or
(at your option) any later version along with the GCC Runtime Library
Exception either version 3.1 or (at your option) any later version.
This program 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 and GCC Runtime Library Exception for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program; if not, write to the Free Software Foundation,
Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA.
As a special exception, you may use this file as it is a part of a free
software library without restriction. Specifically, if other files
instantiate templates or use macros or inline functions from this file,
or you compile this file and link it with other files to produce an
executable, this file does not by itself cause the resulting executable
to be covered by the GNU Lesser General Public License. This exception
does not however invalidate any other reasons why the executable file
might be covered by the GNU Lesser General Public License.
===========================================================================*/
/** @file getfem_contact_and_friction_common.h
@author Yves Renard <Yves.Renard@insa-lyon.fr>
@author Konstantinos Poulios <logari81@googlemail.com>
@date November, 2011.
@brief Comomon tools for unilateral contact and Coulomb friction bricks.
*/
#ifndef GETFEM_CONTACT_AND_FRICTION_COMMON_H__
#define GETFEM_CONTACT_AND_FRICTION_COMMON_H__
#include "getfem_models.h"
#include "getfem_assembling_tensors.h"
#include "getfem/bgeot_rtree.h"
#include <getfem/getfem_mesher.h>
#include <getfem/getfem_arch_config.h>
#if GETFEM_HAVE_MUPARSER_MUPARSER_H
#include <muParser/muParser.h>
#elif GETFEM_HAVE_MUPARSER_H
#include <muParser.h>
#endif
namespace getfem {
//=========================================================================
//
// Projection on a ball and gradient of the projection.
//
//=========================================================================
template<typename VEC> void ball_projection(const VEC &x,
scalar_type radius) {
if (radius <= scalar_type(0))
gmm::clear(const_cast<VEC&>(x));
else {
scalar_type a = gmm::vect_norm2(x);
if (a > radius) gmm::scale(const_cast<VEC&>(x), radius/a);
}
}
template<typename VEC, typename VECR>
void ball_projection_grad_r(const VEC &x, scalar_type radius,
VECR &g) {
if (radius > scalar_type(0)) {
scalar_type a = gmm::vect_norm2(x);
if (a >= radius) {
gmm::copy(x, g); gmm::scale(g, scalar_type(1)/a);
return;
}
}
gmm::clear(g);
}
template <typename VEC, typename MAT>
void ball_projection_grad(const VEC &x, scalar_type radius, MAT &g) {
if (radius <= scalar_type(0)) { gmm::clear(g); return; }
gmm::copy(gmm::identity_matrix(), g);
scalar_type a = gmm::vect_norm2(x);
if (a >= radius) {
gmm::scale(g, radius/a);
// gmm::rank_one_update(g, gmm::scaled(x, -radius/(a*a*a)), x);
for (size_type i = 0; i < x.size(); ++i)
for (size_type j = 0; j < x.size(); ++j)
g(i,j) -= radius*x[i]*x[j] / (a*a*a);
}
}
template <typename VEC, typename VECR>
void coupled_projection(const VEC &x, const VEC &n,
scalar_type f, VECR &g) {
scalar_type xn = gmm::vect_sp(x, n);
scalar_type xnm = gmm::neg(xn);
scalar_type th = f * xnm;
scalar_type xtn = gmm::sqrt(gmm::vect_norm2_sqr(x) - xn*xn);
gmm::copy(gmm::scaled(n, -xnm), g);
if (th > scalar_type(0)) {
if (xtn <= th) {
gmm::add(x, g);
gmm::add(gmm::scaled(n, -xn), g);
} else {
gmm::add(gmm::scaled(x, f*xnm/xtn), g);
gmm::add(gmm::scaled(n, -f*xnm*xn/xtn), g);
}
}
}
template <typename VEC, typename MAT>
void coupled_projection_grad(const VEC &x, const VEC &n,
scalar_type f, MAT &g) {
scalar_type xn = gmm::vect_sp(x, n);
scalar_type xnm = gmm::neg(xn);
scalar_type th = f * xnm;
scalar_type xtn = gmm::sqrt(gmm::vect_norm2_sqr(x) - xn*xn);
size_type N = gmm::vect_size(x);
gmm::clear(g);
if (th > scalar_type(0)) {
if (xtn <= th) {
gmm::copy(gmm::identity_matrix(), g);
gmm::rank_one_update(g, gmm::scaled(n, -scalar_type(1)), n);
} else if (xn < scalar_type(0)) {
static base_small_vector t; gmm::resize(t, N);
gmm::add(x, gmm::scaled(n, -xn), t);
gmm::scale(t, scalar_type(1)/xtn);
if (N > 2) {
gmm::copy(gmm::identity_matrix(), g);
gmm::rank_one_update(g, gmm::scaled(t, -scalar_type(1)), t);
gmm::rank_one_update(g, gmm::scaled(n, -scalar_type(1)), n);
gmm::scale(g, -xn*th/xtn);
}
gmm::rank_one_update(g, gmm::scaled(t, -f), n);
}
}
if (xn < scalar_type(0)) gmm::rank_one_update(g, n, n);
}
//=========================================================================
//
// De Saxce projection and its gradients.
//
//=========================================================================
template<typename VEC>
void De_Saxce_projection(const VEC &x, const VEC &n_, scalar_type f) {
static base_small_vector n; // For more robustness, n_ is not supposed unitary
size_type N = gmm::vect_size(x);
gmm::resize(n, N);
gmm::copy(gmm::scaled(n_, scalar_type(1)/gmm::vect_norm2(n_)), n);
scalar_type xn = gmm::vect_sp(x, n);
scalar_type nxt = sqrt(gmm::abs(gmm::vect_norm2_sqr(x) - xn*xn));
if (xn >= scalar_type(0) && f * nxt <= xn) {
gmm::clear(const_cast<VEC&>(x));
} else if (xn > scalar_type(0) || nxt > -f*xn) {
gmm::add(gmm::scaled(n, -xn), const_cast<VEC&>(x));
gmm::scale(const_cast<VEC&>(x), -f / nxt);
gmm::add(n, const_cast<VEC&>(x));
gmm::scale(const_cast<VEC&>(x), (xn - f * nxt) / (f*f+scalar_type(1)));
}
}
template<typename VEC, typename MAT>
void De_Saxce_projection_grad(const VEC &x, const VEC &n_,
scalar_type f, MAT &g) {
static base_small_vector n;
size_type N = gmm::vect_size(x);
gmm::resize(n, N);
gmm::copy(gmm::scaled(n_, scalar_type(1)/gmm::vect_norm2(n_)), n);
scalar_type xn = gmm::vect_sp(x, n);
scalar_type nxt = sqrt(gmm::abs(gmm::vect_norm2_sqr(x) - xn*xn));
if (xn > scalar_type(0) && f * nxt <= xn) {
gmm::clear(g);
} else if (xn > scalar_type(0) || nxt > -f*xn) {
static base_small_vector xt;
gmm::resize(xt, N);
gmm::add(x, gmm::scaled(n, -xn), xt);
gmm::scale(xt, scalar_type(1)/nxt);
if (N > 2) {
gmm::copy(gmm::identity_matrix(), g);
gmm::rank_one_update(g, gmm::scaled(n, -scalar_type(1)), n);
gmm::rank_one_update(g, gmm::scaled(xt, -scalar_type(1)), xt);
gmm::scale(g, f*(f - xn/nxt));
} else {
gmm::clear(g);
}
gmm::scale(xt, -f); gmm::add(n, xt);
gmm::rank_one_update(g, xt, xt);
gmm::scale(g, scalar_type(1) / (f*f+scalar_type(1)));
} else {
gmm::copy(gmm::identity_matrix(), g);
}
}
template<typename VEC, typename MAT>
static void De_Saxce_projection_gradn(const VEC &x, const VEC &n_,
scalar_type f, MAT &g) {
static base_small_vector n;
size_type N = gmm::vect_size(x);
scalar_type nn = gmm::vect_norm2(n_);
gmm::resize(n, N);
gmm::copy(gmm::scaled(n_, scalar_type(1)/nn), n);
scalar_type xn = gmm::vect_sp(x, n);
scalar_type nxt = sqrt(gmm::abs(gmm::vect_norm2_sqr(x) - xn*xn));
gmm::clear(g);
if (!(xn > scalar_type(0) && f * nxt <= xn)
&& (xn > scalar_type(0) || nxt > -f*xn)) {
static base_small_vector xt, aux;
gmm::resize(xt, N); gmm::resize(aux, N);
gmm::add(x, gmm::scaled(n, -xn), xt);
gmm::scale(xt, scalar_type(1)/nxt);
scalar_type c = (scalar_type(1) + f*xn/nxt)/nn;
for (size_type i = 0; i < N; ++i) g(i,i) = c;
gmm::rank_one_update(g, gmm::scaled(n, -c), n);
gmm::rank_one_update(g, gmm::scaled(n, f/nn), xt);
gmm::rank_one_update(g, gmm::scaled(xt, -f*xn/(nn*nxt)), xt);
gmm::scale(g, xn - f*nxt);
gmm::add(gmm::scaled(xt, -f), n, aux);
gmm::rank_one_update(g, aux, gmm::scaled(xt, (nxt+f*xn)/nn));
gmm::scale(g, scalar_type(1) / (f*f+scalar_type(1)));
}
}
//=========================================================================
//
// Some basic assembly functions.
//
//=========================================================================
template <typename MAT1, typename MAT2>
void mat_elem_assembly(const MAT1 &M_, const MAT2 &Melem,
const mesh_fem &mf1, size_type cv1,
const mesh_fem &mf2, size_type cv2) {
MAT1 &M = const_cast<MAT1 &>(M_);
typedef typename gmm::linalg_traits<MAT1>::value_type T;
T val;
mesh_fem::ind_dof_ct cvdof1 = mf1.ind_basic_dof_of_element(cv1);
mesh_fem::ind_dof_ct cvdof2 = mf2.ind_basic_dof_of_element(cv2);
GMM_ASSERT1(cvdof1.size() == gmm::mat_nrows(Melem)
&& cvdof2.size() == gmm::mat_ncols(Melem),
"Dimensions mismatch");
if (mf1.is_reduced()) {
if (mf2.is_reduced()) {
for (size_type i = 0; i < cvdof1.size(); ++i)
for (size_type j = 0; j < cvdof2.size(); ++j)
if ((val = Melem(i,j)) != T(0))
asmrankoneupdate
(M, gmm::mat_row(mf1.extension_matrix(), cvdof1[i]),
gmm::mat_row(mf2.extension_matrix(), cvdof2[j]), val);
} else {
for (size_type i = 0; i < cvdof1.size(); ++i)
for (size_type j = 0; j < cvdof2.size(); ++j)
if ((val = Melem(i,j)) != T(0))
asmrankoneupdate
(M, gmm::mat_row(mf1.extension_matrix(), cvdof1[i]),
cvdof2[j], val);
}
} else {
if (mf2.is_reduced()) {
for (size_type i = 0; i < cvdof1.size(); ++i)
for (size_type j = 0; j < cvdof2.size(); ++j)
if ((val = Melem(i,j)) != T(0))
asmrankoneupdate
(M, cvdof1[i],
gmm::mat_row(mf2.extension_matrix(), cvdof2[j]), val);
} else {
for (size_type i = 0; i < cvdof1.size(); ++i)
for (size_type j = 0; j < cvdof2.size(); ++j)
if ((val = Melem(i,j)) != T(0))
M(cvdof1[i], cvdof2[j]) += val;
}
}
}
template <typename VEC1, typename VEC2>
void vec_elem_assembly(const VEC1 &V_, const VEC2 &Velem,
const mesh_fem &mf, size_type cv) {
VEC1 &V = const_cast<VEC1 &>(V_);
typedef typename gmm::linalg_traits<VEC1>::value_type T;
std::vector<size_type> cvdof(mf.ind_basic_dof_of_element(cv).begin(),
mf.ind_basic_dof_of_element(cv).end());
GMM_ASSERT1(cvdof.size() == gmm::vect_size(Velem), "Dimensions mismatch");
if (mf.is_reduced()) {
T val;
for (size_type i = 0; i < cvdof.size(); ++i)
if ((val = Velem[i]) != T(0))
gmm::add(gmm::scaled(gmm::mat_row(mf.extension_matrix(), cvdof[i]),
val), V);
} else {
for (size_type i = 0; i < cvdof.size(); ++i) V[cvdof[i]] += Velem[i];
}
}
template <typename MAT1, typename MAT2>
void mat_elem_assembly(const MAT1 &M_, const gmm::sub_interval &I1,
const gmm::sub_interval &I2,
const MAT2 &Melem,
const mesh_fem &mf1, size_type cv1,
const mesh_fem &mf2, size_type cv2) {
MAT1 &M = const_cast<MAT1 &>(M_);
typedef typename gmm::linalg_traits<MAT1>::value_type T;
T val;
mesh_fem::ind_dof_ct cvdof1 = mf1.ind_basic_dof_of_element(cv1);
mesh_fem::ind_dof_ct cvdof2 = mf2.ind_basic_dof_of_element(cv2);
GMM_ASSERT1(cvdof1.size() == gmm::mat_nrows(Melem)
&& cvdof2.size() == gmm::mat_ncols(Melem),
"Dimensions mismatch");
if (mf1.is_reduced()) {
if (mf2.is_reduced()) {
for (size_type i = 0; i < cvdof1.size(); ++i)
for (size_type j = 0; j < cvdof2.size(); ++j)
if ((val = Melem(i,j)) != T(0))
asmrankoneupdate
(gmm::sub_matrix(M, I1, I2),
gmm::mat_row(mf1.extension_matrix(), cvdof1[i]),
gmm::mat_row(mf2.extension_matrix(), cvdof2[j]), val);
} else {
for (size_type i = 0; i < cvdof1.size(); ++i)
for (size_type j = 0; j < cvdof2.size(); ++j)
if ((val = Melem(i,j)) != T(0))
asmrankoneupdate
(gmm::sub_matrix(M, I1, I2),
gmm::mat_row(mf1.extension_matrix(), cvdof1[i]),
cvdof2[j], val);
}
} else {
if (mf2.is_reduced()) {
for (size_type i = 0; i < cvdof1.size(); ++i)
for (size_type j = 0; j < cvdof2.size(); ++j)
if ((val = Melem(i,j)) != T(0))
asmrankoneupdate
(gmm::sub_matrix(M, I1, I2), cvdof1[i],
gmm::mat_row(mf2.extension_matrix(), cvdof2[j]), val);
} else {
for (size_type i = 0; i < cvdof1.size(); ++i)
for (size_type j = 0; j < cvdof2.size(); ++j)
if ((val = Melem(i,j)) != T(0))
M(cvdof1[i]+I1.first(), cvdof2[j]+I2.first()) += val;
}
}
}
template <typename VEC1, typename VEC2>
void vec_elem_assembly(const VEC1 &V_, const gmm::sub_interval &I,
const VEC2 &Velem, const mesh_fem &mf, size_type cv) {
VEC1 &V = const_cast<VEC1 &>(V_);
typedef typename gmm::linalg_traits<VEC1>::value_type T;
std::vector<size_type> cvdof(mf.ind_basic_dof_of_element(cv).begin(),
mf.ind_basic_dof_of_element(cv).end());
GMM_ASSERT1(cvdof.size() == gmm::vect_size(Velem), "Dimensions mismatch");
if (mf.is_reduced()) {
T val;
for (size_type i = 0; i < cvdof.size(); ++i)
if ((val = Velem[i]) != T(0))
gmm::add(gmm::scaled(gmm::mat_row(mf.extension_matrix(), cvdof[i]),
val), gmm::sub_vector(V, I));
} else {
for (size_type i = 0; i < cvdof.size(); ++i)
V[I.first()+cvdof[i]] += Velem[i];
}
}
void vectorize_base_tensor(const base_tensor &t, base_matrix &vt,
size_type ndof, size_type qdim, size_type N);
void vectorize_grad_base_tensor(const base_tensor &t, base_tensor &vt,
size_type ndof, size_type qdim, size_type N);
//=========================================================================
//
// Structure which stores the contact boundaries, rigid obstacles and
// computes the contact pairs in large sliding/large deformation
//
//=========================================================================
class multi_contact_frame {
// Structure describing a contact boundary
struct contact_boundary {
size_type region; // Boundary number
const getfem::mesh_fem *mfu; // F.e.m. for the displacement.
const getfem::mesh_fem *mflambda; // F.e.m. for the displacement.
const getfem::mesh_im *mim; // Integration method for the boundary.
std::string multname; // Name of the optional contact stress
// multiplier when linked to a model.
size_type ind_U; // Index of displacement.
size_type ind_lambda; // Index of multiplier (if any).
bool slave;
contact_boundary(void) {}
contact_boundary(size_type r, const mesh_fem *mf,
const mesh_im &mi, size_type i_U, const mesh_fem *mfl,
size_type i_l = size_type(-1))
: region(r), mfu(mf), mflambda(mfl), mim(&mi),
ind_U(i_U), ind_lambda(i_l), slave(false) {}
};
size_type N; // Meshes dimensions
bool self_contact; // Self-contact is searched or not.
bool ref_conf; // Contact in reference configuration
// for linear elasticity small sliding contact.
bool use_delaunay; // Use delaunay to detect the contact pairs instead
// of influence boxes.
int nodes_mode; // 0 = Use Gauss points for both slave and master
// 1 = Use finite element nodes for slave and
// Gauss points for master.
// 2 = Use finite element nodes for both slave
// and master
bool raytrace; // Use raytrace instead of projection.
scalar_type release_distance; // Limit distance beyond which the contact
// will not be considered. CAUTION: should be comparable to the element
// size (if it is too large, a too large set of influence boxes will be
// detected and the computation will be slow, except for delaunay option)
scalar_type cut_angle; // Cut angle (in radian) for normal cones
scalar_type EPS; // Should be typically hmin/1000 (for computing
// gradients with finite differences
const model *md; // The model if the structure is linked to a model.
typedef model_real_plain_vector VECTOR;
std::vector<const VECTOR *> Us; // Displacement vectors
std::vector<const VECTOR *> Ws; // "Velocity" vectors
std::vector<std::string> Unames; // Displacement vectors names.
std::vector<std::string> Wnames; // "Velocity" vectors names.
std::vector<VECTOR> ext_Us; // Unreduced displacement vectors
std::vector<VECTOR> ext_Ws; // Unreduced "velocity" vectors
std::vector<const VECTOR *> lambdas; // Displacement vectors
std::vector<std::string> lambdanames; // Displacement vectors names.
std::vector<VECTOR> ext_lambdas; // Unreduced displacement vectors
std::vector<contact_boundary> contact_boundaries;
std::vector<std::string> coordinates;
base_node pt_eval;
#if GETFEM_HAVE_MUPARSER_MUPARSER_H || GETFEM_HAVE_MUPARSER_H
std::vector<mu::Parser> obstacles_parsers;
#endif
std::vector<std::string> obstacles;
std::vector<std::string> obstacles_velocities;
struct normal_cone : public std::vector<base_small_vector> {
void add_normal(const base_small_vector &n)
{ std::vector<base_small_vector>::push_back(n);}
normal_cone(void) {}
normal_cone(const base_small_vector &n)
: std::vector<base_small_vector>(1, n) { }
};
//
// Influence boxes
//
struct influence_box { // Additional information for an influence box
size_type ind_boundary; // Boundary number
size_type ind_element; // Element number
short_type ind_face; // Face number in element
base_small_vector mean_normal; // Mean outward normal unit vector
influence_box(void) {}
influence_box(size_type ib, size_type ie,
short_type iff, const base_small_vector &n)
: ind_boundary(ib), ind_element(ie), ind_face(iff), mean_normal(n) {}
};
bgeot::rtree element_boxes; // influence boxes
std::vector<influence_box> element_boxes_info;
//
// Stored points (for Delaunay and slave nodal boundaries)
//
struct boundary_point { // Additional information for a boundary point
base_node ref_point; // Point coordinate in reference configuration
size_type ind_boundary; // Boundary number
size_type ind_element; // Element number
short_type ind_face; // Face number in element
size_type ind_pt; // Dof number for fem nodes or point number
// of integration method (depending on nodes_mode)
normal_cone normals; // Set of outward unit normal vectors
boundary_point(void) {}
boundary_point(const base_node &rp, size_type ib, size_type ie,
short_type iff, size_type id, const base_small_vector &n)
: ref_point(rp), ind_boundary(ib), ind_element(ie), ind_face(iff),
ind_pt(id), normals(n) {}
};
std::vector<base_node> boundary_points;
std::vector<boundary_point> boundary_points_info;
size_type add_U(const model_real_plain_vector *U, const std::string &name,
const model_real_plain_vector *w, const std::string &wname);
size_type add_lambda(const model_real_plain_vector *lambda,
const std::string &name);
void extend_vectors(void);
void normal_cone_simplicication(void);
bool test_normal_cones_compatibility(const normal_cone &nc1,
const normal_cone &nc2);
bool test_normal_cones_compatibility(const base_small_vector &n,
const normal_cone &nc2);
dal::bit_vector aux_dof_cv; // An auxiliary variable for are_dof_linked
// function (in order to be of constant complexity).
bool are_dof_linked(size_type ib1, size_type idof1,
size_type ib2, size_type idof2);
bool is_dof_linked(size_type ib1, size_type idof1,
size_type ib2, size_type cv);
public:
struct face_info {
size_type ind_boundary;
size_type ind_element;
short_type ind_face;
face_info(void) {}
face_info(size_type ib, size_type ie, short_type iff)
: ind_boundary(ib), ind_element(ie), ind_face(iff) {}
};
protected:
std::vector<std::vector<face_info> > potential_pairs;
void add_potential_contact_face(size_type ip, size_type ib, size_type ie,
short_type iff);
public:
// stored information for contact pair
struct contact_pair {
base_node slave_point; // The transformed slave point
base_small_vector slave_n; // Normal unit vector to slave surface
size_type slave_ind_boundary; // Boundary number
size_type slave_ind_element; // Element number
short_type slave_ind_face; // Face number in element
size_type slave_ind_pt; // Dof number for fem nodes or point number
// of integration method (depending on nodes_mode)
base_node master_point_ref; // The master point on ref element
base_node master_point; // The transformed master point
base_small_vector master_n; // Normal unit vector to master surface
size_type master_ind_boundary; // Boundary number
size_type master_ind_element; // Element number
short_type master_ind_face; // Face number in element
scalar_type signed_dist;
size_type irigid_obstacle;
contact_pair(void) {}
contact_pair(const base_node &spt, const base_small_vector &nx,
const boundary_point &bp,
const base_node &mptr, const base_node &mpt,
const base_small_vector &ny,
const face_info &mfi, scalar_type sd)
: slave_point(spt), slave_n(nx),
slave_ind_boundary(bp.ind_boundary), slave_ind_element(bp.ind_element),
slave_ind_face(bp.ind_face), slave_ind_pt(bp.ind_pt),
master_point_ref(mptr), master_point(mpt), master_n(ny),
master_ind_boundary(mfi.ind_boundary), master_ind_element(mfi.ind_element),
master_ind_face(mfi.ind_face),
signed_dist(sd), irigid_obstacle(size_type(-1)) {}
contact_pair(const base_node &spt, const base_small_vector &nx,
const boundary_point &bp,
const base_node &mpt, const base_small_vector &ny,
size_type ir, scalar_type sd)
: slave_point(spt), slave_n(nx), slave_ind_boundary(bp.ind_boundary),
slave_ind_element(bp.ind_element), slave_ind_face(bp.ind_face),
slave_ind_pt(bp.ind_pt), master_point(mpt), master_n(ny),
signed_dist(sd),
irigid_obstacle(ir) {}
};
// Compute the influence boxes of master boundary elements. To be run
// before the detection of contact pairs. The influence box is the
// bounding box extended by a distance equal to the release distance.
void compute_influence_boxes(void);
// For delaunay triangulation. Advantages compared to influence boxes:
// No degeneration of the algorithm complexity with refinement and
// more easy to extend to fictitious domain with contact.
// Stores all the boundary deformed points relatively to
// an integration method or to finite element nodes (depending on
// nodes_mode). Storing sufficient information to perform
// a Delaunay triangulation and to be able to recover the boundary
// number, element number, face number, unit normal vector ...
void compute_boundary_points(bool slave_only = false);
void compute_potential_contact_pairs_delaunay(void);
void compute_potential_contact_pairs_influence_boxes(void);
protected:
std::vector<contact_pair> contact_pairs;
void clear_aux_info(void); // Delete auxiliary information
public:
size_type dim(void) const { return N; }
const std::vector<contact_pair> &ct_pairs(void) const
{ return contact_pairs; }
const getfem::mesh_fem &mfdisp_of_boundary(size_type n) const
{ return *(contact_boundaries[n].mfu); }
const getfem::mesh_fem &mfmult_of_boundary(size_type n) const
{ return *(contact_boundaries[n].mflambda); }
const getfem::mesh_im &mim_of_boundary(size_type n) const
{ return *(contact_boundaries[n].mim); }
size_type nb_variables(void) const { return Us.size(); }
size_type nb_multipliers(void) const { return lambdas.size(); }
const std::string &varname(size_type i) const { return Unames[i]; }
const std::string &multname(size_type i) const { return lambdanames[i]; }
const model_real_plain_vector &disp_of_boundary(size_type n) const
{ return ext_Us[contact_boundaries[n].ind_U]; }
const model_real_plain_vector &w_of_boundary(size_type n) const
{ return ext_Ws[contact_boundaries[n].ind_U]; }
const model_real_plain_vector &mult_of_boundary(size_type n) const
{ return ext_lambdas[contact_boundaries[n].ind_lambda]; }
size_type region_of_boundary(size_type n) const
{ return contact_boundaries[n].region; }
const std::string &varname_of_boundary(size_type n) const
{ return Unames[contact_boundaries[n].ind_U]; }
size_type ind_varname_of_boundary(size_type n) const
{ return contact_boundaries[n].ind_U; }
const std::string &multname_of_boundary(size_type n) const {
static const std::string vname;
size_type ind = contact_boundaries[n].ind_lambda;
return (ind == size_type(-1)) ? vname : lambdanames[ind];
}
size_type ind_multname_of_boundary(size_type n) const
{ return contact_boundaries[n].ind_lambda; }
size_type nb_boundaries(void) const { return contact_boundaries.size(); }
bool is_self_contact(void) const { return self_contact; }
bool is_slave_boundary(size_type n) const { return contact_boundaries[n].slave; }
void set_raytrace(bool b) { raytrace = b; }
void set_nodes_mode(int m) { nodes_mode = m; }
size_type nb_contact_pairs(void) const { return contact_pairs.size(); }
const contact_pair &get_contact_pair(size_type i)
{ return contact_pairs[i]; }
multi_contact_frame(size_type NN, scalar_type r_dist,
bool dela = true, bool selfc = true,
scalar_type cut_a = 0.3, bool rayt = false,
int fem_nodes = 0, bool refc = false);
multi_contact_frame(const model &md, size_type NN, scalar_type r_dist,
bool dela = true, bool selfc = true,
scalar_type cut_a = 0.3, bool rayt = false,
int fem_nodes = 0, bool refc = false);
size_type add_obstacle(const std::string &obs);
size_type add_slave_boundary(const getfem::mesh_im &mim,
const getfem::mesh_fem *mfu,
const model_real_plain_vector *U,
size_type reg,
const getfem::mesh_fem *mflambda = 0,
const model_real_plain_vector *lambda = 0,
const model_real_plain_vector *w = 0,
const std::string &varname = std::string(),
const std::string &multname = std::string(),
const std::string &wname = std::string());
size_type add_slave_boundary(const getfem::mesh_im &mim, size_type reg,
const std::string &varname,
const std::string &multname = std::string(),
const std::string &wname = std::string());
size_type add_master_boundary(const getfem::mesh_im &mim,
const getfem::mesh_fem *mfu,
const model_real_plain_vector *U,
size_type reg,
const getfem::mesh_fem *mflambda = 0,
const model_real_plain_vector *lambda = 0,
const model_real_plain_vector *w = 0,
const std::string &varname = std::string(),
const std::string &multname = std::string(),
const std::string &wname = std::string());
size_type add_master_boundary(const getfem::mesh_im &mim, size_type reg,
const std::string &varname,
const std::string &multname = std::string(),
const std::string &wname = std::string());
// The whole process of the computation of contact pairs
// Contact pairs are seached for a certain boundary (master or slave,
// depending on the contact algorithm) on the master ones. If contact pairs
// are searched for a master boundary, self-contact is taken into account
// if the flag 'self_contact' is set to 'true'. Self-contact is never taken
// into account for a slave boundary.
void compute_contact_pairs(void);
};
} /* end of namespace getfem. */
#endif /* GETFEM_CONTACT_AND_FRICTION_COMMON_H__ */
|