OpenCascade.js
API ReferenceModelingAlgorithmsTKGeomAlgo

GccAna

OCCT package GccAna: GccAna_Circ2dBisec, GccAna_CircLin2dBisec, GccAna_CircPnt2dBisec, GccAna_Lin2dBisec, and 3 more bound classes.

GccAna_Circ2dBisec

This class describes functions for building bisecting curves between two 2D circles. A bisecting curve between two circles is a curve such that each of its points is at the same distance from the two circles. It can be an ellipse, hyperbola, circle or line, depending on the relative position of the two circles. The algorithm computes all the elementary curves which are solutions. There is no solution if the two circles are coincident. A Circ2dBisec object provides a framework for:

  • defining the construction of the bisecting curves,
  • implementing the construction algorithm, and consulting the result.

Constructors(1)

Instance methods(3)

  • IsDone(): boolean

    This method returns True if the construction algorithm succeeded.

  • NbSolutions(): number

    This method returns the number of solutions. Raises NotDone if the construction algorithm didn't succeed.

  • ThisSolution(Index: number): GccInt_Bisec

    Returns the solution number Index Raises OutOfRange exception if Index is greater than the number of solutions. It raises NotDone if the construction algorithm didn't succeed.

    Parameters (1)
    • Index

GccAna_CircLin2dBisec

Describes functions for building bisecting curves between a 2D line and a 2D circle. A bisecting curve between a circle and a line is a curve such that each of its points is at the same distance from the circle and the line. It can be a parabola or a line, depending of the relative position of the line and the circle. The algorithm computes all the elementary curves which are solutions. A CircLin2dBisec object provides a framework for:

  • defining the construction of the bisecting curves,
  • implementing the construction algorithm, and
  • consulting the result.

Constructors(1)

Instance methods(3)

  • IsDone(): boolean

    Returns true (this construction algorithm never fails).

  • NbSolutions(): number

    Returns the number of curves, representing solutions computed by this algorithm.

  • ThisSolution(Index: number): GccInt_Bisec

    Returns the solution number Index and raises OutOfRange exception if Index is greater than the number of solutions Exceptions Standard_OutOfRange if Index is less than zero or greater than the number of solutions computed by this algorithm.

    Parameters (1)
    • Index

GccAna_CircPnt2dBisec

Describes functions for building a bisecting curve between a 2D circle and a point. A bisecting curve between a circle and a point is such a curve that each of its points is at the same distance from the circle and the point. It can be an ellipse, hyperbola, circle or line, depending on the relative position of the point and the circle. The algorithm computes all the elementary curves which are solutions. A CircPnt2dBisec object provides a framework for:

  • defining the construction of the bisecting curves,
  • implementing the construction algorithm, and
  • consulting the result.

Constructors(2)

Instance methods(3)

  • IsDone(): boolean

    Returns true (this construction algorithm never fails).

  • NbSolutions(): number

    Returns the number of curves, representing solutions computed by this algorithm.

  • ThisSolution(Index: number): GccInt_Bisec

    Returns the solution number Index and raises OutOfRange exception if Index is greater than the number of solutions. Exceptions Standard_OutOfRange if Index is less than zero or greater than the number of solutions computed by this algorithm.

    Parameters (1)
    • Index

GccAna_Lin2dBisec

Describes functions for building bisecting lines between two 2D lines. A bisecting line between two lines is such that each of its points is at the same distance from the two lines. If the two lines are secant, there are two orthogonal bisecting lines which share the angles made by the two straight lines in two equal parts. If D1 and D2 are the unit vectors of the two straight lines, those of the two bisecting lines are collinear with the following vectors:

  • D1 + D2 for the "internal" bisecting line,
  • D1 - D2 for the "external" bisecting line. If the two lines are parallel, the (unique) bisecting line is the straight line equidistant from the two straight lines. If the two straight lines are coincident, the algorithm returns the first straight line as the solution. A Lin2dTanObl object provides a framework for:
  • defining the construction of the bisecting lines,
  • implementing the construction algorithm, and
  • consulting the result.

Constructors(1)

Instance methods(5)

  • IsDone(): boolean

    Returns True when the algorithm succeeded.

  • NbSolutions(): number

    Returns the number of solutions and raise NotDone if the constructor wasn't called before.

  • ThisSolution(Index: number): gp_Lin2d

    Returns the solution number Index . The first solution is the inside one and the second is the outside one. For the first solution the direction is D1+D2 (D1 is the direction of the first argument and D2 the direction of the second argument). For the second solution the direction is D1-D2. Raises NotDone if the construction algorithm didn't succeed. It raises OutOfRange if Index is greater than the number of solutions.

    Parameters (1)
    • Index
  • Intersection1(Index: number, ParSol: number, ParArg: number, PntSol: gp_Pnt2d): { ParSol: number; ParArg: number }

    Returns information about the intersection point between the result number Index and the first argument. Raises NotDone if the construction algorithm didn't succeed. It raises OutOfRange if Index is greater than the number of solutions.

    Parameters (4)
    • Index
    • ParSol
    • ParArg
    • PntSol
      Mutated in place; read the updated value from this argument after the call.
    Returns

    A result object with fields:

    • ParSol: updated value from the call.
    • ParArg: updated value from the call.
  • Intersection2(Index: number, ParSol: number, ParArg: number, PntSol: gp_Pnt2d): { ParSol: number; ParArg: number }

    Returns information about the intersection point between the result number Index and the second argument. Raises NotDone if the construction algorithm didn't succeed. It raises OutOfRange if Index is greater than the number of solutions.

    Parameters (4)
    • Index
    • ParSol
    • ParArg
    • PntSol
      Mutated in place; read the updated value from this argument after the call.
    Returns

    A result object with fields:

    • ParSol: updated value from the call.
    • ParArg: updated value from the call.

GccAna_LinPnt2dBisec

Describes functions for building bisecting curves between a 2D line and a point. A bisecting curve between a line and a point is such a curve that each of its points is at the same distance from the circle and the point. It can be a parabola or a line, depending on the relative position of the line and the circle. There is always one unique solution. A LinPnt2dBisec object provides a framework for:

  • defining the construction of the bisecting curve,
  • implementing the construction algorithm, and
  • consulting the result.

Constructors(1)

Instance methods(2)

  • IsDone(): boolean

    Returns True if the algorithm succeeded.

  • Returns the number of solutions. It raises NotDone if the construction algorithm didn't succeed.

GccAna_Pnt2dBisec

This class implements the algorithms used to create the bisecting line between two 2d points Describes functions for building a bisecting line between two 2D points. The bisecting line between two points is the bisector of the segment which joins the two points, if these are not coincident. The algorithm does not find a solution if the two points are coincident. A Pnt2dBisec object provides a framework for:

  • defining the construction of the bisecting line,
  • implementing the construction algorithm, and consulting the result.

Constructors(1)

Instance methods(3)

  • IsDone(): boolean

    Returns true (this construction algorithm never fails).

  • HasSolution(): boolean

    Returns true if this algorithm has a solution, i.e. if the two points are not coincident.

  • Returns a line, representing the solution computed by this algorithm.