|
MeshLib Python Docs
|
|
MeshLib Python Docs
|
Static Protected Member Functions | |
| _pybind11_conduit_v1_ (*args, **kwargs) | |
Generated from: MR::PointCloud \\ingroup PointCloudGroup
| None mrmeshpy.PointCloud.__init__ | ( | self | ) |
Implicit default constructor.
| None mrmeshpy.PointCloud.__init__ | ( | self, | |
| PointCloud | arg0 ) |
Implicit copy constructor.
|
staticprotected |
| None mrmeshpy.PointCloud.addPartByMask | ( | self, | |
| PointCloud | from_, | ||
| VertBitSet | fromVerts, | ||
| CloudPartMapping | outMap = '{}', | ||
| 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 with normal and returns its VertId
| int mrmeshpy.PointCloud.calcNumValidPoints | ( | self | ) |
computes the total number of valid points in the cloud
| Box3f 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 mrmeshpy.PointCloud.findCenterFromBBox | ( | self | ) |
computes bounding box and returns its center
| Vector3f mrmeshpy.PointCloud.findCenterFromPoints | ( | self | ) |
computes average position of all valid points
| None mrmeshpy.PointCloud.flipOrientation | ( | self, | |
| VertBitSet | region = None ) |
flip orientation (normals) of given points (or all valid points is nullptr)
| AABBTreePoints 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 mrmeshpy.PointCloud.getAABBTreeNotCreate | ( | self | ) |
returns cached aabb-tree for this point cloud, but does not create it if it did not exist
| Box3f mrmeshpy.PointCloud.getBoundingBox | ( | self | ) |
returns the minimal bounding box containing all valid vertices (implemented via getAABBTree())
| std_vector_Id_VertTag mrmeshpy.PointCloud.getLexicographicalOrder | ( | self | ) |
returns all valid point ids sorted lexicographically by their coordinates (optimal for uniform sampling)
| VertBitSet 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 mrmeshpy.PointCloud.hasNormals | ( | self | ) |
returns true if there is a normal for each point
| int mrmeshpy.PointCloud.heapBytes | ( | self | ) |
returns the amount of memory this object occupies on heap
| None mrmeshpy.PointCloud.invalidateCaches | ( | self | ) |
Invalidates caches (e.g. aabb-tree) after a change in point cloud
| None mrmeshpy.PointCloud.mirror | ( | self, | |
| Plane3f | plane ) |
reflects the points from a given plane
| VertCoords mrmeshpy.PointCloud.normals | ( | self | ) |
unit normal directions of points (can be empty if no normals are known)
| None 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 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 mrmeshpy.PointCloud.points | ( | self | ) |
coordinates of points
| None mrmeshpy.PointCloud.points | ( | self, | |
| VertCoords | arg1 ) |
| VertBitSet mrmeshpy.PointCloud.validPoints | ( | self | ) |
only points and normals corresponding to set bits here are valid
| None mrmeshpy.PointCloud.validPoints | ( | self, | |
| VertBitSet | arg1 ) |
1.11.0