cgal_bridge.cpp

Go to the documentation of this file.

/*
 * Copyright (C) <2012-2024> <EDF-DTG> <FRANCE>
 * This file is part of Code_TYMPAN (R).
 * Code_TYMPAN (R) is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 * Code_TYMPAN (R) 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 GNU General Public License for more details.
 * You should have received a copy of the GNU General Public License along
 * with Code_TYMPAN (R). If not, see <https://www.gnu.org/licenses/>.
 */
 
#include "cgal_bridge.h"
 
#include <boost/foreach.hpp>
 
#include "Tympan/models/common/cgal_tools.h"
#include "Tympan/models/business/geometry/TYPolygon.h"
#include "Tympan/models/business/exceptions.h"
 
namespace tympan
{
 
class TYPolygonTriangulator : public ITYPolygonTriangulator
{
public:
    TYPolygonTriangulator(const TYPolygon& poly_);
 
    virtual void exportMesh(std::deque<OPoint3D>& points, std::deque<OTriangle>& triangles) const;
 
    const TYPolygon& poly;
}; // class TYPolygonTriangulator
 
TYPolygonTriangulator::TYPolygonTriangulator(const TYPolygon& poly_) : poly(poly_) {}
 
void TYPolygonTriangulator::exportMesh(std::deque<OPoint3D>& points, std::deque<OTriangle>& triangles) const
{
 
    assert(points.size() == 0 && "Output arguments 'points' is expected to be initially empty");
    assert(triangles.size() == 0 && "Output arguments 'triangles' is expected to be initially empty");
 
    TYPolygon checked_poly(poly);
    checked_poly.updateNormal(); // This actually updates the associated plane
    if (!checked_poly.checkCoplanar())
    {
        std::deque<LPTYElement> elements;
        LPTYElement element(new TYPolygon(poly));
        elements.push_back(element);
        throw tympan::invalid_data("Polygon is not planar.")
            << tympan_source_loc << tympan::elements_implied_errinfo(elements);
    }
    // NB The triangulation happen in the local r/ frame
    // We build a polygon in the plane (aka 2D) so as to be able to triangulate it
    CGAL_Plane plane(to_cgal(checked_poly.getPlan()));
    CGAL_Polygon poly2d;
    BOOST_FOREACH (const OPoint3D& op, checked_poly.getPoints())
    {
        // Projection of `op` onto `plane`
        const CGAL_Point3 pp3d = plane.projection(to_cgal(op));
        // Conversion into a 2D point
        const CGAL_Point2 pp2d = plane.to_2d(pp3d);
        poly2d.push_back(pp2d);
        points.push_back(op);
    }
 
    if (!poly2d.is_simple())
    {
        std::deque<LPTYElement> elements;
        LPTYElement element(new TYPolygon(poly));
        elements.push_back(element);
        throw tympan::invalid_data("Face can not be triangulated (invalid plane?).")
            << tympan_source_loc << tympan::elements_implied_errinfo(elements);
    }
    // Actual triangulation done by CGAL
    PolygonTriangulator triangulator(poly2d);
    // Use information from triangulator.vertice_handles and the triangulation itself.
    // to level-up from 2D CGAL representation to our 3D OPoints world
    std::deque<PolygonTriangulator::Tri_indices> tri_indices;
    triangulator.exportTrianglesIndices(tri_indices);
    BOOST_FOREACH (const auto& tri_idx, tri_indices)
    {
        OTriangle tri(tri_idx[0], tri_idx[1], tri_idx[2]);
        for (unsigned i = 0; i < 3; ++i)
        {
            const OPoint3D& p = points[tri_idx[i]];
            tri.vertex(i) = p;
        }
        triangles.push_back(tri);
        assert(triangles.back().checkConsistencyWrtPointsTab(points));
    }
} // void TYPolygonTriangulator::exportMesh(...)
 
std::unique_ptr<ITYPolygonTriangulator> make_polygon_triangulator(const TYPolygon& poly)
{
    return std::unique_ptr<ITYPolygonTriangulator>(new TYPolygonTriangulator(poly));
} // ITYPolygonTriangulator* make_polygon_triangulator()
} // namespace tympan