本文整理汇总了C++中Vector_3::cartesian方法的典型用法代码示例。如果您正苦于以下问题：C++ Vector_3::cartesian方法的具体用法？C++ Vector_3::cartesian怎么用？C++ Vector_3::cartesian使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类Vector_3的用法示例。
在下文中一共展示了Vector_3::cartesian方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: result
static Vector_3 leastSquaresPoint(const std::vector<unsigned> activeGroup,
const std::vector<SupportItem> &items)
{
DEBUG_START;
Eigen::Matrix3d matrix;
Eigen::Vector3d vector;
for (unsigned i = 0; i < 3; ++i)
{
vector(i) = 0.;
for (unsigned j = 0; j < 3; ++j)
matrix(i, j) = 0.;
}
std::cout << "Calculating least squares points for the following items"
<< std::endl;
for (unsigned iPlane : activeGroup)
{
SupportItem item = items[iPlane];
Vector_3 u = item.direction;
double value = item.value;
std::cout << " Item #" << iPlane << ": u = " << u << "; h = "
<< value << std::endl;
for (unsigned i = 0; i < 3; ++i)
{
for (unsigned j = 0; j < 3; ++j)
matrix(i, j) += u.cartesian(i)
* u.cartesian(j);
vector(i) += u.cartesian(i) * value;
}
}
Eigen::Vector3d solution = matrix.inverse() * vector;
Vector_3 result(solution(0), solution(1), solution(2));
std::cout << "Result: " << result << std::endl;
for (unsigned iPlane : activeGroup)
{
SupportItem item = items[iPlane];
double delta = item.direction * result - item.value;
std::cout << " delta = " << delta << std::endl;
}
DEBUG_END;
return result;
}