MeshLib Python Docs
Loading...
Searching...
No Matches
mrmeshpy.ConstMeshTopology Class Reference
Inheritance diagram for mrmeshpy.ConstMeshTopology:

Public Member Functions

bool __eq__ (self, ConstMeshTopology b)
 __init__ (self, *args, **kwargs)
bool __ne__ (self, ConstMeshTopology b)
EdgeId bdEdgeSameLeft (self, ConstEdgeId e, ConstFaceBitSet region=None)
EdgeId bdEdgeSameOrigin (self, ConstEdgeId e, ConstFaceBitSet region=None)
EdgeId bdEdgeWithLeft (self, ConstFaceId f, ConstFaceBitSet region=None)
EdgeId bdEdgeWithOrigin (self, ConstVertId v, ConstFaceBitSet region=None)
bool checkValidity (self, Const_func_bool_from_float cb='{}', bool allVerts=True)
int computeNotLoneUndirectedEdges (self)
VertId dest (self, ConstEdgeId he)
int edgeCapacity (self)
ConstVector_EdgeId_FaceId edgePerFace (self)
ConstVector_EdgeId_VertId edgePerVertex (self)
int edgeSize (self)
EdgeId edgeWithLeft (self, ConstFaceId a)
EdgeId edgeWithOrg (self, ConstVertId a)
None excludeLoneEdges (self, UndirectedEdgeBitSet edges)
int faceCapacity (self)
int faceSize (self)
FaceBitSet findBdFaces (self, ConstFaceBitSet region=None)
VertBitSet findBdVerts (self, ConstFaceBitSet region=None, ConstVertBitSet test=None)
EdgeId findEdge (self, ConstVertId o, ConstVertId d)
std_vector_Id_EdgeTag findHoleRepresentiveEdges (self, ConstFaceBitSet region=None)
EdgeBitSet findLeftBdEdges (self, ConstFaceBitSet region=None, ConstEdgeBitSet test=None)
UndirectedEdgeBitSet findNotLoneUndirectedEdges (self)
int findNumHoles (self, EdgeBitSet holeRepresentativeEdges=None)
None flip (self, VertBitSet vs)
None flip (self, FaceBitSet fs)
bool fromSameLeftRing (self, ConstEdgeId a, ConstEdgeId b)
bool fromSameOriginRing (self, ConstEdgeId a, ConstEdgeId b)
std_vector_std_array_Id_VertTag_3ul getAllTriVerts (self)
int getFaceDegree (self, ConstFaceId f)
ConstFaceBitSet getFaceIds (self, ConstFaceBitSet region)
int getLeftDegree (self, ConstEdgeId a)
std_vector_Id_EdgeTag getLeftRing (self, ConstEdgeId e)
std_vector_std_vector_Id_EdgeTag getLeftRings (self, Const_std_vector_Id_EdgeTag es)
None getLeftTriEdges (self, ConstEdgeId e0, EdgeId e1, EdgeId e2)
None getLeftTriVerts (self, ConstEdgeId a, VertId v0, VertId v1, VertId v2)
None getLeftTriVerts (self, ConstEdgeId a, std_array_Id_VertTag_3 v)
std_array_Id_VertTag_3 getLeftTriVerts (self, ConstEdgeId a)
int getOrgDegree (self, ConstEdgeId a)
FaceBitSet getPathLeftFaces (self, Const_std_vector_Id_EdgeTag path)
FaceBitSet getPathRightFaces (self, Const_std_vector_Id_EdgeTag path)
VertBitSet getPathVertices (self, Const_std_vector_Id_EdgeTag path)
None getTriEdges (self, ConstFaceId f, EdgeId e0, EdgeId e1, EdgeId e2)
None getTriVerts (self, ConstFaceId f, VertId v0, VertId v1, VertId v2)
None getTriVerts (self, ConstFaceId f, std_array_Id_VertTag_3 v)
std_array_Id_VertTag_3 getTriVerts (self, ConstFaceId f)
Triangulation getTriangulation (self)
ConstFaceBitSet getValidFaces (self)
ConstVertBitSet getValidVerts (self)
int getVertDegree (self, ConstVertId v)
ConstVertBitSet getVertIds (self, ConstVertBitSet region)
bool hasEdge (self, ConstEdgeId e)
bool hasFace (self, ConstFaceId a)
bool hasVert (self, ConstVertId a)
int heapBytes (self)
bool isBdEdge (self, ConstEdgeId e, ConstFaceBitSet region=None)
bool isBdFace (self, ConstFaceId f, ConstFaceBitSet region=None)
bool isBdVertex (self, ConstVertId v, ConstFaceBitSet region=None)
bool isBdVertexInOrg (self, ConstEdgeId e, ConstFaceBitSet region=None)
bool isClosed (self, ConstFaceBitSet region=None)
bool isInnerEdge (self, ConstEdgeId e, ConstFaceBitSet region=None)
bool isInnerOrBdEdge (self, ConstEdgeId e, ConstFaceBitSet region=None)
bool isInnerOrBdVertex (self, ConstVertId v, ConstFaceBitSet region=None)
bool isLeftBdEdge (self, ConstEdgeId e, ConstFaceBitSet region=None)
bool isLeftBdFace (self, ConstEdgeId e, ConstFaceBitSet region=None)
bool isLeftInRegion (self, ConstEdgeId e, ConstFaceBitSet region=None)
bool isLeftQuad (self, ConstEdgeId a)
bool isLeftTri (self, ConstEdgeId a)
bool isLoneEdge (self, ConstEdgeId a)
bool isOrgInnerAndHasDegree (self, ConstEdgeId a, int d)
bool isTriVert (self, ConstFaceId f, ConstVertId v)
bool isVertInnerAndHasDegree (self, ConstVertId v, int d)
EdgeId lastNotLoneEdge (self)
UndirectedEdgeId lastNotLoneUndirectedEdge (self)
FaceId lastValidFace (self)
VertId lastValidVert (self)
FaceId left (self, ConstEdgeId he)
EdgeId next (self, ConstEdgeId he)
EdgeId nextLeftBd (self, ConstEdgeId e, ConstFaceBitSet region=None, Turn turn='MR::Turn::Rightmost')
int numValidFaces (self)
int numValidVerts (self)
VertId org (self, ConstEdgeId he)
EdgeId prev (self, ConstEdgeId he)
EdgeId prevLeftBd (self, ConstEdgeId e, ConstFaceBitSet region=None, Turn turn='MR::Turn::Rightmost')
FaceId right (self, ConstEdgeId he)
EdgeId sharedEdge (self, ConstFaceId l, ConstFaceId r)
FaceId sharedFace (self, ConstEdgeId a, ConstEdgeId b)
EdgeId sharedVertInOrg (self, ConstEdgeId a, ConstEdgeId b)
EdgeId sharedVertInOrg (self, ConstFaceId l, ConstFaceId r)
int undirectedEdgeCapacity (self)
int undirectedEdgeSize (self)
bool updatingValids (self)
int vertCapacity (self)
int vertSize (self)
None write (self, typing.Any s)

Detailed Description

Generated from:  MR::MeshTopology

Mesh Topology

Constructor & Destructor Documentation

◆ __init__()

mrmeshpy.ConstMeshTopology.__init__ ( self,
* args,
** kwargs )
__init__(*args, **kwargs)
Overloaded function.

1. __init__(self: meshlib.mrmeshpy.ConstMeshTopology) -> None

2. __init__(self: meshlib.mrmeshpy.ConstMeshTopology, arg0: meshlib.mrmeshpy.ConstMeshTopology) -> None

Implicit copy constructor.

3. __init__(self: meshlib.mrmeshpy.ConstMeshTopology, : meshlib.mrmeshpy.ConstMeshTopology) -> None

Member Function Documentation

◆ __eq__()

bool mrmeshpy.ConstMeshTopology.__eq__ ( self,
ConstMeshTopology b )
compare that two topologies are exactly the same

◆ __ne__()

bool mrmeshpy.ConstMeshTopology.__ne__ ( self,
ConstMeshTopology b )
compare that two topologies are exactly the same

◆ bdEdgeSameLeft()

EdgeId mrmeshpy.ConstMeshTopology.bdEdgeSameLeft ( self,
ConstEdgeId e,
ConstFaceBitSet region = None )
returns the first boundary edge (for given region or for whole mesh if region is nullptr) in counter-clockwise order starting from given edge with the same left face or hole;
returns invalid edge if no boundary edge is found

◆ bdEdgeSameOrigin()

EdgeId mrmeshpy.ConstMeshTopology.bdEdgeSameOrigin ( self,
ConstEdgeId e,
ConstFaceBitSet region = None )
returns the first boundary edge (for given region or for whole mesh if region is nullptr) in counter-clockwise order starting from given edge with the same origin;
returns invalid edge if no boundary edge is found

◆ bdEdgeWithLeft()

EdgeId mrmeshpy.ConstMeshTopology.bdEdgeWithLeft ( self,
ConstFaceId f,
ConstFaceBitSet region = None )
returns a boundary edge with given left face considering boundary of given region (or for whole mesh if region is nullptr);
returns invalid edge if no boundary edge is found

◆ bdEdgeWithOrigin()

EdgeId mrmeshpy.ConstMeshTopology.bdEdgeWithOrigin ( self,
ConstVertId v,
ConstFaceBitSet region = None )
returns a boundary edge with given vertex in origin considering boundary of given region (or for whole mesh if region is nullptr);
returns invalid edge if no boundary edge is found

◆ checkValidity()

bool mrmeshpy.ConstMeshTopology.checkValidity ( self,
Const_func_bool_from_float cb = '{}',
bool allVerts = True )
verifies that all internal data structures are valid;
if allVerts=true then checks in addition that all not-lone edges have valid vertices on both ends

◆ computeNotLoneUndirectedEdges()

int mrmeshpy.ConstMeshTopology.computeNotLoneUndirectedEdges ( self)
computes the number of not-lone (valid) undirected edges

◆ dest()

VertId mrmeshpy.ConstMeshTopology.dest ( self,
ConstEdgeId he )
returns destination vertex of half-edge

◆ edgeCapacity()

int mrmeshpy.ConstMeshTopology.edgeCapacity ( self)
returns the number of allocated edge records

◆ edgePerFace()

ConstVector_EdgeId_FaceId mrmeshpy.ConstMeshTopology.edgePerFace ( self)
for all valid faces this vector contains an edge with that face at left

◆ edgePerVertex()

ConstVector_EdgeId_VertId mrmeshpy.ConstMeshTopology.edgePerVertex ( self)
for all valid vertices this vector contains an edge with the origin there

◆ edgeSize()

int mrmeshpy.ConstMeshTopology.edgeSize ( self)
returns the number of half-edge records including lone ones

◆ edgeWithLeft()

EdgeId mrmeshpy.ConstMeshTopology.edgeWithLeft ( self,
ConstFaceId a )
returns valid edge if given vertex is present in the mesh

◆ edgeWithOrg()

EdgeId mrmeshpy.ConstMeshTopology.edgeWithOrg ( self,
ConstVertId a )
returns valid edge if given vertex is present in the mesh

◆ excludeLoneEdges()

None mrmeshpy.ConstMeshTopology.excludeLoneEdges ( self,
UndirectedEdgeBitSet edges )
remove all lone edges from given set

◆ faceCapacity()

int mrmeshpy.ConstMeshTopology.faceCapacity ( self)
returns the number of allocated face records

◆ faceSize()

int mrmeshpy.ConstMeshTopology.faceSize ( self)
returns the number of face records including invalid ones

◆ findBdFaces()

FaceBitSet mrmeshpy.ConstMeshTopology.findBdFaces ( self,
ConstFaceBitSet region = None )
returns all faces for which isBdFace(f, region) is true

◆ findBdVerts()

VertBitSet mrmeshpy.ConstMeshTopology.findBdVerts ( self,
ConstFaceBitSet region = None,
ConstVertBitSet test = None )
returns all (test) vertices for which isBdVertex(v, region) is true

◆ findEdge()

EdgeId mrmeshpy.ConstMeshTopology.findEdge ( self,
ConstVertId o,
ConstVertId d )
finds and returns edge from o to d in the mesh; returns invalid edge otherwise

◆ findHoleRepresentiveEdges()

std_vector_Id_EdgeTag mrmeshpy.ConstMeshTopology.findHoleRepresentiveEdges ( self,
ConstFaceBitSet region = None )
returns one edge with no valid left face for every boundary in the mesh;
if region is given, then returned edges must have valid right faces from the region

◆ findLeftBdEdges()

EdgeBitSet mrmeshpy.ConstMeshTopology.findLeftBdEdges ( self,
ConstFaceBitSet region = None,
ConstEdgeBitSet test = None )
returns all (test) edges for which left(e) does not belong to the region and isBdEdge(e, region) is true

◆ findNotLoneUndirectedEdges()

UndirectedEdgeBitSet mrmeshpy.ConstMeshTopology.findNotLoneUndirectedEdges ( self)
finds and returns all not-lone (valid) undirected edges

◆ findNumHoles()

int mrmeshpy.ConstMeshTopology.findNumHoles ( self,
EdgeBitSet holeRepresentativeEdges = None )
returns the number of hole loops in the mesh;
\\param holeRepresentativeEdges optional output of the smallest edge id with no valid left face in every hole

◆ flip() [1/2]

None mrmeshpy.ConstMeshTopology.flip ( self,
FaceBitSet fs )
sets in (fs) all valid faces that were not selected before the call, and resets other bits

◆ flip() [2/2]

None mrmeshpy.ConstMeshTopology.flip ( self,
VertBitSet vs )
sets in (vs) all valid vertices that were not selected before the call, and resets other bits

◆ fromSameLeftRing()

bool mrmeshpy.ConstMeshTopology.fromSameLeftRing ( self,
ConstEdgeId a,
ConstEdgeId b )
returns true if a and b are both from the same left face ring

◆ fromSameOriginRing()

bool mrmeshpy.ConstMeshTopology.fromSameOriginRing ( self,
ConstEdgeId a,
ConstEdgeId b )
returns true if a and b are both from the same origin ring

◆ getAllTriVerts()

std_vector_std_array_Id_VertTag_3ul mrmeshpy.ConstMeshTopology.getAllTriVerts ( self)
returns three vertex ids for valid triangles, invalid triangles are skipped

◆ getFaceDegree()

int mrmeshpy.ConstMeshTopology.getFaceDegree ( self,
ConstFaceId f )
returns the number of edges around the given face: 3 for triangular faces, ...

◆ getFaceIds()

ConstFaceBitSet mrmeshpy.ConstMeshTopology.getFaceIds ( self,
ConstFaceBitSet region )
if region pointer is not null then converts it in reference, otherwise returns all valid faces in the mesh

◆ getLeftDegree()

int mrmeshpy.ConstMeshTopology.getLeftDegree ( self,
ConstEdgeId a )
returns the number of edges around the left face: 3 for triangular faces, ...

◆ getLeftRing()

std_vector_Id_EdgeTag mrmeshpy.ConstMeshTopology.getLeftRing ( self,
ConstEdgeId e )
returns full edge-loop of left face from (e) starting from (e) itself

◆ getLeftRings()

std_vector_std_vector_Id_EdgeTag mrmeshpy.ConstMeshTopology.getLeftRings ( self,
Const_std_vector_Id_EdgeTag es )
returns full edge-loops of left faces from every edge in (es);
each edge-loop will be returned only once even if some faces are represented by more than one edge in (es)

◆ getLeftTriEdges()

None mrmeshpy.ConstMeshTopology.getLeftTriEdges ( self,
ConstEdgeId e0,
EdgeId e1,
EdgeId e2 )
given one edge with triangular face on the left;
returns two other edges of the same face, oriented to have this face on the left;
the edges are returned in counter-clockwise order if look from mesh outside

◆ getLeftTriVerts() [1/3]

std_array_Id_VertTag_3 mrmeshpy.ConstMeshTopology.getLeftTriVerts ( self,
ConstEdgeId a )

◆ getLeftTriVerts() [2/3]

None mrmeshpy.ConstMeshTopology.getLeftTriVerts ( self,
ConstEdgeId a,
std_array_Id_VertTag_3 v )

◆ getLeftTriVerts() [3/3]

None mrmeshpy.ConstMeshTopology.getLeftTriVerts ( self,
ConstEdgeId a,
VertId v0,
VertId v1,
VertId v2 )
gets 3 vertices of the left face ( face-id may not exist, but the shape must be triangular)
the vertices are returned in counter-clockwise order if look from mesh outside: v0 = org( a ), v1 = dest( a )

◆ getOrgDegree()

int mrmeshpy.ConstMeshTopology.getOrgDegree ( self,
ConstEdgeId a )
returns the number of edges around the origin vertex, returns 1 for lone edges

◆ getPathLeftFaces()

FaceBitSet mrmeshpy.ConstMeshTopology.getPathLeftFaces ( self,
Const_std_vector_Id_EdgeTag path )
returns all valid left faces of path edges

◆ getPathRightFaces()

FaceBitSet mrmeshpy.ConstMeshTopology.getPathRightFaces ( self,
Const_std_vector_Id_EdgeTag path )
returns all valid right faces of path edges

◆ getPathVertices()

VertBitSet mrmeshpy.ConstMeshTopology.getPathVertices ( self,
Const_std_vector_Id_EdgeTag path )
returns all vertices incident to path edges

◆ getTriangulation()

Triangulation mrmeshpy.ConstMeshTopology.getTriangulation ( self)
returns three vertex ids for valid triangles (which can be accessed by FaceId),
vertex ids for invalid triangles are undefined, and shall not be read

◆ getTriEdges()

None mrmeshpy.ConstMeshTopology.getTriEdges ( self,
ConstFaceId f,
EdgeId e0,
EdgeId e1,
EdgeId e2 )
gets 3 edges of given triangular face, oriented to have it on the left;
the edges are returned in counter-clockwise order if look from mesh outside

◆ getTriVerts() [1/3]

std_array_Id_VertTag_3 mrmeshpy.ConstMeshTopology.getTriVerts ( self,
ConstFaceId f )

◆ getTriVerts() [2/3]

None mrmeshpy.ConstMeshTopology.getTriVerts ( self,
ConstFaceId f,
std_array_Id_VertTag_3 v )

◆ getTriVerts() [3/3]

None mrmeshpy.ConstMeshTopology.getTriVerts ( self,
ConstFaceId f,
VertId v0,
VertId v1,
VertId v2 )
gets 3 vertices of given triangular face;
the vertices are returned in counter-clockwise order if look from mesh outside

◆ getValidFaces()

ConstFaceBitSet mrmeshpy.ConstMeshTopology.getValidFaces ( self)
returns cached set of all valid faces

◆ getValidVerts()

ConstVertBitSet mrmeshpy.ConstMeshTopology.getValidVerts ( self)
returns cached set of all valid vertices

◆ getVertDegree()

int mrmeshpy.ConstMeshTopology.getVertDegree ( self,
ConstVertId v )
returns the number of edges around the given vertex

◆ getVertIds()

ConstVertBitSet mrmeshpy.ConstMeshTopology.getVertIds ( self,
ConstVertBitSet region )
if region pointer is not null then converts it in reference, otherwise returns all valid vertices in the mesh

◆ hasEdge()

bool mrmeshpy.ConstMeshTopology.hasEdge ( self,
ConstEdgeId e )
returns true if given edge is within valid range and not-lone

◆ hasFace()

bool mrmeshpy.ConstMeshTopology.hasFace ( self,
ConstFaceId a )
returns true if given face is present in the mesh

◆ hasVert()

bool mrmeshpy.ConstMeshTopology.hasVert ( self,
ConstVertId a )
returns true if given vertex is present in the mesh

◆ heapBytes()

int mrmeshpy.ConstMeshTopology.heapBytes ( self)
returns the amount of memory this object occupies on heap

◆ isBdEdge()

bool mrmeshpy.ConstMeshTopology.isBdEdge ( self,
ConstEdgeId e,
ConstFaceBitSet region = None )
isBdEdge(e) returns true, if the edge (e) is a boundary edge of the mesh:
    (e) has a hole from one or both sides.
isBdEdge(e, region) returns true, if the edge (e) is a boundary edge of the given region:
    (e) has a region's face from one side (region.test(f0)==true) and a hole or not-region face from the other side (!f1 || region.test(f1)==false).
If the region contains all faces of the mesh then isBdEdge(e) is the union of isBdEdge(e, region) and not-lone edges without both left and right faces.

◆ isBdFace()

bool mrmeshpy.ConstMeshTopology.isBdFace ( self,
ConstFaceId f,
ConstFaceBitSet region = None )
returns true if given face belongs to the region and it has a boundary edge (isBdEdge(e,region) == true)

◆ isBdVertex()

bool mrmeshpy.ConstMeshTopology.isBdVertex ( self,
ConstVertId v,
ConstFaceBitSet region = None )
returns true if given vertex is on (region) boundary

◆ isBdVertexInOrg()

bool mrmeshpy.ConstMeshTopology.isBdVertexInOrg ( self,
ConstEdgeId e,
ConstFaceBitSet region = None )
returns true if edge's origin is on (region) boundary

◆ isClosed()

bool mrmeshpy.ConstMeshTopology.isClosed ( self,
ConstFaceBitSet region = None )
returns true if the mesh (region) does not have any neighboring holes

◆ isInnerEdge()

bool mrmeshpy.ConstMeshTopology.isInnerEdge ( self,
ConstEdgeId e,
ConstFaceBitSet region = None )
return true if given edge is inner for given region (or for whole mesh if region is nullptr)

◆ isInnerOrBdEdge()

bool mrmeshpy.ConstMeshTopology.isInnerOrBdEdge ( self,
ConstEdgeId e,
ConstFaceBitSet region = None )
return true if given edge is inner or boundary for given region (or for whole mesh if region is nullptr), returns false for lone edges

◆ isInnerOrBdVertex()

bool mrmeshpy.ConstMeshTopology.isInnerOrBdVertex ( self,
ConstVertId v,
ConstFaceBitSet region = None )
returns true if one of incident faces of given vertex pertain to given region (or any such face exists if region is nullptr)

◆ isLeftBdEdge()

bool mrmeshpy.ConstMeshTopology.isLeftBdEdge ( self,
ConstEdgeId e,
ConstFaceBitSet region = None )
returns true if left face of given edge belongs to given region (if provided) and right face either does not exist or does not belong

◆ isLeftBdFace()

bool mrmeshpy.ConstMeshTopology.isLeftBdFace ( self,
ConstEdgeId e,
ConstFaceBitSet region = None )
returns true if left(e) is a valid (region) face,
and it has a boundary edge (isBdEdge(e,region) == true)

◆ isLeftInRegion()

bool mrmeshpy.ConstMeshTopology.isLeftInRegion ( self,
ConstEdgeId e,
ConstFaceBitSet region = None )
return true if left face of given edge belongs to region (or just have valid id if region is nullptr)

◆ isLeftQuad()

bool mrmeshpy.ConstMeshTopology.isLeftQuad ( self,
ConstEdgeId a )
returns true if the cell to the left of a is quadrangular

◆ isLeftTri()

bool mrmeshpy.ConstMeshTopology.isLeftTri ( self,
ConstEdgeId a )
returns true if the cell to the left of a is triangular

◆ isLoneEdge()

bool mrmeshpy.ConstMeshTopology.isLoneEdge ( self,
ConstEdgeId a )
checks whether the edge is disconnected from all other edges and disassociated from all vertices and faces (as if after makeEdge)

◆ isOrgInnerAndHasDegree()

bool mrmeshpy.ConstMeshTopology.isOrgInnerAndHasDegree ( self,
ConstEdgeId a,
int d )
returns true if the origin of given edge is inner to the mesh (no boundary passes via it), and has the given number of incident edges (including input one)

◆ isTriVert()

bool mrmeshpy.ConstMeshTopology.isTriVert ( self,
ConstFaceId f,
ConstVertId v )
return true if triangular face (f) has (v) as one of its vertices

◆ isVertInnerAndHasDegree()

bool mrmeshpy.ConstMeshTopology.isVertInnerAndHasDegree ( self,
ConstVertId v,
int d )
returns true if the given vertex is inner to the mesh (no boundary passes via it), and has the given number of incident edges

◆ lastNotLoneEdge()

EdgeId mrmeshpy.ConstMeshTopology.lastNotLoneEdge ( self)
returns last not lone edge id, or invalid id if no such edge exists

◆ lastNotLoneUndirectedEdge()

UndirectedEdgeId mrmeshpy.ConstMeshTopology.lastNotLoneUndirectedEdge ( self)
returns last not lone undirected edge id, or invalid id if no such edge exists

◆ lastValidFace()

FaceId mrmeshpy.ConstMeshTopology.lastValidFace ( self)
returns last valid face id, or invalid id if no single valid face exists

◆ lastValidVert()

VertId mrmeshpy.ConstMeshTopology.lastValidVert ( self)
returns last valid vertex id, or invalid id if no single valid vertex exists

◆ left()

FaceId mrmeshpy.ConstMeshTopology.left ( self,
ConstEdgeId he )
returns left face of half-edge

◆ next()

EdgeId mrmeshpy.ConstMeshTopology.next ( self,
ConstEdgeId he )
next (counter clock wise) half-edge in the origin ring

◆ nextLeftBd()

EdgeId mrmeshpy.ConstMeshTopology.nextLeftBd ( self,
ConstEdgeId e,
ConstFaceBitSet region = None,
Turn turn = 'MR::Turn::Rightmost' )
given a (region) boundary edge with no right face in given region, returns next boundary edge for the same region: dest(e)==org(res);
\\param turn determines the selection of next boundary edge in case of several alternatives

◆ numValidFaces()

int mrmeshpy.ConstMeshTopology.numValidFaces ( self)
returns the number of valid faces

◆ numValidVerts()

int mrmeshpy.ConstMeshTopology.numValidVerts ( self)
returns the number of valid vertices

◆ org()

VertId mrmeshpy.ConstMeshTopology.org ( self,
ConstEdgeId he )
returns origin vertex of half-edge

◆ prev()

EdgeId mrmeshpy.ConstMeshTopology.prev ( self,
ConstEdgeId he )
previous (clock wise) half-edge in the origin ring

◆ prevLeftBd()

EdgeId mrmeshpy.ConstMeshTopology.prevLeftBd ( self,
ConstEdgeId e,
ConstFaceBitSet region = None,
Turn turn = 'MR::Turn::Rightmost' )
given a (region) boundary edge with no right face in given region, returns previous boundary edge for the same region; dest(res)==org(e);
\\param turn determines the selection of previous boundary edge in case of several alternatives, note the turn is from previous (returned) edge to the current edge

◆ right()

FaceId mrmeshpy.ConstMeshTopology.right ( self,
ConstEdgeId he )
returns right face of half-edge

◆ sharedEdge()

EdgeId mrmeshpy.ConstMeshTopology.sharedEdge ( self,
ConstFaceId l,
ConstFaceId r )
if two valid faces share the same edge then it is found and returned

◆ sharedFace()

FaceId mrmeshpy.ConstMeshTopology.sharedFace ( self,
ConstEdgeId a,
ConstEdgeId b )
if two valid edges belong to same valid face then it is found and returned

◆ sharedVertInOrg() [1/2]

EdgeId mrmeshpy.ConstMeshTopology.sharedVertInOrg ( self,
ConstEdgeId a,
ConstEdgeId b )
if two valid edges share the same vertex then it is found and returned as Edge with this vertex in origin

◆ sharedVertInOrg() [2/2]

EdgeId mrmeshpy.ConstMeshTopology.sharedVertInOrg ( self,
ConstFaceId l,
ConstFaceId r )
if two valid faces share the same vertex then it is found and returned as Edge with this vertex in origin

◆ undirectedEdgeCapacity()

int mrmeshpy.ConstMeshTopology.undirectedEdgeCapacity ( self)
returns the number of allocated undirected edges (pairs of half-edges)

◆ undirectedEdgeSize()

int mrmeshpy.ConstMeshTopology.undirectedEdgeSize ( self)
returns the number of undirected edges (pairs of half-edges) including lone ones

◆ updatingValids()

bool mrmeshpy.ConstMeshTopology.updatingValids ( self)
returns whether the methods validVerts(), validFaces(), numValidVerts(), numValidFaces() can be called

◆ vertCapacity()

int mrmeshpy.ConstMeshTopology.vertCapacity ( self)
returns the number of allocated vert records

◆ vertSize()

int mrmeshpy.ConstMeshTopology.vertSize ( self)
returns the number of vertex records including invalid ones

◆ write()

None mrmeshpy.ConstMeshTopology.write ( self,
typing.Any s )
saves in binary stream

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