Class to accumulate planes to find then their crossing point Generated from class MR.PlaneAccumulator. This is the const half of the class.
More...
|
| virtual unsafe void | Dispose (bool disposing) |
Class to accumulate planes to find then their crossing point Generated from class MR.PlaneAccumulator. This is the const half of the class.
◆ Const_PlaneAccumulator() [1/3]
| unsafe MR.Const_PlaneAccumulator.Const_PlaneAccumulator |
( |
| ) |
|
|
inline |
Constructs an empty (default-constructed) instance.
◆ Const_PlaneAccumulator() [2/3]
◆ Const_PlaneAccumulator() [3/3]
◆ Dispose() [1/2]
| virtual void MR.Const_PlaneAccumulator.Dispose |
( |
| ) |
|
|
inlinevirtual |
◆ Dispose() [2/2]
| virtual unsafe void MR.Const_PlaneAccumulator.Dispose |
( |
bool | disposing | ) |
|
|
inlineprotectedvirtual |
◆ findBestCrossPoint() [1/2]
| unsafe MR.Vector3d MR.Const_PlaneAccumulator.findBestCrossPoint |
( |
in MR.Vector3d | p0, |
|
|
double | tol, |
|
|
MR.Misc.InOut< int >? | rank = null, |
|
|
MR.Misc.InOut< MR.Vector3d >? | space = null ) |
|
inline |
computes the point that minimizes the sum of squared distances to accumulated planes; if such point is not unique then returns the one closest to p0
- Parameters
-
| tol | relative epsilon-tolerance for too small number detection |
| rank | optional output for solution matrix rank according to given tolerance |
| space | rank=1: unit normal to solution plane, rank=2: unit direction of solution line, rank=3: zero vector Generated from method MR.PlaneAccumulator.findBestCrossPoint. |
◆ findBestCrossPoint() [2/2]
| unsafe MR.Vector3f MR.Const_PlaneAccumulator.findBestCrossPoint |
( |
in MR.Vector3f | p0, |
|
|
float | tol, |
|
|
MR.Misc.InOut< int >? | rank = null, |
|
|
MR.Misc.InOut< MR.Vector3f >? | space = null ) |
|
inline |
The documentation for this class was generated from the following file: