Public Member Functions | |
| bool | __eq__ (self, Box3f a) |
| Vector3f | __getitem__ (self, int e) |
| Vector3f | __getitem__ (self, int e) |
| None | __init__ (self) |
| None | __init__ (self, Vector3f min, Vector3f max) |
| None | __init__ (self, Box3f a) |
| None | __init__ (self, Box3f arg0) |
| bool | __ne__ (self, Box3f a) |
| str | __repr__ (self) |
| None | __setitem__ (self, int arg0, Vector3f arg1) |
| Vector3f | center (self) |
| bool | contains (self, Vector3f pt) |
| bool | contains (self, Box3f otherbox) |
| Vector3f | corner (self, Vector3b c) |
| float | diagonal (self) |
| Box3f | expanded (self, Vector3f expansion) |
| Vector3f | getBoxClosestPointTo (self, Vector3f pt) |
| float | getDistanceSq (self, Box3f b) |
| float | getDistanceSq (self, Vector3f pt) |
| Vector3f | getProjection (self, Vector3f pt) |
| None | include (self, Vector3f pt) |
| None | include (self, Box3f b) |
| Box3f | insignificantlyExpanded (self) |
| Box3f | intersect (self, Box3f b) |
| Box3f | intersection (self, Box3f b) |
| bool | intersects (self, Box3f b) |
| Vector3f | size (self) |
| bool | valid (self) |
| float | volume (self) |
Static Public Member Functions | |
| None | __init__ (*args, **kwargs) |
| None | __init__ (*args, **kwargs) |
| Box3f | fromMinAndSize (Vector3f min, Vector3f size) |
| Vector3b | getMaxBoxCorner (Vector3f n) |
| Vector3b | getMinBoxCorner (Vector3f n) |
| Box3f | operator (*args, **kwargs) |
| Box3f | operator (*args, **kwargs) |
Static Public Attributes | |
| typing | elements = 3 |
Static Protected Attributes | |
| typing | _offsetof_max = 12 |
| typing | _offsetof_min = 0 |
Generated from: MR::Box3f Aliases: AABBTreeTraits_UndirectedEdgeTag_Box3f.BoxT, AABBTreeNode_ObjTreeTraits.BoxT, AABBTreeNode_AABBTreeTraits_FaceTag_Box3f.BoxT, AABBTreeBase_ObjTreeTraits.BoxT, AABBTreeBase_AABBTreeTraits_UndirectedEdgeTag_Box3f.BoxT, AABBTreeBase_AABBTreeTraits_FaceTag_Box3f.BoxT, AABBTreeTraits_FaceTag_Box3f.BoxT, ObjTreeTraits.BoxT, AABBTreeNode_AABBTreeTraits_UndirectedEdgeTag_Box3f.BoxT Box given by its min- and max- corners
|
static |
If the compiler supports `requires`, use that instead of `std::enable_if` here. Not (only) because it looks cooler, but because of a bug in our binding generator that makes it choke on it: https://github.com/MeshInspector/mrbind/issues/19
|
static |
| None mrmeshpy.Box3f.__init__ | ( | self | ) |
create invalid box by default
| None mrmeshpy.Box3f.__init__ | ( | self, | |
| Box3f | a ) |
| None mrmeshpy.Box3f.__init__ | ( | self, | |
| Box3f | arg0 ) |
Implicit copy constructor.
| bool mrmeshpy.Box3f.__eq__ | ( | self, | |
| Box3f | a ) |
| Vector3f mrmeshpy.Box3f.__getitem__ | ( | self, | |
| int | e ) |
min/max access by 0/1 index
| Vector3f mrmeshpy.Box3f.__getitem__ | ( | self, | |
| int | e ) |
| bool mrmeshpy.Box3f.__ne__ | ( | self, | |
| Box3f | a ) |
| str mrmeshpy.Box3f.__repr__ | ( | self | ) |
| None mrmeshpy.Box3f.__setitem__ | ( | self, | |
| int | arg0, | ||
| Vector3f | arg1 ) |
| Vector3f mrmeshpy.Box3f.center | ( | self | ) |
computes center of the box
| bool mrmeshpy.Box3f.contains | ( | self, | |
| Box3f | otherbox ) |
checks whether given box is fully inside (the surfaces may touch) of this box
| bool mrmeshpy.Box3f.contains | ( | self, | |
| Vector3f | pt ) |
checks whether given point is inside (including the surface) of this box
returns the corner of this box as specified by given bool-vector: 0 element in (c) means take min's coordinate, 1 element in (c) means take max's coordinate
| float mrmeshpy.Box3f.diagonal | ( | self | ) |
computes length from min to max
decreases min and increased max on given value
returns closest point in the box to given point
| float mrmeshpy.Box3f.getDistanceSq | ( | self, | |
| Box3f | b ) |
returns squared distance between this box and given one; returns zero if the boxes touch or intersect
| float mrmeshpy.Box3f.getDistanceSq | ( | self, | |
| Vector3f | pt ) |
returns squared distance between this box and given point; returns zero if the point is inside or on the boundary of the box
considering all planes with given normal and arbitrary shift: dot(n,x) = d finds the box's corner for which d is maximal
considering all planes with given normal and arbitrary shift: dot(n,x) = d finds the box's corner for which d is minimal
returns the closest point on the box to the given point for points outside the box this is equivalent to getBoxClosestPointTo
| None mrmeshpy.Box3f.include | ( | self, | |
| Box3f | b ) |
minimally increases the box to include another box
| None mrmeshpy.Box3f.include | ( | self, | |
| Vector3f | pt ) |
minimally increases the box to include given point
| Box3f mrmeshpy.Box3f.insignificantlyExpanded | ( | self | ) |
decreases min and increases max to their closest representable value
computes intersection between this and other box
| bool mrmeshpy.Box3f.intersects | ( | self, | |
| Box3f | b ) |
checks whether this box intersects or touches given box
|
static |
|
static |
| Vector3f mrmeshpy.Box3f.size | ( | self | ) |
computes size of the box in all dimensions
| bool mrmeshpy.Box3f.valid | ( | self | ) |
true if the box contains at least one point
| float mrmeshpy.Box3f.volume | ( | self | ) |
computes the volume of this box
|
staticprotected |
|
staticprotected |
|
static |