mirror of
https://github.com/IfcOpenShell/IfcOpenShell.git
synced 2026-08-10 17:58:20 +00:00
Richard Brice
87 lines
3.8 KiB
C++
87 lines
3.8 KiB
C++
/********************************************************************************
|
|
* *
|
|
* This file is part of IfcOpenShell. *
|
|
* *
|
|
* IfcOpenShell is free software: you can redistribute it and/or modify *
|
|
* it under the terms of the Lesser GNU General Public License as published by *
|
|
* the Free Software Foundation, either version 3.0 of the License, or *
|
|
* (at your option) any later version. *
|
|
* *
|
|
* IfcOpenShell is distributed in the hope that it will be useful, *
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
|
|
* Lesser GNU General Public License for more details. *
|
|
* *
|
|
* You should have received a copy of the Lesser GNU General Public License *
|
|
* along with this program. If not, see <http://www.gnu.org/licenses/>. *
|
|
* *
|
|
********************************************************************************/
|
|
|
|
#include "mapping.h"
|
|
#define mapping POSTFIX_SCHEMA(mapping)
|
|
using namespace ifcopenshell::geometry;
|
|
|
|
#ifdef SCHEMA_HAS_IfcGradientCurve
|
|
|
|
taxonomy::ptr mapping::map_impl(const IfcSchema::IfcGradientCurve* inst) {
|
|
if (!inst->BaseCurve()->as<IfcSchema::IfcCompositeCurve>())
|
|
Logger::Warning("Expected IfcGradientCurve.BaseCurve to be IfcCompositeCurve", inst); // CT 4.1.7.1.1.2
|
|
|
|
auto horizontal = taxonomy::cast<taxonomy::piecewise_function>(map(inst->BaseCurve()));
|
|
auto vertical = taxonomy::make<taxonomy::piecewise_function>(&settings_);
|
|
|
|
auto segments = inst->Segments();
|
|
|
|
for (auto& segment : *segments) {
|
|
if (segment->as<IfcSchema::IfcCurveSegment>()) {
|
|
// @todo check that we don't get a mixture of implicit and explicit definitions
|
|
auto crv = map(segment->as<IfcSchema::IfcCurveSegment>());
|
|
if (crv->kind() == taxonomy::PIECEWISE_FUNCTION) {
|
|
auto seg = taxonomy::cast<taxonomy::piecewise_function>(crv);
|
|
vertical->spans.insert(vertical->spans.end(), seg->spans.begin(), seg->spans.end());
|
|
} else {
|
|
Logger::Error("Unsupported");
|
|
return nullptr;
|
|
}
|
|
} else {
|
|
Logger::Error("Unsupported");
|
|
return nullptr;
|
|
}
|
|
}
|
|
|
|
auto composition = [horizontal, vertical](double u)->Eigen::Matrix4d {
|
|
auto xy = horizontal->evaluate(u);
|
|
auto uz = vertical->evaluate(u);
|
|
|
|
uz.col(3)(0) = 0.0; // x is distance along. zero it out so it doesn't add to the x from horizontal
|
|
uz.col(1).swap(uz.col(2)); // uz is 2D in distance along - y plane, swap y and z so elevations become z
|
|
uz.row(1).swap(uz.row(2));
|
|
|
|
Eigen::Matrix4d m;
|
|
m = xy * uz; // combine horizontal and vertical
|
|
return m;
|
|
};
|
|
|
|
std::array<taxonomy::piecewise_function::ptr, 2> both = { horizontal , vertical };
|
|
// @todo: rb - this constrains the range of u to the minimum of horizontal and vertical
|
|
// we discussed using the maximum for the range of us and then using std::numeric_limits<double>::NAN
|
|
// for values of u that horizontal or vertical cannot be computed.
|
|
// Review and decide what to do.
|
|
double min_length = std::numeric_limits<double>::infinity();
|
|
for (auto i = 0; i < 2; ++i) {
|
|
double l = 0;
|
|
for (auto& s : both[i]->spans) {
|
|
l += s.first;
|
|
}
|
|
if (l < min_length) {
|
|
min_length = l;
|
|
}
|
|
}
|
|
|
|
auto pwf = taxonomy::make<taxonomy::piecewise_function>(&settings_);
|
|
pwf->spans.emplace_back( min_length, composition );
|
|
pwf->instance = inst;
|
|
return pwf;
|
|
}
|
|
|
|
#endif |