Generated from: MR::PointCloud \\ingroup PointCloudGroup
None meshlib.mrmeshpy.PointCloud.__init__ | ( | self | ) |
Implicit default constructor.
None meshlib.mrmeshpy.PointCloud.__init__ | ( | self, | |
PointCloud | arg0 ) |
Implicit copy constructor.
None meshlib.mrmeshpy.PointCloud.addPartByMask | ( | self, | |
PointCloud | from_, | ||
VertBitSet | fromVerts, | ||
CloudPartMapping | outMap = 'MR::CloudPartMapping{}', | ||
VertCoords | extNormals = None ) |
appends points (and normals if it possible) (from) in addition to this points if this obj have normals and from obj has not it then don't do anything \\param extNormals if given then they will be copied instead of from.normals
appends a point and returns its VertId
appends a point with normal and returns its VertId
int meshlib.mrmeshpy.PointCloud.calcNumValidPoints | ( | self | ) |
computes the total number of valid points in the cloud
Box3f meshlib.mrmeshpy.PointCloud.computeBoundingBox | ( | self, | |
AffineXf3f | toWorld = None ) |
passes through all valid points and finds the minimal bounding box containing all of them; if toWorld transformation is given then returns minimal bounding box in world space
Vector3f meshlib.mrmeshpy.PointCloud.findCenterFromBBox | ( | self | ) |
computes bounding box and returns its center
Vector3f meshlib.mrmeshpy.PointCloud.findCenterFromPoints | ( | self | ) |
computes average position of all valid points
None meshlib.mrmeshpy.PointCloud.flipOrientation | ( | self, | |
VertBitSet | region = None ) |
flip orientation (normals) of given points (or all valid points is nullptr)
AABBTreePoints meshlib.mrmeshpy.PointCloud.getAABBTree | ( | self | ) |
returns cached aabb-tree for this point cloud, creating it if it did not exist in a thread-safe manner
AABBTreePoints meshlib.mrmeshpy.PointCloud.getAABBTreeNotCreate | ( | self | ) |
returns cached aabb-tree for this point cloud, but does not create it if it did not exist
Box3f meshlib.mrmeshpy.PointCloud.getBoundingBox | ( | self | ) |
returns the minimal bounding box containing all valid vertices (implemented via getAABBTree())
std_vector_Id_VertTag meshlib.mrmeshpy.PointCloud.getLexicographicalOrder | ( | self | ) |
returns all valid point ids sorted lexicographically by their coordinates (optimal for uniform sampling)
VertBitSet meshlib.mrmeshpy.PointCloud.getVertIds | ( | self, | |
VertBitSet | region ) |
if region pointer is not null then converts it in reference, otherwise returns all valid points in the cloud
bool meshlib.mrmeshpy.PointCloud.hasNormals | ( | self | ) |
returns true if there is a normal for each point
int meshlib.mrmeshpy.PointCloud.heapBytes | ( | self | ) |
returns the amount of memory this object occupies on heap
None meshlib.mrmeshpy.PointCloud.invalidateCaches | ( | self | ) |
Invalidates caches (e.g. aabb-tree) after a change in point cloud
None meshlib.mrmeshpy.PointCloud.mirror | ( | self, | |
Plane3f | plane ) |
reflects the points from a given plane
VertCoords meshlib.mrmeshpy.PointCloud.normals | ( | self | ) |
unit normal directions of points (can be empty if no normals are known)
None meshlib.mrmeshpy.PointCloud.normals | ( | self, | |
VertCoords | arg1 ) |
tightly packs all arrays eliminating invalid points, reorders valid points according to given strategy; \\return points mapping: old -> new
bool meshlib.mrmeshpy.PointCloud.pack | ( | self, | |
VertMap | outNew2Old = None ) |
tightly packs all arrays eliminating invalid points, but relative order of valid points is preserved; returns false if the cloud was packed before the call and nothing has been changed; if pack is done optionally returns mappings: new.id -> old.id
VertCoords meshlib.mrmeshpy.PointCloud.points | ( | self | ) |
coordinates of points
None meshlib.mrmeshpy.PointCloud.points | ( | self, | |
VertCoords | arg1 ) |
VertBitSet meshlib.mrmeshpy.PointCloud.validPoints | ( | self | ) |
only points and normals corresponding to set bits here are valid
None meshlib.mrmeshpy.PointCloud.validPoints | ( | self, | |
VertBitSet | arg1 ) |