-
Notifications
You must be signed in to change notification settings - Fork 18
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
added: class for simple global node number establishment for LR splines
use this to enable adaptive refinement for mixed multi-patch models. in particular, the refinements basis differ from the finite element bases for some formulations, so a simple node numbering scheme for the refinement basis is required to perform the multi-patch refinements.
- Loading branch information
Showing
12 changed files
with
313 additions
and
31 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,174 @@ | ||
| // $Id$ | ||
| //============================================================================== | ||
| //! | ||
| //! \file GlobalNodes.C | ||
| //! | ||
| //! \date Mar 13 2018 | ||
| //! | ||
| //! \author Arne Morten Kvarving / SINTEF | ||
| //! | ||
| //! \brief Simple global node establishment for unstructured FE models. | ||
| //! | ||
| //============================================================================== | ||
|
|
||
| #include "GlobalNodes.h" | ||
| #include "ASMunstruct.h" | ||
| #include "Utilities.h" | ||
|
|
||
|
|
||
| GlobalNodes::IntVec GlobalNodes::getBoundaryNodes(const LR::LRSpline& lr, | ||
| int dim, int lidx, int orient) | ||
| { | ||
| GlobalNodes::IntVec lNodes; | ||
| std::vector<LR::Basisfunction*> edgeFunctions; | ||
| LR::parameterEdge edge; | ||
| if (dim == 0) { | ||
| if (lr.nVariate() == 2) { | ||
| switch (lidx) { | ||
| case 1: edge = LR::WEST | LR::SOUTH; break; | ||
| case 2: edge = LR::EAST | LR::SOUTH; break; | ||
| case 3: edge = LR::WEST | LR::NORTH; break; | ||
| case 4: edge = LR::EAST | LR::NORTH; break; | ||
| } | ||
| } else { | ||
| switch (lidx) { | ||
| case 1: edge = LR::WEST | LR::SOUTH | LR::BOTTOM; break; | ||
| case 2: edge = LR::EAST | LR::SOUTH | LR::BOTTOM; break; | ||
| case 3: edge = LR::WEST | LR::NORTH | LR::BOTTOM; break; | ||
| case 4: edge = LR::EAST | LR::NORTH | LR::BOTTOM; break; | ||
| case 5: edge = LR::WEST | LR::SOUTH | LR::TOP; break; | ||
| case 6: edge = LR::EAST | LR::SOUTH | LR::TOP; break; | ||
| case 7: edge = LR::WEST | LR::NORTH | LR::TOP; break; | ||
| case 8: edge = LR::EAST | LR::NORTH | LR::TOP; break; | ||
| } | ||
| } | ||
| } else if (dim == 1) { | ||
| if (lr.nVariate() == 2) { | ||
| switch (lidx) { | ||
| case 1: edge = LR::WEST; break; | ||
| case 2: edge = LR::EAST; break; | ||
| case 3: edge = LR::SOUTH; break; | ||
| case 4: edge = LR::NORTH; break; | ||
| default: break; | ||
| } | ||
| } else { | ||
| switch (lidx) { | ||
| case 1: edge = LR::BOTTOM | LR::SOUTH; break; | ||
| case 2: edge = LR::BOTTOM | LR::NORTH; break; | ||
| case 3: edge = LR::TOP | LR::SOUTH; break; | ||
| case 4: edge = LR::TOP | LR::NORTH; break; | ||
| case 5: edge = LR::BOTTOM | LR::WEST; break; | ||
| case 6: edge = LR::BOTTOM | LR::EAST; break; | ||
| case 7: edge = LR::TOP | LR::WEST; break; | ||
| case 8: edge = LR::TOP | LR::WEST; break; | ||
| case 9: edge = LR::SOUTH | LR::WEST; break; | ||
| case 10: edge = LR::SOUTH | LR::EAST; break; | ||
| case 11: edge = LR::NORTH | LR::WEST; break; | ||
| case 12: edge = LR::NORTH | LR::EAST; break; | ||
| } | ||
| } | ||
| } else if (dim == 2) { | ||
| switch (lidx) { | ||
| case 1: edge = LR::WEST; break; | ||
| case 2: edge = LR::EAST; break; | ||
| case 3: edge = LR::SOUTH; break; | ||
| case 4: edge = LR::NORTH; break; | ||
| case 5: edge = LR::BOTTOM; break; | ||
| case 6: edge = LR::TOP; break; | ||
| } | ||
| } | ||
|
|
||
| lr.getEdgeFunctions(edgeFunctions, edge); | ||
|
|
||
| if (dim == 1) { | ||
| if (lr.nVariate() == 2) { | ||
| int v = (lidx == 1 || lidx == 2) ? 0 : 1; | ||
| int u = 1-v; | ||
| ASMunstruct::Sort(u, v, orient, edgeFunctions); | ||
| } else { | ||
| int dir = (lidx-1)/4; | ||
| int u = dir == 0; | ||
| int v = 1 + (dir != 2); | ||
| ASMunstruct::Sort(u, v, orient, edgeFunctions); | ||
| } | ||
| } else if (dim == 2) { | ||
| int dir = (lidx-1)/2; | ||
| int u = dir == 0; | ||
| int v = 1 + (dir != 2); | ||
| ASMunstruct::Sort(u, v, orient, edgeFunctions); | ||
| } | ||
|
|
||
| lNodes.reserve(edgeFunctions.size()); | ||
| for (const LR::Basisfunction* func : edgeFunctions) | ||
| lNodes.push_back(func->getId()); | ||
|
|
||
| return lNodes; | ||
| } | ||
|
|
||
|
|
||
| class InterfaceOrder { | ||
| public: | ||
| bool operator()(const ASM::Interface& A, const ASM::Interface& B) const | ||
| { | ||
| if (A.master != B.master) | ||
| return A.master < B.master; | ||
|
|
||
| if (A.slave != B.slave) | ||
| return A.slave < B.slave; | ||
|
|
||
| if (A.dim != B.dim) | ||
| return A.dim < B.dim; | ||
|
|
||
| return A.midx < B.midx; | ||
| } | ||
| }; | ||
|
|
||
|
|
||
| std::vector<GlobalNodes::IntVec> | ||
| GlobalNodes::calcGlobalNodes(const GlobalNodes::LRSplineVec& pchs, | ||
| const GlobalNodes::InterfaceVec& interfaces) | ||
| { | ||
| // count total number of nodes | ||
| size_t nNodes = 0; | ||
| std::vector<GlobalNodes::IntVec> result(pchs.size()); | ||
| auto it = result.begin(); | ||
| for (const LR::LRSpline* pch : pchs) { | ||
| it->resize(pch->nBasisFunctions()); | ||
| std::iota(it->begin(), it->end(), nNodes); | ||
| nNodes += pch->nBasisFunctions(); | ||
| ++it; | ||
| } | ||
|
|
||
| // remap common nodes | ||
| InterfaceOrder ifOrder; | ||
| std::set<ASM::Interface, InterfaceOrder> ifset(ifOrder); | ||
| for (const ASM::Interface& it : interfaces) | ||
| ifset.insert(it); | ||
| for (size_t i = 0; i < pchs.size(); ++i) { | ||
| std::map<int,int> old2new; | ||
| for (const ASM::Interface& it : ifset) { | ||
| if (it.master != (int)i+1) | ||
| continue; | ||
|
|
||
| IntVec mNodes = getBoundaryNodes(*pchs[i], it.dim, it.midx, 0); | ||
| IntVec sNodes = getBoundaryNodes(*pchs[it.slave-1], it.dim, it.sidx, it.orient); | ||
| for (size_t n = 0; n < mNodes.size(); ++n) | ||
| old2new[result[it.slave-1][sNodes[n]]] = result[i][mNodes[n]]; | ||
| } | ||
|
|
||
| // renumber | ||
| for (size_t j = i; j < pchs.size(); ++j) | ||
| for (int& it : result[j]) | ||
| utl::renumber(it, old2new, false); | ||
|
|
||
| // compress | ||
| if (i > 0) { | ||
| int maxNode = *std::max_element(result[i-1].begin(), result[i-1].end()); | ||
| for (int& n : result[i]) | ||
| if (n > maxNode) | ||
| n = ++maxNode; | ||
| } | ||
| } | ||
|
|
||
| return result; | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,50 @@ | ||
| // $Id$ | ||
| //============================================================================== | ||
| //! | ||
| //! \file GlobalNodes.h | ||
| //! | ||
| //! \date Mar 13 2018 | ||
| //! | ||
| //! \author Arne Morten Kvarving / SINTEF | ||
| //! | ||
| //! \brief Simple global node establishment for unstructured FE models. | ||
| //! | ||
| //============================================================================== | ||
|
|
||
| #ifndef _GLOBAL_NODES_H_ | ||
| #define _GLOBAL_NODES_H_ | ||
|
|
||
| #include "Interface.h" | ||
| #include <LRSpline/LRSplineSurface.h> | ||
|
|
||
| #include <vector> | ||
|
|
||
|
|
||
| /*! | ||
| \brief Class establishing global node numbers for unstructed FE models. | ||
| */ | ||
|
|
||
| class GlobalNodes | ||
| { | ||
| public: | ||
| typedef std::vector<int> IntVec; //!< Convenience typedef | ||
| typedef std::vector<const LR::LRSpline*> LRSplineVec; //!< Convenience typedef | ||
| typedef std::vector<ASM::Interface> InterfaceVec; //!< Convenience typedef | ||
|
|
||
| //! \brief Extract local boundary nodes for a LR spline. | ||
| //! \param lr The LR spline to extract boundary nodes for | ||
| //! \param dim The dimension of the boundary to extract | ||
| //! \param lidx The local index of the boundary to extract | ||
| //! \param orient Orientation of nodes on boundary | ||
| static IntVec getBoundaryNodes(const LR::LRSpline& lr, | ||
| int dim, int lidx, int orient); | ||
|
|
||
|
|
||
| //! \brief Calculate global node numbers for a FE model. | ||
| //! \param pchs The spline patches in the model | ||
| //! \param interfaces The topological connections for the spline patches | ||
| static std::vector<IntVec> calcGlobalNodes(const LRSplineVec& pchs, | ||
| const InterfaceVec& interfaces); | ||
| }; | ||
|
|
||
| #endif |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.