Version: 8.3.0
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
INTERP_KERNEL::QuadraticPolygon Member List

This is the complete list of members for INTERP_KERNEL::QuadraticPolygon, including all inherited members.

_sub_edgesINTERP_KERNEL::ComposedEdgeprotected
appendCrudeData(const std::map< INTERP_KERNEL::Node *, int > &mapp, double xBary, double yBary, double fact, int offset, std::vector< double > &addCoordsQuadratic, std::vector< int > &conn, std::vector< int > &connI) const INTERP_KERNEL::QuadraticPolygon
appendEdgeFromCrudeDataArray(std::size_t edgeId, const std::map< int, INTERP_KERNEL::Node * > &mapp, bool isQuad, const int *nodalBg, const double *coords, const int *descBg, const int *descEnd, const std::vector< std::vector< int > > &intersectEdges)INTERP_KERNEL::QuadraticPolygon
appendSubEdgeFromCrudeDataArray(Edge *baseEdge, std::size_t j, bool direct, int edgeId, const std::vector< int > &subEdge, const std::map< int, INTERP_KERNEL::Node * > &mapp)INTERP_KERNEL::QuadraticPolygon
applyGlobalSimilarity(double xBary, double yBary, double dimChar)INTERP_KERNEL::ComposedEdge
applyGlobalSimilarity2(ComposedEdge *other, double xBary, double yBary, double dimChar)INTERP_KERNEL::ComposedEdge
applySimilarity(double xBary, double yBary, double dimChar)INTERP_KERNEL::ComposedEdge
applySimilarityOnMyEdges(double xBary, double yBary, double dimChar) const INTERP_KERNEL::ComposedEdge
applySimilarityOnMyEdgesIfNotAlreadyHit(double xBary, double yBary, double dimChar) const INTERP_KERNEL::ComposedEdge
applySimilarityOnMyNodes(double xBary, double yBary, double dimChar) const INTERP_KERNEL::ComposedEdge
applySimilarityOnMyNodesIfNotAlreadyHit(double xBary, double yBary, double dimChar) const INTERP_KERNEL::ComposedEdge
back() const INTERP_KERNEL::ComposedEdge
BuildArcCircleEdge(std::vector< Node * > &nodes)INTERP_KERNEL::QuadraticPolygonstatic
BuildArcCirclePolygon(std::vector< Node * > &nodes)INTERP_KERNEL::QuadraticPolygonstatic
BuildDbgFile(const std::vector< Node * > &nodes, const char *fileName)INTERP_KERNEL::QuadraticPolygonstatic
buildFromCrudeDataArray(const std::map< int, INTERP_KERNEL::Node * > &mapp, bool isQuad, const int *nodalBg, const double *coords, const int *descBg, const int *descEnd, const std::vector< std::vector< int > > &intersectEdges)INTERP_KERNEL::QuadraticPolygon
buildFromCrudeDataArray2(const std::map< int, INTERP_KERNEL::Node * > &mapp, bool isQuad, const int *nodalBg, const double *coords, const int *descBg, const int *descEnd, const std::vector< std::vector< int > > &intersectEdges, const INTERP_KERNEL::QuadraticPolygon &pol1, const int *descBg1, const int *descEnd1, const std::vector< std::vector< int > > &intersectEdges1, const std::vector< std::vector< int > > &colinear1, std::map< int, std::vector< INTERP_KERNEL::ElementaryEdge * > > &alreadyExistingIn2)INTERP_KERNEL::QuadraticPolygon
buildIntersectionPolygons(const QuadraticPolygon &pol1, const QuadraticPolygon &pol2) const INTERP_KERNEL::QuadraticPolygon
BuildLinearEdge(std::vector< Node * > &nodes)INTERP_KERNEL::QuadraticPolygonstatic
BuildLinearPolygon(std::vector< Node * > &nodes)INTERP_KERNEL::QuadraticPolygonstatic
buildPartitionsAbs(QuadraticPolygon &other, std::set< INTERP_KERNEL::Edge * > &edgesThis, std::set< INTERP_KERNEL::Edge * > &edgesBoundaryOther, const std::map< INTERP_KERNEL::Node *, int > &mapp, int idThis, int idOther, int offset, std::vector< double > &addCoordsQuadratic, std::vector< int > &conn, std::vector< int > &connI, std::vector< int > &nb1, std::vector< int > &nb2)INTERP_KERNEL::QuadraticPolygon
changeEndNodeWith(Node *node) const INTERP_KERNEL::ComposedEdge
changeStartNodeWith(Node *node) const INTERP_KERNEL::ComposedEdge
CheckInList(Node *n, std::list< QuadraticPolygon * >::iterator iStart, std::list< QuadraticPolygon * >::iterator iEnd)INTERP_KERNEL::QuadraticPolygonprotectedstatic
circularPermute()INTERP_KERNEL::QuadraticPolygon
clear()INTERP_KERNEL::ComposedEdge
clone() const INTERP_KERNEL::ComposedEdge
closeMe() const INTERP_KERNEL::QuadraticPolygon
ClosePolygons(std::list< QuadraticPolygon * > &pol2Zip, const QuadraticPolygon &pol1, const QuadraticPolygon &pol2, std::vector< QuadraticPolygon * > &results)INTERP_KERNEL::QuadraticPolygonprotectedstatic
completed() const INTERP_KERNEL::ComposedEdge
ComposedEdge()INTERP_KERNEL::ComposedEdge
ComposedEdge(const ComposedEdge &other)INTERP_KERNEL::ComposedEdge
ComposedEdge(int sz)INTERP_KERNEL::ComposedEdge
ComputeResidual(const QuadraticPolygon &pol1, const std::set< Edge * > &notUsedInPol1, const std::set< Edge * > &edgesInPol2OnBoundary, const std::map< INTERP_KERNEL::Node *, int > &mapp, int offset, int idThis, std::vector< double > &addCoordsQuadratic, std::vector< int > &conn, std::vector< int > &connI, std::vector< int > &nb1, std::vector< int > &nb2)INTERP_KERNEL::QuadraticPolygonstatic
Delete(ComposedEdge *pt)INTERP_KERNEL::ComposedEdgestatic
dispatchPerimeter(double &partConsidered) const INTERP_KERNEL::ComposedEdge
dispatchPerimeterAdv(const ComposedEdge &father, std::vector< double > &result) const INTERP_KERNEL::ComposedEdge
dispatchPerimeterExcl(double &partConsidered, double &commonPart) const INTERP_KERNEL::ComposedEdge
dumpInXfigFile(const char *fileName) const INTERP_KERNEL::QuadraticPolygon
dumpInXfigFile(std::ostream &stream, int resolution, const Bounds &box) const INTERP_KERNEL::QuadraticPolygonprotected
dumpInXfigFileWithOther(const ComposedEdge &other, const char *fileName) const INTERP_KERNEL::QuadraticPolygon
empty() const INTERP_KERNEL::ComposedEdge
fillAsMuchAsPossibleWith(const QuadraticPolygon &pol1Splitted, std::list< QuadraticPolygon * >::iterator iStart, std::list< QuadraticPolygon * >::iterator iEnd, bool direction)INTERP_KERNEL::QuadraticPolygonprotected
fillBounds(Bounds &output) const INTERP_KERNEL::ComposedEdge
front() const INTERP_KERNEL::ComposedEdge
getAllNodes(std::set< Node * > &output) const INTERP_KERNEL::ComposedEdge
getArea() const INTERP_KERNEL::ComposedEdge
getBarycenter(double *bary) const INTERP_KERNEL::ComposedEdge
getBarycenter(double *bary, double &weigh) const INTERP_KERNEL::ComposedEdge
getBarycenterGeneral(double *bary) const INTERP_KERNEL::ComposedEdge
getCommonLengthWith(const ComposedEdge &other) const INTERP_KERNEL::ComposedEdge
getDirection() const INTERP_KERNEL::ComposedEdge
getEndNode() const INTERP_KERNEL::ComposedEdge
getHydraulicDiameter() const INTERP_KERNEL::ComposedEdge
getPerimeter() const INTERP_KERNEL::ComposedEdge
getStartNode() const INTERP_KERNEL::ComposedEdge
haveIAChanceToBeCompletedBy(const QuadraticPolygon &pol1Splitted, const QuadraticPolygon &pol2NotSplitted, bool &direction)INTERP_KERNEL::QuadraticPolygon
initEdgeHitStatus() const INTERP_KERNEL::ComposedEdge
initLocations() const INTERP_KERNEL::ComposedEdge
InitLocationsWithOther(const ComposedEdge &first, const ComposedEdge &other)INTERP_KERNEL::ComposedEdgestatic
initNodeHitStatus() const INTERP_KERNEL::ComposedEdge
intersectForPerimeter(const QuadraticPolygon &other, double &perimeterThisPart, double &perimeterOtherPart, double &perimeterCommonPart) const INTERP_KERNEL::QuadraticPolygon
intersectForPerimeterAdvanced(const QuadraticPolygon &other, std::vector< double > &polThis, std::vector< double > &polOther) const INTERP_KERNEL::QuadraticPolygon
intersectForPoint(const QuadraticPolygon &other, std::vector< int > &numberOfCreatedPointsPerEdge) const INTERP_KERNEL::QuadraticPolygon
intersectMySelfWith(const QuadraticPolygon &other) const INTERP_KERNEL::QuadraticPolygon
intersectWith(const QuadraticPolygon &other) const INTERP_KERNEL::QuadraticPolygon
intersectWith(const QuadraticPolygon &other, double *barycenter) const INTERP_KERNEL::QuadraticPolygon
intersectWithAbs(QuadraticPolygon &other)INTERP_KERNEL::QuadraticPolygon
intersectWithAbs(QuadraticPolygon &other, double *barycenter)INTERP_KERNEL::QuadraticPolygon
intersectWithAbs1D(QuadraticPolygon &other, bool &isColinear)INTERP_KERNEL::QuadraticPolygon
intresincEqCoarse(const Edge *other) const INTERP_KERNEL::ComposedEdge
isButterfly() const INTERP_KERNEL::QuadraticPolygon
isButterflyAbs()INTERP_KERNEL::QuadraticPolygon
isInOrOut(Node *nodeToTest) const INTERP_KERNEL::ComposedEdge
isInOrOut2(Node *nodeToTest) const INTERP_KERNEL::ComposedEdge
isNodeIn(Node *n) const INTERP_KERNEL::ComposedEdge
normalize(ComposedEdge *other, double &xBary, double &yBary)INTERP_KERNEL::ComposedEdge
normalizeExt(ComposedEdge *other, double &xBary, double &yBary)INTERP_KERNEL::ComposedEdge
normalizeMe(double &xBary, double &yBary)INTERP_KERNEL::ComposedEdge
operator[](int i) const INTERP_KERNEL::ComposedEdge
performLocatingOperation(QuadraticPolygon &pol2) const INTERP_KERNEL::QuadraticPolygon
performLocatingOperationSlow(QuadraticPolygon &pol2) const INTERP_KERNEL::QuadraticPolygon
presenceOfOn() const INTERP_KERNEL::ComposedEdge
presenceOfQuadraticEdge() const INTERP_KERNEL::ComposedEdge
pushBack(Edge *edge, bool direction=true)INTERP_KERNEL::ComposedEdge
pushBack(ElementaryEdge *elem)INTERP_KERNEL::ComposedEdge
pushBack(ComposedEdge *elem)INTERP_KERNEL::ComposedEdge
QuadraticPolygon()INTERP_KERNEL::QuadraticPolygon
QuadraticPolygon(const QuadraticPolygon &other)INTERP_KERNEL::QuadraticPolygon
QuadraticPolygon(const char *fileName)INTERP_KERNEL::QuadraticPolygon
recursiveSize() const INTERP_KERNEL::ComposedEdge
resize(int i)INTERP_KERNEL::ComposedEdge
reverse()INTERP_KERNEL::ComposedEdge
setValueAt(int i, Edge *e, bool direction=true)INTERP_KERNEL::ComposedEdge
size() const INTERP_KERNEL::ComposedEdge
SoftDelete(ComposedEdge *pt)INTERP_KERNEL::ComposedEdgestatic
splitAbs(QuadraticPolygon &other, const std::map< INTERP_KERNEL::Node *, int > &mapThis, const std::map< INTERP_KERNEL::Node *, int > &mapOther, int offset1, int offset2, const std::vector< int > &otherEdgeIds, std::vector< int > &edgesThis, int cellIdThis, std::vector< std::vector< int > > &edgesInOtherColinearWithThis, std::vector< std::vector< int > > &subDivOther, std::vector< double > &addCoo, std::map< int, int > &mergedNodes)INTERP_KERNEL::QuadraticPolygon
SplitPolygonsEachOther(QuadraticPolygon &pol1, QuadraticPolygon &pol2, int &nbOfSplits)INTERP_KERNEL::QuadraticPolygonstatic
unApplyGlobalSimilarityExt(ComposedEdge &other, double xBary, double yBary, double fact)INTERP_KERNEL::ComposedEdge
unApplySimilarityOnMyEdges(double xBary, double yBary, double dimChar) const INTERP_KERNEL::ComposedEdge
unApplySimilarityOnMyEdgesIfNotAlreadyHit(double xBary, double yBary, double dimChar) const INTERP_KERNEL::ComposedEdge
unApplySimilarityOnMyNodes(double xBary, double yBary, double dimChar) const INTERP_KERNEL::ComposedEdge
unApplySimilarityOnMyNodesIfNotAlreadyHit(double xBary, double yBary, double dimChar) const INTERP_KERNEL::ComposedEdge
updateLocOfEdgeFromCrudeDataArray2(const int *descBg, const int *descEnd, const std::vector< std::vector< int > > &intersectEdges, const INTERP_KERNEL::QuadraticPolygon &pol1, const int *descBg1, const int *descEnd1, const std::vector< std::vector< int > > &intersectEdges1, const std::vector< std::vector< int > > &colinear1) const INTERP_KERNEL::QuadraticPolygon
UpdateNeighbours(const MergePoints &merger, IteratorOnComposedEdge it1, IteratorOnComposedEdge it2, const EDGES *e1, const EDGES *e2)INTERP_KERNEL::QuadraticPolygonprotectedstatic
UpdateNeighbours(const MergePoints &merger, IteratorOnComposedEdge it1, IteratorOnComposedEdge it2, const EDGES *e1, const EDGES *e2)INTERP_KERNEL::QuadraticPolygon
zipConsecutiveInSegments() const INTERP_KERNEL::QuadraticPolygonprotected
~ComposedEdge()INTERP_KERNEL::ComposedEdgeprotected
~QuadraticPolygon()INTERP_KERNEL::QuadraticPolygon