Uses of Class
de.labathome.trustconstr.records.IntersectionResult

Packages that use IntersectionResult

Package	Description
de.labathome.trustconstr

Uses of IntersectionResult in de.labathome.trustconstr

Methods in de.labathome.trustconstr that return IntersectionResult

Modifier and Type	Method	Description
static IntersectionResult	QPSubproblem.boxIntersections(double[] z, double[] d, double[] lb, double[] ub)	Find the intersection of a segment (or line) with the rectangular box lb ≤ x ≤ ub, where the segment is parameterised as x(t) = z + t*d.
static IntersectionResult	QPSubproblem.boxIntersections(double[] zIn, double[] dIn, double[] lbIn, double[] ubIn, boolean entireLine)	Find the intersection of a segment (or line) with the rectangular box lb ≤ x ≤ ub, where the segment is parameterised as x(t) = z + t*d.
static IntersectionResult	QPSubproblem.boxSphereIntersections(double[] z, double[] d, double[] lb, double[] ub, double trustRadius)	Convenience overload of QPSubproblem.boxSphereIntersections(double[], double[], double[], double[], double, boolean) with entireLine = false.
static IntersectionResult	QPSubproblem.boxSphereIntersections(double[] z, double[] d, double[] lb, double[] ub, double trustRadius, boolean entireLine)	Find the intersection of a segment (or line) with both a box lb ≤ x ≤ ub and a ball ||x|| ≤ trustRadius.
static IntersectionResult[]	QPSubproblem.boxSphereIntersectionsWithExtraInfo(double[] z, double[] d, double[] lb, double[] ub, double trustRadius)	Convenience overload of QPSubproblem.boxSphereIntersectionsWithExtraInfo(double[], double[], double[], double[], double, boolean) with entireLine = false.
static IntersectionResult[]	QPSubproblem.boxSphereIntersectionsWithExtraInfo(double[] z, double[] d, double[] lb, double[] ub, double trustRadius, boolean entireLine)	Find the intersection between segment (or line) and box/sphere constraints.
static IntersectionResult	QPSubproblem.sphereIntersections(double[] z, double[] d, double trustRadius)	Find the intersection between segment (or line) and spherical constraints.
static IntersectionResult	QPSubproblem.sphereIntersections(double[] z, double[] d, double trustRadius, boolean entireLine)	Find the intersection of a segment (or line) with the ball ||x|| ≤ trustRadius, where the segment is parameterised as x(t) = z + t*d.