LandBoundary.hpp

//---- GPL ---------------------------------------------------------------------
//
// Copyright (C)  Stichting Deltares, 2011-2021.
//
// This program 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 version 3.
//
// This program 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 this program.  If not, see <http://www.gnu.org/licenses/>.
//
// contact: delft3d.support@deltares.nl
// Stichting Deltares
// P.O. Box 177
// 2600 MH Delft, The Netherlands
//
// All indications and logos of, and references to, "Delft3D" and "Deltares"
// are registered trademarks of Stichting Deltares, and remain the property of
// Stichting Deltares. All rights reserved.
//
//------------------------------------------------------------------------------
 
#pragma once
 
#include <vector>
 
#include "MeshKernel/BoundingBox.hpp"
#include "MeshKernel/Polygons.hpp"
 
namespace meshkernel
{
 
    class LandBoundary
    {
    public:
        explicit LandBoundary(const std::vector<Point>& landBoundary);
 
        void FindNearestPoint(const Point& samplePoint,
                              const Projection& projection,
                              Point& nearestPoint,
                              double& minimumDistance,
                              UInt& segmentStartIndex,
                              double& scaledDistanceToStart) const;
 
        Point FindNearestPoint(const Point& samplePoint,
                               const Projection& projection) const;
 
        size_t GetNumNodes() const;
 
        bool IsEmpty() const;
 
        const Point& Node(const size_t i) const;
 
        const std::vector<Point>& GetNodes() const;
 
        void AddSegment(const Point& leftNode, const Point& rightNode);
 
        Point ClosestPoint(const Point& point, const size_t point1Index, const size_t point2Index, const Projection projection) const;
 
        BoundingBox GetBoundingBox(const size_t startIndex, const size_t endIndex) const;
 
        BoundingBox GetBoundingBox() const;
 
        std::vector<std::pair<UInt, UInt>> FindPolylineIndices() const;
 
        std::vector<bool> GetNodeMask(const Polygons& polygons) const;
 
    private:
        std::vector<Point> m_nodes;
    };
 
} // namespace meshkernel
 
inline size_t meshkernel::LandBoundary::GetNumNodes() const
{
    return m_nodes.size();
}
 
inline bool meshkernel::LandBoundary::IsEmpty() const
{
    return m_nodes.empty();
}
 
inline const meshkernel::Point& meshkernel::LandBoundary::Node(const size_t i) const
{
    return m_nodes[i];
}
 
inline const std::vector<meshkernel::Point>& meshkernel::LandBoundary::GetNodes() const
{
    return m_nodes;
}