ShapeAnalysis

Returns positively oriented wire in the face. If there is no such wire - returns the last wire of the face.

Returns a total area of 2d wire.

Returns a total area of 3d wire.

Returns True if <F> has outer bound.

Returns a shift required to move point <Val> to the range [ToVal-Period/2,ToVal+Period/2]. This shift will be the divisible by Period. Intended for adjusting parameters on periodic surfaces.

Returns a shift required to move point <Val> to the range [ValMin,ValMax]. This shift will be the divisible by Period with Period = ValMax - ValMin. Intended for adjusting parameters on periodic surfaces.

Finds the start and end vertices of the shape Shape can be of the following type: vertex: V1 and V2 are the same and equal to <shape>, edge : V1 is start and V2 is end vertex (see ShapeAnalysis_Edge methods FirstVertex and LastVertex), wire : V1 is start vertex of the first edge, V2 is end vertex of the last edge (also see ShapeAnalysis_Edge). If wire contains no edges V1 and V2 are nullified If none of the above V1 and V2 are nullified.

Computes exact UV bounds of all wires on the face.

Sets shape.

Returns input shape.

Returns deviation between input geometry entity and analytical entity.

Returns status of operation. Current meaning of possible values of status: -1 - algorithm is not initalazed by shape 0 - no errors 1 - error during any operation (usually - because of wrong input data) Any operation (calling any methods like IsPlane(...), ...) can be performed when current staue is equal 0. If after any operation status != 0, it is necessary to set it 0 by method ClearStatus() before calling other operation.

Returns status to be equal 0.

Returns true if the underlined surface can be represent by plane with tolerance theTol and sets in thePln the result plane.

Returns true if the underlined surface can be represent by cylindrical one with tolerance theTol and sets in theCyl the result cylinrical surface.

Returns true if the underlined surface can be represent by conical one with tolerance theTol and sets in theCone the result conical surface.

Returns true if the underlined surface can be represent by spherical one with tolerance theTol and sets in theSphere the result spherical surface.

Returns true if the underlined curve can be represent by line with tolerance theTol and sets in theLin the result line.

Returns true if the underlined curve can be represent by circle with tolerance theTol and sets in theCirc the result circle.

Returns true if the underlined curve can be represent by ellipse with tolerance theTol and sets in theCirc the result ellipse.

Creates an empty tool Checks a Shape i.e. each of its faces, records checks as diagnostics in the <infos>.
If <infos> has not been set before, no check is done
For faces which are in a Shell, topological data are recorded to allow recovering connectivities after fixing or removing the small faces or parts of faces Enchains various checks on a face inshell : to compute more information, relevant to topology

Checks if a Face is as a Spot Returns 0 if not, 1 if yes, 2 if yes and all vertices are the same By default, considers the tolerance zone of its vertices A given value <tol> may be given to check a spot of this size If a Face is a Spot, its location is returned in <spot>, and <spotol> returns an equivalent tolerance, which is computed as half of max dimension of min-max box of the face.

Acts as IsSpotFace, but records in <infos> a diagnostic "SpotFace" with the Pnt as value (data "Location").

Checks if a Face lies on a Surface which is a strip So the Face is a strip. But a Face may be a strip elsewhere ..
A given value <tol> may be given to check max width By default, considers the tolerance zone of its edges Returns 0 if not a strip support, 1 strip in U, 2 strip in V

Checks if two edges define a strip, i.e. distance maxi below tolerance, given or some of those of E1 and E2.

Searches for two and only two edges up tolerance Returns True if OK, false if not 2 edges If True, returns the two edges and their maximum distance.

Checks if a Face is a single strip, i.e. brings two great edges which are confused on their whole length, possible other edges are small or null length.
Returns 0 if not a strip support, 1 strip in U, 2 strip in V Records diagnostic in info if it is a single strip

Checks if a Face is as a Strip Returns 0 if not or non determined, 1 if in U, 2 if in V By default, considers the tolerance zone of its edges A given value <tol> may be given to check a strip of max this width.
If a Face is determined as a Strip, it is delinited by two lists of edges. These lists are recorded in diagnostic Diagnostic "StripFace" brings data "Direction" (U or V), "List1" , "List2" (if they could be computed)

Checks if a Face brings vertices which split it, either confused with non adjacent vertices, or confused with their projection on non adjacent edges Returns the count of found splitting vertices Each vertex then brings a diagnostic "SplittingVertex", with data : "Face" for the face, "Edge" for the split edge.

Checks if a Face has a pin, which can be edited No singularity : no pin, returns 0 If there is a pin, checked topics, with returned value :

• 0 : nothing to do more
• 1 : "smooth", i.e. not a really sharp pin -> diagnostic "SmoothPin"
• 2 : stretched pin, i.e. is possible to relimit the face by another vertex, so that this vertex still gives a pin -> diagnostic "StretchedPin" with location of vertex (Pnt)

Checks if a Face is twisted (apart from checking Pin, i.e. it does not give information on pin, only "it is twisted").

Returns the status of last call to Perform() ShapeExtend_OK : face was OK, nothing done ShapeExtend_DONE1: some wires are fixed ShapeExtend_DONE2: orientation of wires fixed ShapeExtend_DONE3: missing seam added ShapeExtend_DONE4: small area wire removed ShapeExtend_DONE5: natural bounds added ShapeExtend_FAIL1: some fails during fixing wires ShapeExtend_FAIL2: cannot fix orientation of wires ShapeExtend_FAIL3: cannot add missing seam ShapeExtend_FAIL4: cannot remove small area wire.

Sets a fixed Tolerance to check small face By default, local tolerance zone is considered Sets a fixed MaxTolerance to check small face Sets a fixed Tolerance to check small face By default, local tolerance zone is considered Unset fixed tolerance, comes back to local tolerance zones Unset fixed tolerance, comes back to local tolerance zones.

Returns the tolerance to check small faces, negative value if local tolerances zones are to be considered.

Tells if the Curve is closed with given precision. If <preci> < 0 then Precision::Confusion is used.

Validate parameters First and Last for the given curve in order to make them valid for creation of edge. This includes:

• limiting range [First,Last] by range of curve
• adjusting range [First,Last] for periodic (or closed) curve if Last < First Returns True if parameters are OK or are successfully corrected, or False if parameters cannot be corrected. In the latter case, parameters are reset to range of curve.

Computes a boundary box on segment of curve C2d from First to Last. This is done by taking NPoints points from the curve and, if Exact is True, by searching for exact extrema. All these points are added to Box.

Defines which pcurve (C1 or C2) should be chosen for FORWARD seam edge.

Empty constructor; initialises Status to OK.

Tells if the edge has a 3d curve.

Returns the 3d curve and bounding parameters for the edge Returns False if no 3d curve. If <orient> is True (default), takes orientation into account: if the edge is reversed, cf and cl are toggled.

Gives True if the edge has a 3d curve, this curve is closed, and the edge has the same vertex at start and end.

Returns start vertex of the edge (taking edge orientation into account).

Returns end vertex of the edge (taking edge orientation into account).

Checks the start and/or end vertex of the edge for matching with 3d curve with the given precision. <vtx> = 1 : start vertex only <vtx> = 2 : end vertex only <vtx> = 0 : both (default) If preci < 0 the vertices are considered with their own tolerances, else with the given <preci>.

Returns the status (in the form of True/False) of last Check.

Checks possibility for pcurve thePC to have range [theFirst, theLast] (edge range) having respect to real first, last parameters of thePC.

Checks the first edge is overlapped with second edge. If distance between two edges is less then theTolOverlap edges are overlapped. theDomainDis - length of part of edges on which edges are overlapped.

Clears all properties of the contour. Contour bound itself is not cleared.

Sets contour.

Sets area of the contour.

Sets perimeter of the contour.

Sets ratio of average length to average width of the contour.

Sets average width of the contour.

Adds notch on the contour with its maximum width.

Returns contour.

Returns area of the contour.

Returns perimeter of the contour.

Returns ratio of average length to average width of the contour.

Returns average width of the contour.

Returns number of notches on the contour.

Returns sequence of notches on the contour.

Returns notch on the contour.

Builds sequence of <wires> out of sequence of not sorted <edges>. Tries to build wires of maximum length. Building a wire is stopped when no edges can be connected to it at its head or at its tail.
Orientation of the edge can change when connecting. If <shared> is True connection is performed only when adjacent edges share the same vertex. If <shared> is False connection is performed only when ends of adjacent edges are at distance less than <toler>. Connects edges from the given sequence into wires.

Builds sequence of <wires> out of sequence of not sorted <edges>. Tries to build wires of maximum length. Building a wire is stopped when no edges can be connected to it at its head or at its tail.
Orientation of the edge can change when connecting. If <shared> is True connection is performed only when adjacent edges share the same vertex. If <shared> is False connection is performed only when ends of adjacent edges are at distance less than <toler>. Connects edges from the given sequence into wires.

Connects wires from the given sequence into longer wires.

Connects wires from the given sequence into longer wires.

Builds sequence of <owires> out of sequence of not sorted <iwires>. Tries to build wires of maximum length. Building a wire is stopped when no wires can be connected to it at its head or at its tail.
Orientation of the wire can change when connecting. If <shared> is True connection is performed only when adjacent wires share the same vertex. If <shared> is False connection is performed only when ends of adjacent wires are at distance less than <toler>. Map <vertices> stores the correspondence between original end vertices of the wires and new connecting vertices. Connects wires from the given sequence into longer wires. Also fills the map of original to new connecting vertices.

Extracts closed sub-wires out of <wires> and adds them to <closed>, open wires remained after extraction are put into <open>. If <shared> is True extraction is performed only when edges share the same vertex. If <shared> is False connection is performed only when ends of the edges are at distance less than <toler>.

Dispatches sequence of <wires> into two compounds <closed> for closed wires and <open> for open wires. If a compound is not empty wires are added into it.

Returns compound of closed wires out of free edges.

Returns compound of open wires out of free edges.

Builds and analyzes free bounds of the shape. First calls ShapeAnalysis_FreeBounds for building free bounds. Then on each free bound computes its properties:

• area of the contour,
• perimeter of the contour,
• ratio of average length to average width of the contour,
• average width of contour,
• notches on the contour and for each notch
• maximum width of the notch.

Returns True if shape is loaded.

Returns shape.

Returns tolerance.

Returns number of free bounds.

Returns number of closed free bounds.

Returns number of open free bounds.

Returns all closed free bounds.

Returns all open free bounds.

Returns properties of closed free bound specified by its rank number.

Returns properties of open free bound specified by its rank number.

Builds a plane out of a set of points in array Returns in <dmax> the maximal distance between the produced plane and given points.

Builds transformation object out of matrix. Matrix must be 3 x 4. Unit is used as multiplier.

Initialize fields and call ClearFlags().

Clears all accumulated statistics.

Clears all flags.

Counts quantities of sun-shapes in shape and stores sub-shapes according to flags.

Returns (modifiable) the flag which defines whether to store faces with edges if its 3D curves has more than 8192 poles.

Returns (modifiable) the flag which defines whether to store faces on indirect surfaces.

Returns (modifiable) the flag which defines whether to store faces on offset surfaces.

Returns (modifiable) the flag which defines whether to store faces with edges if its 3D curves are trimmed curves.

Returns (modifiable) the flag which defines whether to store faces with edges if its 3D curves and pcurves are offset curves.

Returns (modifiable) the flag which defines whether to store faces with edges if its pcurves are trimmed curves.

Empty constructor.

Determines a tolerance from the ones stored in a shape Remark : calls InitTolerance and AddTolerance, hence, can be used to start a series for cumulating tolerance <mode> = 0 : returns the average value between sub-shapes, <mode> > 0 : returns the maximal found, <mode> < 0 : returns the minimal found. <type> defines what kinds of sub-shapes to consider: SHAPE (default) : all : VERTEX, EDGE, FACE, VERTEX : only vertices, EDGE : only edges, FACE : only faces, SHELL : combined SHELL + FACE, for each face (and containing shell), also checks EDGE and VERTEX.

Determines which shapes have a tolerance over the given value <type> is interpreted as in the method Tolerance.

Determines which shapes have a tolerance within a given interval <type> is interpreted as in the method Tolerance.

Initializes computation of cumulated tolerance.

Adds data on new Shape to compute Cumulated Tolerance (prepares three computations : maximal, average, minimal).

Returns the computed tolerance according to the <mode> <mode> = 0 : average <mode> > 0 : maximal <mode> < 0 : minimal.

Empty constructor.

Clears data about loaded shells and performed checks.

Adds shells contained in the <shape> to the list of loaded shells.

Checks if shells fulfill orientation condition, i.e. if each edge is, either present once (free edge) or twice (connected edge) but with different orientations (FORWARD/REVERSED) Edges which do not fulfill these conditions are bad.
If <alsofree> is True free edges are considered. Free edges can be queried but are not bad

Tells if a shape is loaded (only shells are checked).

Returns the actual number of loaded shapes (i.e. shells).

Returns a loaded shape specified by its rank number. Returns null shape if <num> is out of range.

Tells if at least one edge is recorded as bad.

Returns the list of bad edges as a Compound It is empty (not null) if no edge are recorded as bad.

Tells if at least one edge is recorded as free (not connected).

Returns the list of free (not connected) edges as a Compound It is empty (not null) if no edge are recorded as free.

Tells if at least one edge is connected (shared twice or more).

Creates an analyzer object on the basis of existing surface.

Returns a surface being analyzed.

Returns the Adaptor. Creates it if not yet done.

Returns the Adaptor (may be Null if method Adaptor() was not called).

Returns 3D distance found by one of the following methods. IsDegenerated, DegeneratedValues, ProjectDegenerated (distance between 3D point and found or last (if not found) singularity), IsUClosed, IsVClosed (minimum value of precision to consider the surface to be closed), ValueOfUV (distance between 3D point and found solution).