EFAEdge Class Reference

#include <EFAEdge.h>

Public Member Functions
	EFAEdge (EFANode *node1, EFANode *node2)
	EFAEdge (const EFAEdge &other_edge)
	~EFAEdge ()
std::pair< EFANode *, EFANode * >	getSortedNodes () const
bool	equivalent (const EFAEdge &other) const
bool	isEmbeddedPermanent () const
bool	isPartialOverlap (const EFAEdge &other) const
bool	containsEdge (const EFAEdge &other) const
bool	getNodeMasters (EFANode *node, std::vector< EFANode * > &master_nodes, std::vector< double > &master_weights) const
void	addIntersection (double position, EFANode *embedded_node_tmp, EFANode *from_node)
void	resetIntersection (double position, EFANode *embedded_node_tmp, EFANode *from_node)
void	copyIntersection (const EFAEdge &other, unsigned int from_node_id)
EFANode *	getNode (unsigned int index) const
EFANode *	getInteriorNode () const
void	setInteriorNode (EFANode *node)
void	reverseNodes ()
bool	hasIntersection () const
bool	hasIntersectionAtPosition (double position, EFANode *from_node) const
double	getIntersection (unsigned int emb_id, EFANode *from_node) const
double	distanceFromNode1 (EFANode *node) const
bool	isEmbeddedNode (const EFANode *node) const
unsigned int	getEmbeddedNodeIndex (EFANode *node) const
unsigned int	getEmbeddedNodeIndex (double position, EFANode *from_node) const
EFANode *	getEmbeddedNode (unsigned int index) const
unsigned int	numEmbeddedNodes () const
void	consistencyCheck ()
void	switchNode (EFANode *new_node, EFANode *old_node)
bool	containsNode (const EFANode *node) const
void	removeEmbeddedNodes ()
void	removeEmbeddedNode (EFANode *node)

Private Attributes
EFANode *	_edge_node1
EFANode *	_edge_node2
EFANode *	_edge_interior_node
std::vector< EFANode * >	_embedded_nodes
std::vector< double >	_intersection_x

Detailed Description

Definition at line 16 of file EFAEdge.h.

Constructor & Destructor Documentation

EFAEdge() [1/2]

EFAEdge::EFAEdge	(	EFANode *	node1,
		EFANode *	node2
	)

Definition at line 16 of file EFAEdge.C.

                                                 : _edge_node1(node1), _edge_node2(node2)
{
  _embedded_nodes.clear();
  _intersection_x.clear();
  _edge_interior_node = nullptr;
  consistencyCheck();
}

EFAEdge() [2/2]

EFAEdge::EFAEdge

(

const EFAEdge &

other_edge

)

Definition at line 24 of file EFAEdge.C.

{
  _edge_node1 = other_edge._edge_node1;
  _edge_node2 = other_edge._edge_node2;
  _intersection_x = other_edge._intersection_x;
  _embedded_nodes = other_edge._embedded_nodes;
  consistencyCheck();
}

~EFAEdge()

EFAEdge::~EFAEdge

(

)

Definition at line 33 of file EFAEdge.C.

{                   // in EFAelement's destructor
}

Member Function Documentation

addIntersection()

void EFAEdge::addIntersection	(	double	position,
		EFANode *	embedded_node_tmp,
		EFANode *	from_node
	)

Definition at line 132 of file EFAEdge.C.

{
  _embedded_nodes.push_back(embedded_node_tmp);
  if (from_node == _edge_node1)
    _intersection_x.push_back(position);
  else if (from_node == _edge_node2)
    _intersection_x.push_back(1.0 - position);
  else
    EFAError("In addIntersection from_node does not exist on edge");
}

Referenced by EFAElement2D::addEdgeCut(), EFAElement3D::addFaceEdgeCut(), EFAElement2D::addFragmentEdgeCut(), EFAFragment2D::combineTipEdges(), EFAFace::combineTwoEdges(), and EFAFace::combineWithFace().

consistencyCheck()

void EFAEdge::consistencyCheck

(

)

Definition at line 347 of file EFAEdge.C.

{
  bool consistent = true;
  if ((_edge_node1->category() == EFANode::N_CATEGORY_PERMANENT ||
       _edge_node1->category() == EFANode::N_CATEGORY_TEMP) &&
      _edge_node2->category() == EFANode::N_CATEGORY_LOCAL_INDEX)
    consistent = false;
  else if ((_edge_node2->category() == EFANode::N_CATEGORY_PERMANENT ||
            _edge_node2->category() == EFANode::N_CATEGORY_TEMP) &&
           _edge_node1->category() == EFANode::N_CATEGORY_LOCAL_INDEX)
    consistent = false;
  if (!consistent)
    EFAError("In consistencyCheck nodes on edge are not consistent");
  if (_embedded_nodes.size() != _intersection_x.size())
    EFAError("In consistencyCheck num of emb_nodes must be = num of inters_x");
}

Referenced by EFAEdge(), and EFAEdge().

containsEdge()

bool EFAEdge::containsEdge

(

const EFAEdge &

other

)

const

Definition at line 65 of file EFAEdge.C.

{
  return containsNode(other._edge_node1) && containsNode(other._edge_node2);
}

Referenced by EFAFragment2D::combineTipEdges(), EFAElement3D::getFragmentFaceEdgeID(), EFAFragment2D::isEdgeInterior(), and isPartialOverlap().

containsNode()

bool EFAEdge::containsNode

(

const EFANode *

node

)

const

Definition at line 379 of file EFAEdge.C.

{
  return _edge_node1 == node || _edge_node2 == node || isEmbeddedNode(node);
}

Referenced by containsEdge(), EFAFace::EFAFace(), and EFAElement2D::printElement().

copyIntersection()

void EFAEdge::copyIntersection	(	const EFAEdge &	other,
		unsigned int	from_node_id
	)

Definition at line 162 of file EFAEdge.C.

{
  _embedded_nodes.clear();
  _intersection_x.clear();
  _embedded_nodes = other._embedded_nodes;
  if (from_node_id == 0)
    _intersection_x = other._intersection_x;
  else if (from_node_id == 1)
  {
    for (unsigned int i = 0; i < other.numEmbeddedNodes(); ++i)
      _intersection_x.push_back(1.0 - other._intersection_x[i]);
  }
  else
    EFAError("from_node_id out of bounds");
  if (_embedded_nodes.size() != _intersection_x.size())
    EFAError("in copyIntersection num emb_nodes must == num of inters_x");
}

distanceFromNode1()

double EFAEdge::distanceFromNode1

(

EFANode *

node

)

const

Definition at line 250 of file EFAEdge.C.

{
  double xi = -100.0;
  if (_edge_node1 == node)
    xi = 0.0;
  else if (_edge_node2 == node)
    xi = 1.0;
  else if (isEmbeddedNode(node))
  {
    unsigned int embedded_node_id = getEmbeddedNodeIndex(node);
    xi = _intersection_x[embedded_node_id];
  }
  else
    EFAError("the given node is not found in the current edge");
  return xi;
}

Referenced by EFAElement3D::addFaceEdgeCut(), EFAFragment2D::combineTipEdges(), and EFAElement3D::isPhysicalEdgeCut().

equivalent()

bool EFAEdge::equivalent

(

const EFAEdge &

other

)

const

Definition at line 38 of file EFAEdge.C.

{
  if (getSortedNodes() == other.getSortedNodes())
  {
    // For cut along the edge case
    if (isEmbeddedPermanent())
      return false;
    return true;
  }
 
  return false;
}

Referenced by EFAElement3D::getNeighborEdgeIndex(), and EFAElement2D::shouldDuplicateForPhantomCorner().

getEmbeddedNode()

EFANode * EFAEdge::getEmbeddedNode

(

unsigned int

index

)

const

Definition at line 332 of file EFAEdge.C.

{
  if (index < _embedded_nodes.size())
    return _embedded_nodes[index];
  else
    EFAError("in getEmbeddedNode index out of bounds");
}

Referenced by EFAElement3D::addFaceEdgeCut(), EFAElement3D::checkNeighborFaceCut(), and XFEM::markCutEdgesByState().

getEmbeddedNodeIndex() [1/2]

unsigned int EFAEdge::getEmbeddedNodeIndex	(	double	position,
		EFANode *	from_node
	)		const

Definition at line 302 of file EFAEdge.C.

{
  bool have_index = false;
  unsigned int index;
  if (hasIntersection())
  {
    double tmp_intersection_x = -1.0; // dist from edge_node1
    if (from_node == _edge_node1)
      tmp_intersection_x = position;
    else if (from_node == _edge_node2)
      tmp_intersection_x = 1.0 - position;
    else
      EFAError("In getEmbeddedNodeIndex, from_node does not exist on edge");
 
    for (unsigned int i = 0; i < _embedded_nodes.size(); ++i)
    {
      if (std::abs(tmp_intersection_x - _intersection_x[i]) < Xfem::tol)
      {
        have_index = true;
        index = i;
        break;
      }
    }
  }
  if (!have_index)
    EFAError("In getEmbeddedNodeIndex, could not find index");
  return index;
}

getEmbeddedNodeIndex() [2/2]

unsigned int EFAEdge::getEmbeddedNodeIndex

(

EFANode *

node

)

const

Definition at line 283 of file EFAEdge.C.

{
  unsigned int index;
  bool have_index = false;
  for (unsigned int i = 0; i < _embedded_nodes.size(); ++i)
  {
    if (_embedded_nodes[i] == node)
    {
      have_index = true;
      index = i;
      break;
    }
  }
  if (!have_index)
    EFAError("In getEmbeddedNodeIndex, could not find index");
  return index;
}

Referenced by EFAElement3D::addFaceEdgeCut(), EFAElement3D::checkNeighborFaceCut(), distanceFromNode1(), and switchNode().

getInteriorNode()

EFANode * EFAEdge::getInteriorNode ( ) const

inline

Definition at line 51 of file EFAEdge.h.

{ return _edge_interior_node; };

Referenced by EFAElement2D::connectNeighbors().

getIntersection()

double EFAEdge::getIntersection	(	unsigned int	emb_id,
		EFANode *	from_node
	)		const

Definition at line 239 of file EFAEdge.C.

{
  if (from_node == _edge_node1)
    return _intersection_x[emb_id];
  else if (from_node == _edge_node2)
    return 1.0 - _intersection_x[emb_id];
  else
    EFAError("In getIntersection node not in edge");
}

Referenced by EFAElement2D::addFragmentEdgeCut().

getNode()

EFANode * EFAEdge::getNode

(

unsigned int

index

)

const

Definition at line 181 of file EFAEdge.C.

{
  if (index == 0)
    return _edge_node1;
  else if (index == 1)
    return _edge_node2;
  else
    EFAError("In getNode index out of bounds");
}

Referenced by EFAElement2D::addEdgeCut(), EFAElement3D::addFaceEdgeCut(), EFAElement2D::addFragmentEdgeCut(), EFAFace::combineWithFace(), XFEMCutElem2D::computePhysicalFaceAreaFraction(), XFEMCutElem2D::computePhysicalVolumeFraction(), EFAElement2D::connectNeighbors(), XFEM::correctCrackExtensionDirection(), EFAFace::EFAFace(), XFEMCutElem2D::getCrackTipOriginAndDirection(), XFEMCutElem2D::getCutPlaneNormal(), XFEMCutElem2D::getCutPlaneOrigin(), XFEM::getFragmentEdges(), XFEMCutElem2D::getFragmentFaces(), XFEMCutElem2D::getIntersectionInfo(), XFEMCutElem2D::getPhysicalQuadraturePoints(), EFAElement3D::isPhysicalEdgeCut(), XFEM::markCutEdgesByState(), EFAElement2D::printElement(), and EFAFace::sortEdges().

getNodeMasters()

bool EFAEdge::getNodeMasters	(	EFANode *	node,
		std::vector< EFANode * > &	master_nodes,
		std::vector< double > &	master_weights
	)		const

Definition at line 71 of file EFAEdge.C.

{
  master_nodes.clear();
  master_weights.clear();
  bool masters_found = false;
  if (_edge_node1 == node || _edge_node2 == node)
  {
    master_nodes.push_back(node);
    master_weights.push_back(1.0);
    masters_found = true;
  }
  else
  {
    for (unsigned int i = 0; i < _embedded_nodes.size(); ++i)
    {
      if (_embedded_nodes[i] == node)
      {
        master_nodes.push_back(_edge_node1);
        master_nodes.push_back(_edge_node2);
        master_weights.push_back(1.0 - _intersection_x[i]);
        master_weights.push_back(_intersection_x[i]);
        masters_found = true;
        break;
      }
    }
  }
  return masters_found;
}

getSortedNodes()

std::pair< EFANode *, EFANode * > EFAEdge::getSortedNodes ( ) const

inline

Definition at line 32 of file EFAEdge.h.

  {
    return {std::min(_edge_node1, _edge_node2), std::max(_edge_node1, _edge_node2)};
  }

Referenced by equivalent().

hasIntersection()

bool EFAEdge::hasIntersection

(

)

const

Definition at line 200 of file EFAEdge.C.

{
  bool has = false;
  if (_edge_node1->parent() != nullptr)
    has = has || _edge_node1->parent()->category() == EFANode::N_CATEGORY_EMBEDDED_PERMANENT;
 
  if (_edge_node2->parent() != nullptr)
    has = has || _edge_node2->parent()->category() == EFANode::N_CATEGORY_EMBEDDED_PERMANENT;
 
  return has || _embedded_nodes.size() > 0;
}

Referenced by EFAElement3D::addFaceEdgeCut(), EFAElement2D::addFragmentEdgeCut(), EFAFragment2D::combineTipEdges(), EFAElement2D::connectNeighbors(), EFAElement2D::fragmentEdgeAlreadyCut(), getEmbeddedNodeIndex(), hasIntersectionAtPosition(), and XFEM::markCutEdgesByState().

hasIntersectionAtPosition()

bool EFAEdge::hasIntersectionAtPosition	(	double	position,
		EFANode *	from_node
	)		const

Definition at line 213 of file EFAEdge.C.

{
  bool has_int = false;
  if (hasIntersection())
  {
    double tmp_intersection_x = -1.0;
    if (from_node == _edge_node1)
      tmp_intersection_x = position;
    else if (from_node == _edge_node2)
      tmp_intersection_x = 1.0 - position;
    else
      EFAError("In hasIntersectionAtPosition from_node does not exist on edge");
 
    for (unsigned int i = 0; i < _embedded_nodes.size(); ++i)
    {
      if (std::abs(tmp_intersection_x - _intersection_x[i]) < Xfem::tol)
      {
        has_int = true;
        break;
      }
    }
  }
  return has_int;
}

Referenced by EFAElement3D::addFaceEdgeCut(), EFAElement2D::addFragmentEdgeCut(), and EFAElement3D::checkNeighborFaceCut().

isEmbeddedNode()

bool EFAEdge::isEmbeddedNode

(

const EFANode *

node

)

const

Definition at line 268 of file EFAEdge.C.

{
  bool is_emb = false;
  for (unsigned int i = 0; i < _embedded_nodes.size(); ++i)
  {
    if (_embedded_nodes[i] == node)
    {
      is_emb = true;
      break;
    }
  }
  return is_emb;
}

Referenced by containsNode(), distanceFromNode1(), and switchNode().

isEmbeddedPermanent()

bool EFAEdge::isEmbeddedPermanent

(

)

const

Definition at line 52 of file EFAEdge.C.

{
  return _edge_node1->category() == EFANode::N_CATEGORY_EMBEDDED_PERMANENT &&
         _edge_node2->category() == EFANode::N_CATEGORY_EMBEDDED_PERMANENT;
}

Referenced by equivalent().

isPartialOverlap()

bool EFAEdge::isPartialOverlap

(

const EFAEdge &

other

)

const

Definition at line 59 of file EFAEdge.C.

{
  return containsEdge(other) || other.containsEdge(*this);
}

Referenced by XFEM::correctCrackExtensionDirection(), and XFEM::markCutEdgesByState().

numEmbeddedNodes()

unsigned int EFAEdge::numEmbeddedNodes

(

)

const

Definition at line 341 of file EFAEdge.C.

{
  return _embedded_nodes.size();
}

Referenced by EFAElement2D::addEdgeCut(), EFAElement3D::addFaceEdgeCut(), and copyIntersection().

removeEmbeddedNode()

void EFAEdge::removeEmbeddedNode

(

EFANode *

node

)

Definition at line 392 of file EFAEdge.C.

{
  unsigned int index = 0;
  bool node_found = false;
  for (unsigned int i = 0; i < _embedded_nodes.size(); ++i)
  {
    if (_embedded_nodes[i] == node)
    {
      index = i;
      node_found = true;
      break;
    }
  }
  if (node_found)
  {
    _embedded_nodes.erase(_embedded_nodes.begin() + index);
    _intersection_x.erase(_intersection_x.begin() + index);
  }
}

removeEmbeddedNodes()

void EFAEdge::removeEmbeddedNodes

(

)

Definition at line 385 of file EFAEdge.C.

{
  _embedded_nodes.clear();
  _intersection_x.clear();
}

resetIntersection()

void EFAEdge::resetIntersection	(	double	position,
		EFANode *	embedded_node_tmp,
		EFANode *	from_node
	)

Definition at line 144 of file EFAEdge.C.

{
  for (unsigned int i = 0; i < _embedded_nodes.size(); ++i)
  {
    if (_embedded_nodes[i] == embedded_node_tmp)
    {
      if (from_node == _edge_node1)
        _intersection_x[i] = position;
      else if (from_node == _edge_node2)
        _intersection_x[i] = 1.0 - position;
      else
        EFAError("In resetIntersection from_node does not exist on edge");
      break;
    }
  }
}

reverseNodes()

void EFAEdge::reverseNodes

(

)

Definition at line 192 of file EFAEdge.C.

{
  std::swap(_edge_node1, _edge_node2);
  for (unsigned int i = 0; i < _embedded_nodes.size(); ++i)
    _intersection_x[i] = 1.0 - _intersection_x[i];
}

setInteriorNode()

void EFAEdge::setInteriorNode ( EFANode *  node )

inline

Definition at line 52 of file EFAEdge.h.

{ _edge_interior_node = node; };

switchNode()

void EFAEdge::switchNode	(	EFANode *	new_node,
		EFANode *	old_node
	)

Definition at line 365 of file EFAEdge.C.

{
  if (_edge_node1 == old_node)
    _edge_node1 = new_node;
  else if (_edge_node2 == old_node)
    _edge_node2 = new_node;
  else if (isEmbeddedNode(old_node))
  {
    unsigned int id = getEmbeddedNodeIndex(old_node);
    _embedded_nodes[id] = new_node;
  }
}

Member Data Documentation

_edge_interior_node

EFANode* EFAEdge::_edge_interior_node

private

Definition at line 27 of file EFAEdge.h.

Referenced by EFAEdge(), getInteriorNode(), and setInteriorNode().

_edge_node1

EFANode* EFAEdge::_edge_node1

private

Definition at line 25 of file EFAEdge.h.

Referenced by addIntersection(), consistencyCheck(), containsEdge(), containsNode(), distanceFromNode1(), EFAEdge(), getEmbeddedNodeIndex(), getIntersection(), getNode(), getNodeMasters(), getSortedNodes(), hasIntersection(), hasIntersectionAtPosition(), isEmbeddedPermanent(), resetIntersection(), reverseNodes(), and switchNode().

_edge_node2

EFANode* EFAEdge::_edge_node2

private

Definition at line 26 of file EFAEdge.h.

Referenced by addIntersection(), consistencyCheck(), containsEdge(), containsNode(), distanceFromNode1(), EFAEdge(), getEmbeddedNodeIndex(), getIntersection(), getNode(), getNodeMasters(), getSortedNodes(), hasIntersection(), hasIntersectionAtPosition(), isEmbeddedPermanent(), resetIntersection(), reverseNodes(), and switchNode().

_embedded_nodes

std::vector<EFANode *> EFAEdge::_embedded_nodes

private

Definition at line 28 of file EFAEdge.h.

Referenced by addIntersection(), consistencyCheck(), copyIntersection(), EFAEdge(), EFAEdge(), getEmbeddedNode(), getEmbeddedNodeIndex(), getEmbeddedNodeIndex(), getNodeMasters(), hasIntersection(), hasIntersectionAtPosition(), isEmbeddedNode(), numEmbeddedNodes(), removeEmbeddedNode(), removeEmbeddedNodes(), resetIntersection(), reverseNodes(), and switchNode().

_intersection_x

std::vector<double> EFAEdge::_intersection_x

private

Definition at line 29 of file EFAEdge.h.

Referenced by addIntersection(), consistencyCheck(), copyIntersection(), distanceFromNode1(), EFAEdge(), EFAEdge(), getEmbeddedNodeIndex(), getIntersection(), getNodeMasters(), hasIntersectionAtPosition(), removeEmbeddedNode(), removeEmbeddedNodes(), resetIntersection(), and reverseNodes().

---

The documentation for this class was generated from the following files:

• xfem/include/efa/EFAEdge.h
• xfem/src/efa/EFAEdge.C