ElementFragmentAlgorithm Class Reference

#include <ElementFragmentAlgorithm.h>

Public Member Functions
	ElementFragmentAlgorithm (std::ostream &os)
	Constructor. More...
	~ElementFragmentAlgorithm ()
unsigned int	add2DElements (std::vector< std::vector< unsigned int >> &quads)
EFAElement *	add2DElement (std::vector< unsigned int > quad, unsigned int id)
EFAElement *	add3DElement (std::vector< unsigned int > quad, unsigned int id)
void	updateEdgeNeighbors ()
void	initCrackTipTopology ()
void	addElemEdgeIntersection (unsigned int elemid, unsigned int edgeid, double position)
void	addElemNodeIntersection (unsigned int elemid, unsigned int nodeid)
bool	addFragEdgeIntersection (unsigned int elemid, unsigned int frag_edge_id, double position)
void	addElemFaceIntersection (unsigned int elemid, unsigned int faceid, std::vector< unsigned int > edgeid, std::vector< double > position)
void	addFragFaceIntersection (unsigned int ElemID, unsigned int FragFaceID, std::vector< unsigned int > FragFaceEdgeID, std::vector< double > position)
void	updatePhysicalLinksAndFragments ()
void	updateTopology (bool mergeUncutVirtualEdges=true)
void	reset ()
void	clearAncestry ()
void	restoreFragmentInfo (EFAElement *const elem, const EFAElement *const from_elem)
void	createChildElements ()
void	connectFragments (bool mergeUncutVirtualEdges)
void	sanityCheck ()
void	updateCrackTipElements ()
void	printMesh ()
void	error (const std::string &error_string)
const std::vector< EFAElement * > &	getChildElements ()
const std::vector< EFAElement * > &	getParentElements ()
const std::vector< EFANode * > &	getNewNodes ()
const std::set< EFAElement * > &	getCrackTipElements ()
const std::map< unsigned int, EFANode * > &	getPermanentNodes ()
const std::map< unsigned int, EFANode * > &	getTempNodes ()
const std::map< unsigned int, EFANode * > &	getEmbeddedNodes ()
EFAElement *	getElemByID (unsigned int id)
unsigned int	getElemIdByNodes (unsigned int *node_id)
void	clearPotentialIsolatedNodes ()

Private Attributes
std::ostream &	_ostream
std::map< unsigned int, EFANode * >	_permanent_nodes
std::map< unsigned int, EFANode * >	_embedded_nodes
std::map< unsigned int, EFANode * >	_temp_nodes
std::map< unsigned int, EFANode * >	_embedded_permanent_nodes
std::map< unsigned int, EFAElement * >	_elements
std::set< EFAElement * >	_crack_tip_elements
std::vector< EFANode * >	_new_nodes
std::vector< EFANode * >	_deleted_nodes
std::vector< EFAElement * >	_child_elements
std::vector< EFAElement * >	_parent_elements
std::map< EFANode *, std::set< EFAElement * > >	_inverse_connectivity

Detailed Description

Definition at line 20 of file ElementFragmentAlgorithm.h.

Constructor & Destructor Documentation

ElementFragmentAlgorithm()

ElementFragmentAlgorithm::ElementFragmentAlgorithm

(

std::ostream &

os

)

Constructor.

Definition at line 30 of file ElementFragmentAlgorithm.C.

: _ostream(os) {}

~ElementFragmentAlgorithm()

ElementFragmentAlgorithm::~ElementFragmentAlgorithm

(

)

Definition at line 32 of file ElementFragmentAlgorithm.C.

{
  std::map<unsigned int, EFANode *>::iterator mit;
  for (mit = _permanent_nodes.begin(); mit != _permanent_nodes.end(); ++mit)
  {
    delete mit->second;
    mit->second = NULL;
  }
  for (mit = _embedded_nodes.begin(); mit != _embedded_nodes.end(); ++mit)
  {
    delete mit->second;
    mit->second = NULL;
  }
  for (mit = _embedded_permanent_nodes.begin(); mit != _embedded_permanent_nodes.end(); ++mit)
  {
    delete mit->second;
    mit->second = NULL;
  }
  for (mit = _temp_nodes.begin(); mit != _temp_nodes.end(); ++mit)
  {
    delete mit->second;
    mit->second = NULL;
  }
  std::map<unsigned int, EFAElement *>::iterator eit;
  for (eit = _elements.begin(); eit != _elements.end(); ++eit)
  {
    delete eit->second;
    eit->second = NULL;
  }
}

Member Function Documentation

add2DElement()

EFAElement * ElementFragmentAlgorithm::add2DElement	(	std::vector< unsigned int >	quad,
		unsigned int	id
	)

Definition at line 102 of file ElementFragmentAlgorithm.C.

Referenced by XFEM::buildEFAMesh().

{
  unsigned int num_nodes = quad.size();

  std::map<unsigned int, EFAElement *>::iterator mit = _elements.find(id);
  if (mit != _elements.end())
    EFAError("In add2DElement element with id: ", id, " already exists");

  EFAElement2D * newElem = new EFAElement2D(id, num_nodes);
  _elements.insert(std::make_pair(id, newElem));

  for (unsigned int j = 0; j < num_nodes; ++j)
  {
    EFANode * currNode = NULL;
    std::map<unsigned int, EFANode *>::iterator mit = _permanent_nodes.find(quad[j]);
    if (mit == _permanent_nodes.end())
    {
      currNode = new EFANode(quad[j], EFANode::N_CATEGORY_PERMANENT);
      _permanent_nodes.insert(std::make_pair(quad[j], currNode));
    }
    else
      currNode = mit->second;

    newElem->setNode(j, currNode);
    _inverse_connectivity[currNode].insert(newElem);
  }
  newElem->createEdges();
  return newElem;
}

add2DElements()

unsigned int ElementFragmentAlgorithm::add2DElements

(

std::vector< std::vector< unsigned int >> &

quads

)

Definition at line 64 of file ElementFragmentAlgorithm.C.

{
  unsigned int first_id = 0;
  unsigned int num_nodes = quads[0].size();

  if (quads.size() == 0)
    EFAError("add2DElements called with empty vector of quads");

  for (unsigned int i = 0; i < quads.size(); ++i)
  {
    unsigned int new_elem_id = Efa::getNewID(_elements);
    EFAElement2D * newElem = new EFAElement2D(new_elem_id, num_nodes);
    _elements.insert(std::make_pair(new_elem_id, newElem));

    if (i == 0)
      first_id = new_elem_id;

    for (unsigned int j = 0; j < num_nodes; ++j)
    {
      EFANode * currNode = NULL;
      std::map<unsigned int, EFANode *>::iterator mit = _permanent_nodes.find(quads[i][j]);
      if (mit == _permanent_nodes.end())
      {
        currNode = new EFANode(quads[i][j], EFANode::N_CATEGORY_PERMANENT);
        _permanent_nodes.insert(std::make_pair(quads[i][j], currNode));
      }
      else
        currNode = mit->second;

      newElem->setNode(j, currNode);
      _inverse_connectivity[currNode].insert(newElem);
    }
    newElem->createEdges();
  }
  return first_id;
}

add3DElement()

EFAElement * ElementFragmentAlgorithm::add3DElement	(	std::vector< unsigned int >	quad,
		unsigned int	id
	)

Definition at line 133 of file ElementFragmentAlgorithm.C.

Referenced by XFEM::buildEFAMesh().

{
  unsigned int num_nodes = quad.size();
  unsigned int num_faces = 0;
  if (num_nodes == 27)
    num_faces = 6;
  else if (num_nodes == 20)
    num_faces = 6;
  else if (num_nodes == 8)
    num_faces = 6;
  else if (num_nodes == 4)
    num_faces = 4;
  else if (num_nodes == 10)
    num_faces = 4;
  else
    EFAError("In add3DElement element with id: ", id, " has invalid num_nodes");

  std::map<unsigned int, EFAElement *>::iterator mit = _elements.find(id);
  if (mit != _elements.end())
    EFAError("In add3DElement element with id: ", id, " already exists");

  EFAElement3D * newElem = new EFAElement3D(id, num_nodes, num_faces);
  _elements.insert(std::make_pair(id, newElem));

  for (unsigned int j = 0; j < num_nodes; ++j)
  {
    EFANode * currNode = NULL;
    std::map<unsigned int, EFANode *>::iterator mit = _permanent_nodes.find(quad[j]);
    if (mit == _permanent_nodes.end())
    {
      currNode = new EFANode(quad[j], EFANode::N_CATEGORY_PERMANENT);
      _permanent_nodes.insert(std::make_pair(quad[j], currNode));
    }
    else
      currNode = mit->second;

    newElem->setNode(j, currNode);
    _inverse_connectivity[currNode].insert(newElem);
  }
  newElem->createFaces();
  return newElem;
}

addElemEdgeIntersection()

void ElementFragmentAlgorithm::addElemEdgeIntersection	(	unsigned int	elemid,
		unsigned int	edgeid,
		double	position
	)

Definition at line 212 of file ElementFragmentAlgorithm.C.

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

{
  // this method is called when we are marking cut edges
  std::map<unsigned int, EFAElement *>::iterator eit = _elements.find(elemid);
  if (eit == _elements.end())
    EFAError("Could not find element with id: ", elemid, " in addEdgeIntersection");

  EFAElement2D * curr_elem = dynamic_cast<EFAElement2D *>(eit->second);
  if (!curr_elem)
    EFAError("addElemEdgeIntersection: elem ", elemid, " is not of type EFAelement2D");
  curr_elem->addEdgeCut(edgeid, position, NULL, _embedded_nodes, true);
}

addElemFaceIntersection()

void ElementFragmentAlgorithm::addElemFaceIntersection	(	unsigned int	elemid,
		unsigned int	faceid,
		std::vector< unsigned int >	edgeid,
		std::vector< double >	position
	)

Definition at line 261 of file ElementFragmentAlgorithm.C.

Referenced by XFEM::markCutFacesByGeometry().

{
  // this method is called when we are marking cut edges
  std::map<unsigned int, EFAElement *>::iterator eit = _elements.find(elemid);
  if (eit == _elements.end())
    EFAError("Could not find element with id: ", elemid, " in addEdgeIntersection");

  EFAElement3D * curr_elem = dynamic_cast<EFAElement3D *>(eit->second);
  if (!curr_elem)
    EFAError("addElemEdgeIntersection: elem ", elemid, " is not of type EFAelement2D");

  // add cuts to two face edges at the same time
  curr_elem->addFaceEdgeCut(faceid, edgeid[0], position[0], NULL, _embedded_nodes, true, true);
  curr_elem->addFaceEdgeCut(faceid, edgeid[1], position[1], NULL, _embedded_nodes, true, true);
}

addElemNodeIntersection()

void ElementFragmentAlgorithm::addElemNodeIntersection	(	unsigned int	elemid,
		unsigned int	nodeid
	)

Definition at line 228 of file ElementFragmentAlgorithm.C.

Referenced by XFEM::markCutEdgesByGeometry().

{
  // this method is called when we are marking cut nodes
  std::map<unsigned int, EFAElement *>::iterator eit = _elements.find(elemid);
  if (eit == _elements.end())
    EFAError("Could not find element with id: ", elemid, " in addElemNodeIntersection");

  EFAElement2D * curr_elem = dynamic_cast<EFAElement2D *>(eit->second);
  if (!curr_elem)
    EFAError("addElemNodeIntersection: elem ", elemid, " is not of type EFAelement2D");

  // Only add cut node when the curr_elem does not have any fragment
  if (curr_elem->numFragments() == 0)
    curr_elem->addNodeCut(nodeid, NULL, _permanent_nodes, _embedded_permanent_nodes);
}

addFragEdgeIntersection()

bool ElementFragmentAlgorithm::addFragEdgeIntersection	(	unsigned int	elemid,
		unsigned int	frag_edge_id,
		double	position
	)

Definition at line 245 of file ElementFragmentAlgorithm.C.

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

{
  // N.B. this method must be called after addEdgeIntersection
  std::map<unsigned int, EFAElement *>::iterator eit = _elements.find(elemid);
  if (eit == _elements.end())
    EFAError("Could not find element with id: ", elemid, " in addFragEdgeIntersection");

  EFAElement2D * elem = dynamic_cast<EFAElement2D *>(eit->second);
  if (!elem)
    EFAError("addFragEdgeIntersection: elem ", elemid, " is not of type EFAelement2D");
  return elem->addFragmentEdgeCut(frag_edge_id, position, _embedded_nodes);
}

addFragFaceIntersection()

void ElementFragmentAlgorithm::addFragFaceIntersection	(	unsigned int	ElemID,
		unsigned int	FragFaceID,
		std::vector< unsigned int >	FragFaceEdgeID,
		std::vector< double >	position
	)

Definition at line 281 of file ElementFragmentAlgorithm.C.

Referenced by XFEM::markCutFacesByGeometry().

{
  // TODO: need to finish this for 3D problems
}

clearAncestry()

void ElementFragmentAlgorithm::clearAncestry

(

)

Definition at line 367 of file ElementFragmentAlgorithm.C.

{
  _inverse_connectivity.clear();
  for (unsigned int i = 0; i < _parent_elements.size(); ++i)
  {
    if (!Efa::deleteFromMap(_elements, _parent_elements[i]))
      EFAError("Attempted to delete parent element: ",
               _parent_elements[i]->id(),
               " from _elements, but couldn't find it");
  }
  _parent_elements.clear();

  std::map<unsigned int, EFAElement *>::iterator eit;
  for (eit = _elements.begin(); eit != _elements.end(); ++eit)
  {
    EFAElement * curr_elem = eit->second;
    curr_elem->clearParentAndChildren();
    for (unsigned int j = 0; j < curr_elem->numNodes(); j++)
    {
      EFANode * curr_node = curr_elem->getNode(j);
      _inverse_connectivity[curr_node].insert(curr_elem);
    }
  }

  std::map<unsigned int, EFANode *>::iterator mit;
  for (mit = _permanent_nodes.begin(); mit != _permanent_nodes.end(); ++mit)
    mit->second->removeParent();

  for (mit = _temp_nodes.begin(); mit != _temp_nodes.end(); ++mit)
  {
    delete mit->second;
    mit->second = NULL;
  }
  _temp_nodes.clear();

  _new_nodes.clear();
  _child_elements.clear();

  // TODO: Sanity check to make sure that there are no nodes that are not connected
  //      to an element -- there shouldn't be any
}

clearPotentialIsolatedNodes()

void ElementFragmentAlgorithm::clearPotentialIsolatedNodes

(

)

Definition at line 622 of file ElementFragmentAlgorithm.C.

Referenced by updateTopology().

{
  // Collect all parent nodes that will be isolated
  std::map<EFANode *, std::vector<EFANode *>> isolate_parent_to_child;
  for (unsigned int i = 0; i < _new_nodes.size(); ++i)
  {
    EFANode * parent_node = _new_nodes[i]->parent();
    if (!parent_node)
      EFAError("a new permanent node must have a parent node!");
    bool isParentNodeInNewElem = false;
    for (unsigned int j = 0; j < _child_elements.size(); ++j)
    {
      if (_child_elements[j]->containsNode(parent_node))
      {
        isParentNodeInNewElem = true;
        break;
      }
    }
    if (!isParentNodeInNewElem)
      isolate_parent_to_child[parent_node].push_back(_new_nodes[i]);
  }

  // For each isolated parent node, pick one of its child new node
  // Then, switch that child with its parent for all new elems
  std::map<EFANode *, std::vector<EFANode *>>::iterator mit;
  for (mit = isolate_parent_to_child.begin(); mit != isolate_parent_to_child.end(); ++mit)
  {
    EFANode * parent_node = mit->first;
    EFANode * child_node = (mit->second)[0]; // need to discard it and swap it back to its parent
    for (unsigned int i = 0; i < _child_elements.size(); ++i)
    {
      if (_child_elements[i]->containsNode(child_node))
        _child_elements[i]->switchNode(parent_node, child_node, true);
    }
    _new_nodes.erase(std::remove(_new_nodes.begin(), _new_nodes.end(), child_node),
                     _new_nodes.end());
    Efa::deleteFromMap(_permanent_nodes, child_node);
  }
}

connectFragments()

void ElementFragmentAlgorithm::connectFragments

(

bool

mergeUncutVirtualEdges

)

Definition at line 440 of file ElementFragmentAlgorithm.C.

Referenced by updateTopology().

{
  // now perform the comparison on the children
  for (unsigned int elem_iter = 0; elem_iter < _child_elements.size(); elem_iter++)
  {
    EFAElement * childElem = _child_elements[elem_iter];
    childElem->connectNeighbors(
        _permanent_nodes, _temp_nodes, _inverse_connectivity, mergeUncutVirtualEdges);
    childElem->updateFragmentNode();
  } // loop over child elements

  std::vector<EFAElement *>::iterator vit;
  for (vit = _child_elements.begin(); vit != _child_elements.end();)
  {
    if (*vit == NULL)
      vit = _child_elements.erase(vit);
    else
      ++vit;
  }
}

createChildElements()

void ElementFragmentAlgorithm::createChildElements

(

)

Definition at line 417 of file ElementFragmentAlgorithm.C.

Referenced by updateTopology().

{
  // temporary container for new elements -- will be merged with Elements
  std::map<unsigned int, EFAElement *> newChildElements;

  // loop over the original elements in the mesh
  std::map<unsigned int, EFAElement *>::iterator eit;
  std::map<unsigned int, EFAElement *>::iterator ElementsEnd = _elements.end();
  for (eit = _elements.begin(); eit != ElementsEnd; ++eit)
  {
    EFAElement * curr_elem = eit->second;
    curr_elem->createChild(_crack_tip_elements,
                           _elements,
                           newChildElements,
                           _child_elements,
                           _parent_elements,
                           _temp_nodes);
  } // loop over elements
  // Merge newChildElements back in with Elements
  _elements.insert(newChildElements.begin(), newChildElements.end());
}

error()

void ElementFragmentAlgorithm::error

(

const std::string &

error_string

)

getChildElements()

const std::vector<EFAElement *>& ElementFragmentAlgorithm::getChildElements ( )

inline

Definition at line 80 of file ElementFragmentAlgorithm.h.

Referenced by XFEM::cutMeshWithEFA().

{ return _child_elements; };

getCrackTipElements()

const std::set<EFAElement *>& ElementFragmentAlgorithm::getCrackTipElements ( )

inline

Definition at line 83 of file ElementFragmentAlgorithm.h.

Referenced by XFEM::cutMeshWithEFA(), and XFEM::storeCrackTipOriginAndDirection().

{ return _crack_tip_elements; };

getElemByID()

EFAElement * ElementFragmentAlgorithm::getElemByID

(

unsigned int

id

)

Definition at line 590 of file ElementFragmentAlgorithm.C.

Referenced by XFEM::buildEFAMesh(), XFEM::getEFAElem2D(), and XFEM::getEFAElem3D().

{
  std::map<unsigned int, EFAElement *>::iterator mit = _elements.find(id);
  if (mit == _elements.end())
    EFAError("in getElemByID() could not find element: ", id);
  return mit->second;
}

getElemIdByNodes()

unsigned int ElementFragmentAlgorithm::getElemIdByNodes

(

unsigned int *

node_id

)

Definition at line 599 of file ElementFragmentAlgorithm.C.

{
  unsigned int elem_id = 99999;
  std::map<unsigned int, EFAElement *>::iterator eit;
  for (eit = _elements.begin(); eit != _elements.end(); ++eit)
  {
    EFAElement * curr_elem = eit->second;
    unsigned int counter = 0;
    for (unsigned int i = 0; i < curr_elem->numNodes(); ++i)
    {
      if (curr_elem->getNode(i)->id() == node_id[i])
        counter += 1;
    }
    if (counter == curr_elem->numNodes())
    {
      elem_id = curr_elem->id();
      break;
    }
  }
  return elem_id;
}

getEmbeddedNodes()

const std::map<unsigned int, EFANode *>& ElementFragmentAlgorithm::getEmbeddedNodes ( )

inline

Definition at line 86 of file ElementFragmentAlgorithm.h.

{ return _embedded_nodes; }

getNewNodes()

const std::vector<EFANode *>& ElementFragmentAlgorithm::getNewNodes ( )

inline

Definition at line 82 of file ElementFragmentAlgorithm.h.

Referenced by XFEM::cutMeshWithEFA().

{ return _new_nodes; };

getParentElements()

const std::vector<EFAElement *>& ElementFragmentAlgorithm::getParentElements ( )

inline

Definition at line 81 of file ElementFragmentAlgorithm.h.

Referenced by XFEM::cutMeshWithEFA().

{ return _parent_elements; };

getPermanentNodes()

const std::map<unsigned int, EFANode *>& ElementFragmentAlgorithm::getPermanentNodes ( )

inline

Definition at line 84 of file ElementFragmentAlgorithm.h.

{ return _permanent_nodes; }

getTempNodes()

const std::map<unsigned int, EFANode *>& ElementFragmentAlgorithm::getTempNodes ( )

inline

Definition at line 85 of file ElementFragmentAlgorithm.h.

{ return _temp_nodes; }

initCrackTipTopology()

void ElementFragmentAlgorithm::initCrackTipTopology

(

)

Definition at line 200 of file ElementFragmentAlgorithm.C.

Referenced by XFEM::buildEFAMesh().

{
  _crack_tip_elements.clear(); // re-build CrackTipElements!
  std::map<unsigned int, EFAElement *>::iterator eit;
  for (eit = _elements.begin(); eit != _elements.end(); ++eit)
  {
    EFAElement * curr_elem = eit->second;
    curr_elem->initCrackTip(_crack_tip_elements); // CrackTipElements changed here
  }
}

printMesh()

void ElementFragmentAlgorithm::printMesh

(

)

Definition at line 504 of file ElementFragmentAlgorithm.C.

Referenced by sanityCheck().

{
  _ostream << "============================================================"
           << "==================================================" << std::endl;
  _ostream << "                                            CutElemMesh Data" << std::endl;
  _ostream << "============================================================"
           << "==================================================" << std::endl;
  _ostream << "Permanent Nodes:" << std::endl;
  std::map<unsigned int, EFANode *>::iterator mit;
  unsigned int counter = 0;
  for (mit = _permanent_nodes.begin(); mit != _permanent_nodes.end(); ++mit)
  {
    _ostream << "  " << mit->second->id();
    counter += 1;
    if (counter % 10 == 0)
      _ostream << std::endl;
  }
  _ostream << std::endl;
  _ostream << "Temp Nodes:" << std::endl;
  counter = 0;
  for (mit = _temp_nodes.begin(); mit != _temp_nodes.end(); ++mit)
  {
    _ostream << "  " << mit->second->id();
    counter += 1;
    if (counter % 10 == 0)
      _ostream << std::endl;
  }
  _ostream << std::endl;
  _ostream << "Embedded Nodes:" << std::endl;
  counter = 0;
  for (mit = _embedded_nodes.begin(); mit != _embedded_nodes.end(); ++mit)
  {
    _ostream << "  " << mit->second->id();
    counter += 1;
    if (counter % 10 == 0)
      _ostream << std::endl;
  }
  _ostream << std::endl;
  _ostream << "Embedded Permanent Nodes:" << std::endl;
  counter = 0;
  for (mit = _embedded_permanent_nodes.begin(); mit != _embedded_permanent_nodes.end(); ++mit)
  {
    _ostream << "  " << mit->second->id();
    counter += 1;
    if (counter % 10 == 0)
      _ostream << std::endl;
  }
  _ostream << std::endl;
  _ostream << "Parent Elements:" << std::endl;
  counter = 0;
  for (unsigned int i = 0; i < _parent_elements.size(); ++i)
  {
    _ostream << " " << _parent_elements[i]->id();
    counter += 1;
    if (counter % 10 == 0)
      _ostream << std::endl;
  }
  _ostream << std::endl;
  _ostream << "Child Elements:" << std::endl;
  counter = 0;
  for (unsigned int i = 0; i < _child_elements.size(); ++i)
  {
    _ostream << " " << _child_elements[i]->id();
    counter += 1;
    if (counter % 10 == 0)
      _ostream << std::endl;
  }
  _ostream << std::endl;
  _ostream << "Elements:" << std::endl;
  _ostream << "  id "
           << "|  nodes                "
           << "|  embedded nodes       "
           << "|  edge neighbors       "
           << "|  frag "
           << "|  frag link      ...   " << std::endl;
  _ostream << "------------------------------------------------------------"
           << "--------------------------------------------------" << std::endl;
  std::map<unsigned int, EFAElement *>::iterator eit;
  for (eit = _elements.begin(); eit != _elements.end(); ++eit)
  {
    EFAElement * currElem = eit->second;
    currElem->printElement(_ostream);
  }
}

reset()

void ElementFragmentAlgorithm::reset

(

)

Definition at line 330 of file ElementFragmentAlgorithm.C.

Referenced by XFEM::buildEFAMesh().

{
  _new_nodes.clear();
  _child_elements.clear();
  _parent_elements.clear();
  //  _merged_edge_map.clear();
  _crack_tip_elements.clear();
  _inverse_connectivity.clear();

  std::map<unsigned int, EFANode *>::iterator mit;
  for (mit = _permanent_nodes.begin(); mit != _permanent_nodes.end(); ++mit)
  {
    delete mit->second;
    mit->second = NULL;
  }
  _permanent_nodes.clear();
  //  for (mit = EmbeddedNodes.begin(); mit != EmbeddedNodes.end(); ++mit )
  //  {
  //    delete mit->second;
  //    mit->second = NULL;
  //  }
  for (mit = _temp_nodes.begin(); mit != _temp_nodes.end(); ++mit)
  {
    delete mit->second;
    mit->second = NULL;
  }
  _temp_nodes.clear();
  std::map<unsigned int, EFAElement *>::iterator eit;
  for (eit = _elements.begin(); eit != _elements.end(); ++eit)
  {
    delete eit->second;
    eit->second = NULL;
  }
  _elements.clear();
}

restoreFragmentInfo()

void ElementFragmentAlgorithm::restoreFragmentInfo	(	EFAElement *const	elem,
		const EFAElement *const	from_elem
	)

Definition at line 410 of file ElementFragmentAlgorithm.C.

Referenced by XFEM::buildEFAMesh().

{
  elem->restoreFragment(from_elem);
}

sanityCheck()

void ElementFragmentAlgorithm::sanityCheck

(

)

Definition at line 462 of file ElementFragmentAlgorithm.C.

Referenced by updateTopology().

{
  // Make sure there are no remaining TempNodes
  if (_temp_nodes.size() > 0)
  {
    _ostream << "_temp_nodes size > 0.  size=" << _temp_nodes.size() << std::endl;
    printMesh();
    exit(1);
  }
}

updateCrackTipElements()

void ElementFragmentAlgorithm::updateCrackTipElements

(

)

Definition at line 474 of file ElementFragmentAlgorithm.C.

Referenced by updateTopology().

{
  std::set<EFAElement *>::iterator sit;
  // Delete all elements that were previously flagged as crack tip elements if they have
  // been split (and hence appear in ParentElements).
  for (unsigned int i = 0; i < _parent_elements.size(); ++i)
  {
    sit = _crack_tip_elements.find(_parent_elements[i]);
    if (sit != _crack_tip_elements.end())
      _crack_tip_elements.erase(sit);
  }

  // Go through new child elements to find elements that are newly at the crack tip due to
  // crack growth.
  for (unsigned int elem_iter = 0; elem_iter < _child_elements.size(); elem_iter++)
  {
    EFAElement * childElem = _child_elements[elem_iter];
    if (childElem->isCrackTipElement())
      _crack_tip_elements.insert(childElem);
  } // loop over (new) child elements

  //_ostream << "Crack tip elements: ";
  // for (sit=CrackTipElements.begin(); sit!=CrackTipElements.end(); ++sit)
  //{
  //  _ostream << (*sit)->id<<" ";
  //}
  //_ostream << std::endl;
}

updateEdgeNeighbors()

void ElementFragmentAlgorithm::updateEdgeNeighbors

(

)

Definition at line 177 of file ElementFragmentAlgorithm.C.

Referenced by XFEM::buildEFAMesh().

{
  std::map<unsigned int, EFAElement *>::iterator eit;
  for (eit = _elements.begin(); eit != _elements.end(); ++eit)
  {
    EFAElement * elem = eit->second;
    elem->clearNeighbors();
  }

  for (eit = _elements.begin(); eit != _elements.end(); ++eit)
  {
    EFAElement * curr_elem = eit->second;
    curr_elem->setupNeighbors(_inverse_connectivity);
  } // loop over all elements

  for (eit = _elements.begin(); eit != _elements.end(); ++eit)
  {
    EFAElement * curr_elem = eit->second;
    curr_elem->neighborSanityCheck();
  }
}

updatePhysicalLinksAndFragments()

void ElementFragmentAlgorithm::updatePhysicalLinksAndFragments

(

)

Definition at line 290 of file ElementFragmentAlgorithm.C.

Referenced by XFEM::cutMeshWithEFA().

{
  // loop over the elements in the mesh
  std::map<unsigned int, EFAElement *>::iterator eit;
  for (eit = _elements.begin(); eit != _elements.end(); ++eit)
  {
    EFAElement * curr_elem = eit->second;
    curr_elem->updateFragments(_crack_tip_elements, _embedded_nodes);
  } // loop over all elements
}

updateTopology()

void ElementFragmentAlgorithm::updateTopology

(

bool

mergeUncutVirtualEdges = true

)

Definition at line 302 of file ElementFragmentAlgorithm.C.

Referenced by XFEM::cutMeshWithEFA().

{
  // If mergeUncutVirtualEdges=true, this algorithm replicates the
  // behavior of classical XFEM.  If false, it gives the behavior of
  // the Richardson et. al. (2011) paper

  _new_nodes.clear();
  _child_elements.clear();
  _parent_elements.clear();
  //  _merged_edge_map.clear();

  unsigned int first_new_node_id = Efa::getNewID(_permanent_nodes);

  createChildElements();
  connectFragments(mergeUncutVirtualEdges);
  sanityCheck();
  updateCrackTipElements();

  std::map<unsigned int, EFANode *>::iterator mit;
  for (mit = _permanent_nodes.begin(); mit != _permanent_nodes.end(); ++mit)
  {
    if (mit->first >= first_new_node_id)
      _new_nodes.push_back(mit->second);
  }
  clearPotentialIsolatedNodes(); // _new_nodes and _permanent_nodes may change here
}

Member Data Documentation

_child_elements

std::vector<EFAElement *> ElementFragmentAlgorithm::_child_elements

private

Definition at line 42 of file ElementFragmentAlgorithm.h.

Referenced by clearAncestry(), clearPotentialIsolatedNodes(), connectFragments(), createChildElements(), getChildElements(), printMesh(), reset(), updateCrackTipElements(), and updateTopology().

_crack_tip_elements

std::set<EFAElement *> ElementFragmentAlgorithm::_crack_tip_elements

private

Definition at line 39 of file ElementFragmentAlgorithm.h.

Referenced by createChildElements(), getCrackTipElements(), initCrackTipTopology(), reset(), updateCrackTipElements(), and updatePhysicalLinksAndFragments().

_deleted_nodes

std::vector<EFANode *> ElementFragmentAlgorithm::_deleted_nodes

private

Definition at line 41 of file ElementFragmentAlgorithm.h.

_elements

std::map<unsigned int, EFAElement *> ElementFragmentAlgorithm::_elements

private

Definition at line 37 of file ElementFragmentAlgorithm.h.

Referenced by add2DElement(), add2DElements(), add3DElement(), addElemEdgeIntersection(), addElemFaceIntersection(), addElemNodeIntersection(), addFragEdgeIntersection(), clearAncestry(), createChildElements(), getElemByID(), getElemIdByNodes(), initCrackTipTopology(), printMesh(), reset(), updateEdgeNeighbors(), updatePhysicalLinksAndFragments(), and ~ElementFragmentAlgorithm().

_embedded_nodes

std::map<unsigned int, EFANode *> ElementFragmentAlgorithm::_embedded_nodes

private

Definition at line 34 of file ElementFragmentAlgorithm.h.

Referenced by addElemEdgeIntersection(), addElemFaceIntersection(), addFragEdgeIntersection(), getEmbeddedNodes(), printMesh(), updatePhysicalLinksAndFragments(), and ~ElementFragmentAlgorithm().

_embedded_permanent_nodes

std::map<unsigned int, EFANode *> ElementFragmentAlgorithm::_embedded_permanent_nodes

private

Definition at line 36 of file ElementFragmentAlgorithm.h.

Referenced by addElemNodeIntersection(), printMesh(), and ~ElementFragmentAlgorithm().

_inverse_connectivity

std::map<EFANode *, std::set<EFAElement *> > ElementFragmentAlgorithm::_inverse_connectivity

private

Definition at line 44 of file ElementFragmentAlgorithm.h.

Referenced by add2DElement(), add2DElements(), add3DElement(), clearAncestry(), connectFragments(), reset(), and updateEdgeNeighbors().

_new_nodes

std::vector<EFANode *> ElementFragmentAlgorithm::_new_nodes

private

Definition at line 40 of file ElementFragmentAlgorithm.h.

Referenced by clearAncestry(), clearPotentialIsolatedNodes(), getNewNodes(), reset(), and updateTopology().

_ostream

std::ostream& ElementFragmentAlgorithm::_ostream

private

Definition at line 31 of file ElementFragmentAlgorithm.h.

Referenced by printMesh(), and sanityCheck().

_parent_elements

std::vector<EFAElement *> ElementFragmentAlgorithm::_parent_elements

private

Definition at line 43 of file ElementFragmentAlgorithm.h.

Referenced by clearAncestry(), createChildElements(), getParentElements(), printMesh(), reset(), updateCrackTipElements(), and updateTopology().

_permanent_nodes

std::map<unsigned int, EFANode *> ElementFragmentAlgorithm::_permanent_nodes

private

Definition at line 33 of file ElementFragmentAlgorithm.h.

Referenced by add2DElement(), add2DElements(), add3DElement(), addElemNodeIntersection(), clearAncestry(), clearPotentialIsolatedNodes(), connectFragments(), getPermanentNodes(), printMesh(), reset(), updateTopology(), and ~ElementFragmentAlgorithm().

_temp_nodes

std::map<unsigned int, EFANode *> ElementFragmentAlgorithm::_temp_nodes

private

Definition at line 35 of file ElementFragmentAlgorithm.h.

Referenced by clearAncestry(), connectFragments(), createChildElements(), getTempNodes(), printMesh(), reset(), sanityCheck(), and ~ElementFragmentAlgorithm().

---

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

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