mirror of
https://github.com/IfcOpenShell/IfcOpenShell.git
synced 2026-08-12 10:33:20 +00:00
Thomas Krijnen
103 lines
4.1 KiB
C++
103 lines
4.1 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_IfcPolygonalFaceSet
|
|
|
|
taxonomy::ptr mapping::map_impl(const IfcSchema::IfcPolygonalFaceSet* inst) {
|
|
IfcSchema::IfcCartesianPointList3D* point_list = inst->Coordinates();
|
|
auto coordinates = point_list->CoordList();
|
|
auto polygonal_faces = inst->Faces();
|
|
|
|
std::vector<taxonomy::point3::ptr> points;
|
|
points.reserve(coordinates.size());
|
|
for (auto& coords : coordinates) {
|
|
points.push_back(taxonomy::make<taxonomy::point3>(
|
|
coords.size() < 1 ? 0. : coords[0] * length_unit_,
|
|
coords.size() < 2 ? 0. : coords[1] * length_unit_,
|
|
coords.size() < 3 ? 0. : coords[2] * length_unit_));
|
|
}
|
|
|
|
int max_index = (int)points.size();
|
|
|
|
auto shell = taxonomy::make<taxonomy::shell>();
|
|
|
|
for (auto& f : *polygonal_faces) {
|
|
auto fa = taxonomy::make<taxonomy::face>();
|
|
shell->children.push_back(fa);
|
|
|
|
{
|
|
auto loop = taxonomy::make<taxonomy::loop>();
|
|
fa->children = { loop };
|
|
loop->external = true;
|
|
auto indices = f->CoordIndex();
|
|
taxonomy::point3::ptr previous;
|
|
for (std::vector<int>::const_iterator jt = indices.begin(); jt != indices.end(); ++jt) {
|
|
if (*jt < 1 || *jt > max_index) {
|
|
throw IfcParse::IfcException("IfcPolygonalFaceSet index out of bounds for index " + boost::lexical_cast<std::string>(*jt));
|
|
}
|
|
auto current = points[(*jt) - 1];
|
|
if (jt != indices.begin()) {
|
|
loop->children.push_back(taxonomy::make<taxonomy::edge>(previous, current));
|
|
}
|
|
previous = current;
|
|
}
|
|
if (!indices.empty()) {
|
|
auto current = points[indices.front() - 1];
|
|
loop->children.push_back(taxonomy::make<taxonomy::edge>(previous, current));
|
|
}
|
|
}
|
|
|
|
if (f->as<IfcSchema::IfcIndexedPolygonalFaceWithVoids>()) {
|
|
auto indices = f->as<IfcSchema::IfcIndexedPolygonalFaceWithVoids>()->InnerCoordIndices();
|
|
{
|
|
taxonomy::point3::ptr previous;
|
|
for (auto& li : indices) {
|
|
auto loop = taxonomy::make<taxonomy::loop>();
|
|
fa->children.push_back(loop);
|
|
loop->external = false;
|
|
|
|
for (std::vector<int>::const_iterator jt = li.begin(); jt != li.end(); ++jt) {
|
|
if (*jt < 1 || *jt > max_index) {
|
|
throw IfcParse::IfcException("IfcPolygonalFaceSet index out of bounds for index " + boost::lexical_cast<std::string>(*jt));
|
|
}
|
|
auto current = points[(*jt) - 1];
|
|
if (jt != li.begin()) {
|
|
loop->children.push_back(taxonomy::make<taxonomy::edge>(previous, current));
|
|
}
|
|
previous = current;
|
|
}
|
|
if (!li.empty()) {
|
|
auto current = points[li.front() - 1];
|
|
loop->children.push_back(taxonomy::make<taxonomy::edge>(previous, current));
|
|
}
|
|
}
|
|
|
|
}
|
|
}
|
|
}
|
|
|
|
return shell;
|
|
}
|
|
|
|
#endif
|