Version: 9.14.0
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 *, mcIdType > &mapp, double xBary, double yBary, double fact, mcIdType offset, std::vector< double > &addCoordsQuadratic, std::vector< mcIdType > &conn, std::vector< mcIdType > &connI) constINTERP_KERNEL::QuadraticPolygon
appendEdgeFromCrudeDataArray(std::size_t edgeId, const std::map< mcIdType, INTERP_KERNEL::Node * > &mapp, bool isQuad, const mcIdType *nodalBg, const double *coords, const mcIdType *descBg, const mcIdType *descEnd, const std::vector< std::vector< mcIdType > > &intersectEdges)INTERP_KERNEL::QuadraticPolygon
appendSubEdgeFromCrudeDataArray(Edge *baseEdge, std::size_t j, bool direct, mcIdType edgeId, const std::vector< mcIdType > &subEdge, const std::map< mcIdType, 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) constINTERP_KERNEL::ComposedEdge
applySimilarityOnMyEdgesIfNotAlreadyHit(double xBary, double yBary, double dimChar) constINTERP_KERNEL::ComposedEdge
applySimilarityOnMyNodes(double xBary, double yBary, double dimChar) constINTERP_KERNEL::ComposedEdge
applySimilarityOnMyNodesIfNotAlreadyHit(double xBary, double yBary, double dimChar) constINTERP_KERNEL::ComposedEdge
back() constINTERP_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< mcIdType, INTERP_KERNEL::Node * > &mapp, bool isQuad, const mcIdType *nodalBg, const double *coords, const mcIdType *descBg, const mcIdType *descEnd, const std::vector< std::vector< mcIdType > > &intersectEdges)INTERP_KERNEL::QuadraticPolygon
buildFromCrudeDataArray2(const std::map< mcIdType, INTERP_KERNEL::Node * > &mapp, bool isQuad, const mcIdType *nodalBg, const double *coords, const mcIdType *descBg, const mcIdType *descEnd, const std::vector< std::vector< mcIdType > > &intersectEdges, const INTERP_KERNEL::QuadraticPolygon &pol1, const mcIdType *descBg1, const mcIdType *descEnd1, const std::vector< std::vector< mcIdType > > &intersectEdges1, const std::vector< std::vector< mcIdType > > &colinear1, std::map< mcIdType, std::vector< INTERP_KERNEL::ElementaryEdge * > > &alreadyExistingIn2)INTERP_KERNEL::QuadraticPolygon
buildIntersectionPolygons(const QuadraticPolygon &pol1, const QuadraticPolygon &pol2) constINTERP_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 *, mcIdType > &mapp, mcIdType idThis, mcIdType idOther, mcIdType offset, std::vector< double > &addCoordsQuadratic, std::vector< mcIdType > &conn, std::vector< mcIdType > &connI, std::vector< mcIdType > &nb1, std::vector< mcIdType > &nb2)INTERP_KERNEL::QuadraticPolygon
changeEndNodeWith(Node *node) constINTERP_KERNEL::ComposedEdge
changeStartNodeWith(Node *node) constINTERP_KERNEL::ComposedEdge
CheckInList(Node *n, std::list< QuadraticPolygon * >::iterator iStart, std::list< QuadraticPolygon * >::iterator iEnd)INTERP_KERNEL::QuadraticPolygonprotectedstatic
circularPermute()INTERP_KERNEL::QuadraticPolygon
cleanDegeneratedConsecutiveEdges()INTERP_KERNEL::QuadraticPolygon
clear()INTERP_KERNEL::ComposedEdge
clone() constINTERP_KERNEL::ComposedEdge
closeMe() constINTERP_KERNEL::QuadraticPolygon
ClosePolygons(std::list< QuadraticPolygon * > &pol1Zip, const QuadraticPolygon &pol1, const QuadraticPolygon &pol2, std::vector< QuadraticPolygon * > &results)INTERP_KERNEL::QuadraticPolygonprotectedstatic
completed() constINTERP_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 *, mcIdType > &mapp, mcIdType offset, mcIdType idThis, std::vector< double > &addCoordsQuadratic, std::vector< mcIdType > &conn, std::vector< mcIdType > &connI, std::vector< mcIdType > &nb1, std::vector< mcIdType > &nb2)INTERP_KERNEL::QuadraticPolygonstatic
Delete(ComposedEdge *pt)INTERP_KERNEL::ComposedEdgestatic
dispatchPerimeter(double &partConsidered) constINTERP_KERNEL::ComposedEdge
dispatchPerimeterAdv(const ComposedEdge &father, std::vector< double > &result) constINTERP_KERNEL::ComposedEdge
dispatchPerimeterExcl(double &partConsidered, double &commonPart) constINTERP_KERNEL::ComposedEdge
dumpInXfigFile(const char *fileName) constINTERP_KERNEL::QuadraticPolygon
dumpInXfigFile(std::ostream &stream, int resolution, const Bounds &box) constINTERP_KERNEL::QuadraticPolygonprotected
dumpInXfigFileWithOther(const ComposedEdge &other, const char *fileName) constINTERP_KERNEL::QuadraticPolygon
dumpToCout(const std::map< INTERP_KERNEL::Node *, int > &mapp) constINTERP_KERNEL::ComposedEdge
empty() constINTERP_KERNEL::ComposedEdge
fillAsMuchAsPossibleWith(const QuadraticPolygon &pol2Splitted, std::list< QuadraticPolygon * >::iterator iStart, std::list< QuadraticPolygon * >::iterator iEnd, bool direction)INTERP_KERNEL::QuadraticPolygonprotected
fillBounds(Bounds &output) constINTERP_KERNEL::ComposedEdge
front() constINTERP_KERNEL::ComposedEdge
getAllNodes(std::set< Node * > &output) constINTERP_KERNEL::ComposedEdge
getArea() constINTERP_KERNEL::ComposedEdge
getBarycenter(double *bary) constINTERP_KERNEL::ComposedEdge
getBarycenter(double *bary, double &weigh) constINTERP_KERNEL::ComposedEdge
getBarycenterGeneral(double *bary) constINTERP_KERNEL::ComposedEdge
getCommonLengthWith(const ComposedEdge &other) constINTERP_KERNEL::ComposedEdge
getDirection() constINTERP_KERNEL::ComposedEdge
getEndNode() constINTERP_KERNEL::ComposedEdge
getHydraulicDiameter() constINTERP_KERNEL::ComposedEdge
getPerimeter() constINTERP_KERNEL::ComposedEdge
getStartNode() constINTERP_KERNEL::ComposedEdge
haveIAChanceToBeCompletedBy(const QuadraticPolygon &pol1NotSplitted, const QuadraticPolygon &pol2Splitted, bool &direction, bool &needCleaning) constINTERP_KERNEL::QuadraticPolygon
initEdgeHitStatus() constINTERP_KERNEL::ComposedEdge
initLocations() constINTERP_KERNEL::ComposedEdge
InitLocationsWithOther(const ComposedEdge &first, const ComposedEdge &other)INTERP_KERNEL::ComposedEdgestatic
initNodeHitStatus() constINTERP_KERNEL::ComposedEdge
intersectForPerimeter(const QuadraticPolygon &other, double &perimeterThisPart, double &perimeterOtherPart, double &perimeterCommonPart) constINTERP_KERNEL::QuadraticPolygon
intersectForPerimeterAdvanced(const QuadraticPolygon &other, std::vector< double > &polThis, std::vector< double > &polOther) constINTERP_KERNEL::QuadraticPolygon
intersectForPoint(const QuadraticPolygon &other, std::vector< int > &numberOfCreatedPointsPerEdge) constINTERP_KERNEL::QuadraticPolygon
intersectMySelfWith(const QuadraticPolygon &other) constINTERP_KERNEL::QuadraticPolygon
intersectWith(const QuadraticPolygon &other) constINTERP_KERNEL::QuadraticPolygon
intersectWith(const QuadraticPolygon &other, double *barycenter) constINTERP_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) constINTERP_KERNEL::ComposedEdge
isButterfly() constINTERP_KERNEL::QuadraticPolygon
isButterflyAbs()INTERP_KERNEL::QuadraticPolygon
isInOrOut(Node *nodeToTest) constINTERP_KERNEL::ComposedEdge
isInOrOut2(Node *nodeToTest) constINTERP_KERNEL::ComposedEdge
isNodeIn(Node *n) constINTERP_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) constINTERP_KERNEL::ComposedEdge
performLocatingOperation(QuadraticPolygon &pol2) constINTERP_KERNEL::QuadraticPolygon
performLocatingOperationSlow(QuadraticPolygon &pol2) constINTERP_KERNEL::QuadraticPolygon
presenceOfOn() constINTERP_KERNEL::ComposedEdge
presenceOfQuadraticEdge() constINTERP_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() constINTERP_KERNEL::ComposedEdge
resize(int i)INTERP_KERNEL::ComposedEdge
reverse()INTERP_KERNEL::ComposedEdge
setValueAt(int i, Edge *e, bool direction=true)INTERP_KERNEL::ComposedEdge
size() constINTERP_KERNEL::ComposedEdge
SoftDelete(ComposedEdge *pt)INTERP_KERNEL::ComposedEdgestatic
splitAbs(QuadraticPolygon &other, const std::map< INTERP_KERNEL::Node *, mcIdType > &mapThis, const std::map< INTERP_KERNEL::Node *, mcIdType > &mapOther, mcIdType offset1, mcIdType offset2, const std::vector< mcIdType > &otherEdgeIds, std::vector< mcIdType > &edgesThis, mcIdType cellIdThis, std::vector< std::vector< mcIdType > > &edgesInOtherColinearWithThis, std::vector< std::vector< mcIdType > > &subDivOther, std::vector< double > &addCoo, std::map< mcIdType, mcIdType > &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) constINTERP_KERNEL::ComposedEdge
unApplySimilarityOnMyEdgesIfNotAlreadyHit(double xBary, double yBary, double dimChar) constINTERP_KERNEL::ComposedEdge
unApplySimilarityOnMyNodes(double xBary, double yBary, double dimChar) constINTERP_KERNEL::ComposedEdge
unApplySimilarityOnMyNodesIfNotAlreadyHit(double xBary, double yBary, double dimChar) constINTERP_KERNEL::ComposedEdge
updateLocOfEdgeFromCrudeDataArray2(const mcIdType *descBg, const mcIdType *descEnd, const std::vector< std::vector< mcIdType > > &intersectEdges, const INTERP_KERNEL::QuadraticPolygon &pol1, const mcIdType *descBg1, const mcIdType *descEnd1, const std::vector< std::vector< mcIdType > > &intersectEdges1, const std::vector< std::vector< mcIdType > > &colinear1) constINTERP_KERNEL::QuadraticPolygon
UpdateNeighbours(const MergePoints &merger, IteratorOnComposedEdge it1, IteratorOnComposedEdge it2, const EDGES *e1, const EDGES *e2)INTERP_KERNEL::QuadraticPolygonprotectedstatic
zipConsecutiveInSegments() constINTERP_KERNEL::QuadraticPolygonprotected
~ComposedEdge()INTERP_KERNEL::ComposedEdgeprotected
~QuadraticPolygon()INTERP_KERNEL::QuadraticPolygon