Generated from: MR::PolylineTopology topology of one or several polylines (how line segments are connected in lines) common for 2D and 3D polylines
| mrmeshpy.ConstPolylineTopology.__init__ | ( | self, | |
| * | args, | ||
| ** | kwargs ) |
__init__(*args, **kwargs) Overloaded function. 1. __init__(self: meshlib.mrmeshpy.ConstPolylineTopology) -> None 2. __init__(self: meshlib.mrmeshpy.ConstPolylineTopology, arg0: meshlib.mrmeshpy.ConstPolylineTopology) -> None Implicit copy constructor. 3. __init__(self: meshlib.mrmeshpy.ConstPolylineTopology, : meshlib.mrmeshpy.ConstPolylineTopology) -> None
| bool mrmeshpy.ConstPolylineTopology.__eq__ | ( | self, | |
| ConstPolylineTopology | b ) |
comparison via edges (all other members are considered as not important caches)
| bool mrmeshpy.ConstPolylineTopology.__ne__ | ( | self, | |
| ConstPolylineTopology | b ) |
| bool mrmeshpy.ConstPolylineTopology.checkValidity | ( | self | ) |
verifies that all internal data structures are valid
| int mrmeshpy.ConstPolylineTopology.computeNotLoneUndirectedEdges | ( | self | ) |
computes the number of not-lone (valid) undirected edges
| VertId mrmeshpy.ConstPolylineTopology.dest | ( | self, | |
| ConstEdgeId | he ) |
returns destination vertex of half-edge
| int mrmeshpy.ConstPolylineTopology.edgeCapacity | ( | self | ) |
returns the number of allocated edge records
| ConstVector_EdgeId_VertId mrmeshpy.ConstPolylineTopology.edgePerVertex | ( | self | ) |
for all valid vertices this vector contains an edge with the origin there
| int mrmeshpy.ConstPolylineTopology.edgeSize | ( | self | ) |
returns the number of half-edge records including lone ones
| EdgeId mrmeshpy.ConstPolylineTopology.edgeWithOrg | ( | self, | |
| ConstVertId | a ) |
returns valid edge if given vertex is present in the mesh
| EdgeId mrmeshpy.ConstPolylineTopology.findEdge | ( | self, | |
| ConstVertId | o, | ||
| ConstVertId | d ) |
finds and returns edge from o to d in the mesh; returns invalid edge otherwise
| Vector_VertId_EdgeId mrmeshpy.ConstPolylineTopology.getOrgs | ( | self | ) |
for all edges this vector contains its origin
| VertBitSet mrmeshpy.ConstPolylineTopology.getPathVertices | ( | self, | |
| Const_std_vector_Id_EdgeTag | path ) |
returns all vertices incident to path edges
| ConstVertBitSet mrmeshpy.ConstPolylineTopology.getValidVerts | ( | self | ) |
returns cached set of all valid vertices
| int mrmeshpy.ConstPolylineTopology.getVertDegree | ( | self, | |
| ConstVertId | a ) |
returns 0 if given vertex does not exist, 1 if it has one incident edge, and 2 if it has two incident edges
| ConstVertBitSet mrmeshpy.ConstPolylineTopology.getVertIds | ( | self, | |
| ConstVertBitSet | region ) |
if region pointer is not null then converts it in reference, otherwise returns all valid vertices in the mesh
| bool mrmeshpy.ConstPolylineTopology.hasEdge | ( | self, | |
| ConstEdgeId | e ) |
returns true if given edge is within valid range and not-lone
| bool mrmeshpy.ConstPolylineTopology.hasVert | ( | self, | |
| ConstVertId | a ) |
returns true if given vertex is present in the mesh
| int mrmeshpy.ConstPolylineTopology.heapBytes | ( | self | ) |
returns the amount of memory this object occupies on heap
| bool mrmeshpy.ConstPolylineTopology.isClosed | ( | self | ) |
returns true if the polyline does not have any holes
| bool mrmeshpy.ConstPolylineTopology.isConsistentlyOriented | ( | self | ) |
returns true if for each edge e: e == e.next() || e.odd() == next( e ).sym().odd()
| bool mrmeshpy.ConstPolylineTopology.isLoneEdge | ( | self, | |
| ConstEdgeId | a ) |
checks whether the edge is disconnected from all other edges and disassociated from all vertices (as if after makeEdge)
| EdgeId mrmeshpy.ConstPolylineTopology.lastNotLoneEdge | ( | self | ) |
returns last not lone edge id, or invalid id if no such edge exists
| UndirectedEdgeId mrmeshpy.ConstPolylineTopology.lastNotLoneUndirectedEdge | ( | self | ) |
returns last not lone undirected edge id, or invalid id if no such edge exists
| VertId mrmeshpy.ConstPolylineTopology.lastValidVert | ( | self | ) |
returns last valid vertex id, or invalid id if no single valid vertex exists
| EdgeId mrmeshpy.ConstPolylineTopology.next | ( | self, | |
| ConstEdgeId | he ) |
next (counter clock wise) half-edge in the origin ring
| int mrmeshpy.ConstPolylineTopology.numValidVerts | ( | self | ) |
returns the number of valid vertices
| VertId mrmeshpy.ConstPolylineTopology.org | ( | self, | |
| ConstEdgeId | he ) |
returns origin vertex of half-edge
| int mrmeshpy.ConstPolylineTopology.undirectedEdgeCapacity | ( | self | ) |
returns the number of allocated undirected edges (pairs of half-edges)
| int mrmeshpy.ConstPolylineTopology.undirectedEdgeSize | ( | self | ) |
returns the number of undirected edges (pairs of half-edges) including lone ones
| int mrmeshpy.ConstPolylineTopology.vertCapacity | ( | self | ) |
returns the number of allocated vert records
| int mrmeshpy.ConstPolylineTopology.vertSize | ( | self | ) |
returns the number of vertex records including invalid ones
| None mrmeshpy.ConstPolylineTopology.write | ( | self, | |
| typing.Any | s ) |
saves this in binary stream