/******************************************************************************** * * * 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 . * * * ********************************************************************************/ #include "../function_item_evaluator.h" #include "mapping.h" #define mapping POSTFIX_SCHEMA(mapping) using namespace ifcopenshell::geom; #ifdef SCHEMA_HAS_IfcFixedReferenceSweptAreaSolid taxonomy::ptr mapping::map_impl(const IfcSchema::IfcFixedReferenceSweptAreaSolid& inst) { auto dir = map(inst.Directrix()); auto ref = taxonomy::cast(map(inst.FixedReference())); auto profile = taxonomy::cast(map(inst.SweptArea())); auto loft = taxonomy::make(); // @todo intialize as default loft->axis = nullptr; // Check if this instance has alignment elements // @todo currently only the case is handled where directrix returns a piecewise_function if (auto fn = std::dynamic_pointer_cast(dir)) { function_item_evaluator evaluator(settings_, fn); auto evaluation_points = evaluator.evaluation_points(); for (const auto& dist_along : evaluation_points) { auto m4 = evaluator.evaluate(dist_along); /* std::stringstream ss; ss << m4; auto s = ss.str(); std::wcout << s.c_str() << std::endl; std::wcout << "determinant: " << m4.determinant() << std::endl; */ Eigen::Matrix4d m4b = Eigen::Matrix4d::Identity(); bool is_directrix_derived = false; #ifdef SCHEMA_HAS_IfcDirectrixDerivedReferenceSweptAreaSolid if (inst.as()) { is_directrix_derived = true; } #endif auto pos = m4.col(3).head<3>(); if (is_directrix_derived) { m4b.col(0).head<3>() = m4.col(1).head<3>(); m4b.col(1).head<3>() = m4.col(0).head<3>().cross(m4.col(1).head<3>()); m4b.col(2).head<3>() = m4.col(0).head<3>(); m4b.col(3).head<3>() = pos; } else { Eigen::Vector3d tangent = m4.col(0).head<3>().normalized(); Eigen::Vector3d proj = (ref->components() - tangent * tangent.dot(ref->components())); proj.normalize(); auto binormal = proj.cross(tangent); m4b.col(0).head<3>() = proj; m4b.col(1).head<3>() = binormal; m4b.col(2).head<3>() = tangent; m4b.col(3).head<3>() = pos; /* Eigen::JacobiSVD svd(m4b); auto condition_number = svd.singularValues()(0) / svd.singularValues()(svd.singularValues().size() - 1); if (condition_number > 1.e10) { ifcopenshell::logger::root().error("Non-invertible matrix at " + std::to_string(distalong) + " conversion will likely fail."); } */ } // @todo taxonomy::clone() does not actually clone. That's really confusing. // loft->children.push_back(taxonomy::clone(profile)); loft->children.push_back(taxonomy::face::ptr(profile->clone_())); loft->children.back()->matrix = taxonomy::make(); if (profile->matrix) { loft->children.back()->matrix->components() = (m4b * profile->matrix->ccomponents()).eval(); } else { loft->children.back()->matrix->components() = m4b; } } } else { taxonomy::matrix4::ptr matrix; if (inst.Position()) { matrix = taxonomy::cast(map(inst.Position())); } // TODO: Implement handling for non-alignment curves using sweep_along_curve auto sweep = taxonomy::make( matrix, // matrix4::ptr - no transformation needed profile, // face::ptr - the profile to sweep dir, // item::ptr curve - the directrix curve ref); return sweep; } return loft; } #endif