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) |
| |
|
|
bool | _IsOwningVal |
| |
|
virtual bool | _IsOwning [get] |
| | Returns true if this is an owning instance, and when disposed, will destroy the underlying C++ instance. If false, we assume that the underlying C++ instance will live long enough.
|
| |
Class to accumulate planes to find then their crossing point Generated from class MR.PlaneAccumulator. This is the const half of the class.
◆ findBestCrossPoint()
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. |
The documentation for this class was generated from the following file: