OCC.BRepBndLib module¶

class
SwigPyIterator
(*args, **kwargs)¶ Bases:
object

advance
()¶

copy
()¶

decr
()¶

distance
()¶

equal
()¶

incr
()¶

next
()¶

previous
()¶

thisown
¶ The membership flag

value
()¶


class
brepbndlib
¶ Bases:
object

static
Add
(*args)¶  Adds the shape S to the bounding box B. More precisely are successively added to B:  each face of S; the triangulation of the face is used if it exists,  then each edge of S which does not belong to a face, the polygon of the edge is used if it exists  and last each vertex of S which does not belong to an edge. After each elementary operation, the bounding box B is enlarged by the tolerance value of the relative subshape. When working with the triangulation of a face this value of enlargement is the sum of the triangulation deflection and the face tolerance. When working with the polygon of an edge this value of enlargement is the sum of the polygon deflection and the edge tolerance. Warning  This algorithm is time consuming if triangulation has not been inserted inside the data structure of the shape S.  The resulting bounding box may be somewhat larger than the object.
Parameters:  S (TopoDS_Shape &) –
 B (Bnd_Box &) –
 useTriangulation (bool) – default value is Standard_True
Return type: void

static
AddClose
(*args)¶  Adds the shape S to the bounding box B. This is a quick algorithm but only works if the shape S is composed of polygonal planar faces, as is the case if S is an approached polyhedral representation of an exact shape. Pay particular attention to this because this condition is not checked and, if it not respected, an error may occur in the algorithm for which the bounding box is built. Note that the resulting bounding box is not enlarged by the tolerance value of the subshapes as is the case with the Add function. So the added part of the resulting bounding box is closer to the shape S.
Parameters:  S (TopoDS_Shape &) –
 B (Bnd_Box &) –
Return type: void

thisown
¶ The membership flag

static

brepbndlib_Add
(*args)¶  Adds the shape S to the bounding box B. More precisely are successively added to B:  each face of S; the triangulation of the face is used if it exists,  then each edge of S which does not belong to a face, the polygon of the edge is used if it exists  and last each vertex of S which does not belong to an edge. After each elementary operation, the bounding box B is enlarged by the tolerance value of the relative subshape. When working with the triangulation of a face this value of enlargement is the sum of the triangulation deflection and the face tolerance. When working with the polygon of an edge this value of enlargement is the sum of the polygon deflection and the edge tolerance. Warning  This algorithm is time consuming if triangulation has not been inserted inside the data structure of the shape S.  The resulting bounding box may be somewhat larger than the object.
Parameters:  S (TopoDS_Shape &) –
 B (Bnd_Box &) –
 useTriangulation (bool) – default value is Standard_True
Return type: void

brepbndlib_AddClose
(*args)¶  Adds the shape S to the bounding box B. This is a quick algorithm but only works if the shape S is composed of polygonal planar faces, as is the case if S is an approached polyhedral representation of an exact shape. Pay particular attention to this because this condition is not checked and, if it not respected, an error may occur in the algorithm for which the bounding box is built. Note that the resulting bounding box is not enlarged by the tolerance value of the subshapes as is the case with the Add function. So the added part of the resulting bounding box is closer to the shape S.
Parameters:  S (TopoDS_Shape &) –
 B (Bnd_Box &) –
Return type: void

register_handle
(handle, base_object)¶ Inserts the handle into the base object to prevent memory corruption in certain cases