Loading [MathJax]/jax/output/HTML-CSS/config.js
MeshKernel
All Classes Namespaces Functions Variables Typedefs Enumerations Enumerator Pages Concepts
Mesh2D.hpp
1//---- GPL ---------------------------------------------------------------------
2//
3// Copyright (C) Stichting Deltares, 2011-2021.
4//
5// This program is free software: you can redistribute it and/or modify
6// it under the terms of the GNU General Public License as published by
7// the Free Software Foundation version 3.
8//
9// This program is distributed in the hope that it will be useful,
10// but WITHOUT ANY WARRANTY; without even the implied warranty of
11// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12// GNU General Public License for more details.
13//
14// You should have received a copy of the GNU General Public License
15// along with this program. If not, see <http://www.gnu.org/licenses/>.
16//
17// contact: delft3d.support@deltares.nl
18// Stichting Deltares
19// P.O. Box 177
20// 2600 MH Delft, The Netherlands
21//
22// All indications and logos of, and references to, "Delft3D" and "Deltares"
23// are registered trademarks of Stichting Deltares, and remain the property of
24// Stichting Deltares. All rights reserved.
25//
26//------------------------------------------------------------------------------
27
28#pragma once
29#include <array>
30#include <ranges>
31#include <utility>
32#include <vector>
33
34#include <MeshKernel/Constants.hpp>
35#include <MeshKernel/Definitions.hpp>
36#include <MeshKernel/Entities.hpp>
37#include <MeshKernel/Mesh.hpp>
38#include <MeshKernel/Polygon.hpp>
39#include <MeshKernel/UndoActions/CompoundUndoAction.hpp>
40#include <MeshKernel/UndoActions/SphericalCoordinatesOffsetAction.hpp>
41#include <MeshKernel/UndoActions/UndoAction.hpp>
42
45namespace meshkernel
46{
47 // Forward declarations
48 class CurvilinearGrid;
49 class Polygons;
50 class GeometryList;
51
57 class Mesh2D final : public Mesh
58 {
59 public:
62
65 {
66 InsideNotIntersected = 0,
67 InsideAndIntersected = 1,
68 FacesWithIncludedCircumcenters = 2
69 };
70
72 enum class Property
73 {
74 Orthogonality = 0,
75 EdgeLength = 1
76 };
77
79 ~Mesh2D() override = default;
80
83
86 explicit Mesh2D(Projection projection);
87
92 Mesh2D(const std::vector<Edge>& edges,
93 const std::vector<Point>& nodes,
94 Projection projection);
95
102 Mesh2D(const std::vector<Edge>& edges,
103 const std::vector<Point>& nodes,
104 const std::vector<std::vector<UInt>>& faceNodes,
105 const std::vector<std::uint8_t>& numFaceNodes,
106 Projection projection);
107
112 Mesh2D(const std::vector<Point>& nodes, const Polygons& polygons, Projection projection);
113
115 void Administrate(CompoundUndoAction* undoAction = nullptr) override;
116
118 void ComputeCircumcentersMassCentersAndFaceAreas(bool computeMassCenters = false);
119
121 void FindFaces();
122
126 void FindFacesGivenFaceNodesMapping(const std::vector<std::vector<UInt>>& faceNodes,
127 const std::vector<std::uint8_t>& numFaceNodes);
128
132 [[nodiscard]] std::unique_ptr<SphericalCoordinatesOffsetAction> OffsetSphericalCoordinates(double minx, double maxx);
133
135 void CommitAction(const SphericalCoordinatesOffsetAction& undoAction);
136
140 void RestoreAction(const SphericalCoordinatesOffsetAction& undoAction);
141
148 std::vector<Point>& polygonNodesCache,
149 std::vector<UInt>& localNodeIndicesCache,
150 std::vector<UInt>& globalEdgeIndicesCache) const;
151
156 [[nodiscard]] Point ComputeFaceCircumenter(std::vector<Point>& polygon,
157 const std::vector<UInt>& edgesNumFaces) const;
158
161 [[nodiscard]] std::vector<Point> GetObtuseTrianglesCenters();
162
166 [[nodiscard]] std::vector<UInt> GetEdgesCrossingSmallFlowEdges(double smallFlowEdgesThreshold);
167
171 [[nodiscard]] std::vector<Point> GetFlowEdgesCenters(const std::vector<UInt>& edges) const;
172
195 [[nodiscard]] std::unique_ptr<meshkernel::UndoAction> DeleteSmallFlowEdges(double smallFlowEdgesThreshold);
196
214 [[nodiscard]] std::unique_ptr<UndoAction> DeleteSmallTrianglesAtBoundaries(double minFractionalAreaTriangles);
215
217 void ComputeNodeNeighbours(std::vector<std::vector<UInt>>& nodesNodes, UInt& maxNumNeighbours) const;
218
221 void ComputeAspectRatios(std::vector<double>& aspectRatios) const;
222
225
227 MeshNodeType GetNodeType(const UInt nodeId) const { return m_nodesTypes[nodeId]; }
228
230 void GetNodeTypes(std::vector<MeshNodeType>& nodeTypes) const { nodeTypes = m_nodesTypes; }
231
233 [[nodiscard]] std::unique_ptr<UndoAction> DeleteDegeneratedTriangles();
234
236 [[nodiscard]] std::unique_ptr<UndoAction> TriangulateFaces();
237
243 void MakeDualFace(const std::span<const Point> edgeCentres,
244 UInt node,
245 double enlargementFactor,
246 std::vector<Point>& dualFace) const;
247
251 [[nodiscard]] std::vector<UInt> SortedFacesAroundNode(UInt node) const;
252
256 [[nodiscard]] std::vector<Point> ComputeBoundaryPolygons(const std::vector<Point>& polygon);
257
263 void WalkBoundaryFromNode(const Polygon& polygon,
264 std::vector<bool>& isVisited,
265 UInt& currentNode,
266 std::vector<Point>& meshBoundaryPolygon) const;
267
270 [[nodiscard]] std::vector<UInt> GetHangingEdges() const;
271
273 [[nodiscard]] std::unique_ptr<UndoAction> DeleteHangingEdges();
274
278 [[nodiscard]] std::vector<UInt> PointFaceIndices(const std::vector<Point>& points);
279
285 [[nodiscard]] std::unique_ptr<UndoAction> DeleteMesh(const Polygons& polygon, DeleteMeshOptions deletionOption, bool invertDeletion);
286
294 [[nodiscard]] std::vector<bool> FilterBasedOnMetric(Location location, Property property, double minValue, double maxValue) const;
295
300 [[nodiscard]] std::tuple<UInt, UInt> IsSegmentCrossingABoundaryEdge(const Point& firstPoint, const Point& secondPoint) const;
301
307 [[nodiscard]] std::vector<int> MaskEdgesOfFacesInPolygon(const Polygons& polygons, bool invertSelection, bool includeIntersected) const;
308
312 [[nodiscard]] std::vector<int> NodeMaskFromEdgeMask(std::vector<int> const& edgeMask) const;
313
318 [[nodiscard]] std::vector<int> NodeMaskFromPolygon(const Polygons& polygons, bool inside) const;
319
323 UInt FindOppositeEdge(const UInt faceId, const UInt edgeId) const;
324
329 UInt NextFace(const UInt faceId, const UInt edgeId) const;
330
336 static std::unique_ptr<Mesh2D> Merge(const Mesh2D& mesh1, const Mesh2D& mesh2);
337
339 static std::unique_ptr<Mesh2D> Merge(const std::span<const Point>& mesh1Nodes,
340 const std::span<const Edge>& mesh1Edges,
341 const std::span<const Point>& mesh2Nodes,
342 const std::span<const Edge>& mesh2Edges,
343 const Projection projection);
344
348 [[nodiscard]] BoundingBox GetBoundingBox() const;
349
353 [[nodiscard]] std::vector<BoundingBox> GetEdgesBoundingBoxes() const;
354
359 void FindFacesConnectedToNode(UInt nodeIndex, std::vector<UInt>& sharedFaces) const;
360
365 void GetConnectingNodes(UInt nodeIndex, std::vector<UInt>& connectedNodes) const;
366
373 void FindNodesSharedByFaces(UInt nodeIndex, const std::vector<UInt>& sharedFaces, std::vector<UInt>& connectedNodes, std::vector<std::vector<UInt>>& faceNodeMapping) const;
374
379 UInt IsStartOrEnd(const UInt edgeId, const UInt nodeId) const;
380
385 UInt IsLeftOrRight(const UInt elementId, const UInt edgeId) const;
386
390 UInt FindCommonFace(const UInt edge1, const UInt edge2) const;
391
392 private:
393 // orthogonalization
394 static constexpr double m_minimumEdgeLength = 1e-4;
395 static constexpr double m_curvilinearToOrthogonalRatio = 0.5;
396 static constexpr double m_minimumCellArea = 1e-12;
397 static constexpr UInt m_maximumNumberOfHangingNodesAlongEdge = 5;
398
400 using HangingNodeIndexArray = std::array<UInt, m_maximumNumberOfHangingNodesAlongEdge>;
401
403 void ComputeAverageAreOfNeighbouringFaces(const UInt faceId, UInt& numNonBoundaryFaces, double& averageOtherFacesArea) const;
404
406 void FindSmallestCornerAngle(const UInt faceId,
407 double& minCosPhiSmallTriangle,
408 UInt& nodeToPreserve,
409 UInt& firstNodeToMerge,
410 UInt& secondNodeToMerge,
411 UInt& thirdEdgeSmallTriangle) const;
412
414 void DeleteSmallTriangle(const UInt nodeToPreserve,
415 const UInt firstNodeToMerge,
416 const UInt secondNodeToMerge,
417 bool& nodesMerged,
418 CompoundUndoAction& undoAction);
419
421 void FindNodesToDelete(const Polygons& polygon,
422 const bool invertDeletion,
423 std::vector<bool>& isNodeInsidePolygon,
424 std::vector<bool>& deleteNode) const;
425
427 void DeletedMeshNodesAndEdges(const std::function<bool(UInt)>& excludedFace,
428 std::vector<bool>& deleteNode,
429 CompoundUndoAction& deleteMeshAction);
430
432 std::vector<int> ComputeNodeMask(const Polygons& polygons) const;
433
435 std::vector<int> ComputeEdgeMask(const std::vector<int>& nodeMask,
436 bool includeIntersected) const;
437
439 void RemoveIntersected(const std::vector<int>& edgeMask,
440 std::vector<int>& secondEdgeMask) const;
441
443 void InvertSelection(const std::vector<int>& edgeMask,
444 std::vector<int>& secondEdgeMask) const;
445
447 std::vector<bool> FindFacesEntirelyInsidePolygon(const std::vector<bool>& isNodeInsidePolygon) const;
448
453 [[nodiscard]] std::unique_ptr<UndoAction> DeleteMeshFaces(const Polygons& polygon, bool invertDeletion);
454
465 void FindFacesRecursive(UInt startNode,
466 UInt node,
467 UInt previousEdge,
468 UInt numClosingEdges,
469 std::vector<UInt>& edges,
470 std::vector<UInt>& nodes,
471 std::vector<UInt>& sortedEdges,
472 std::vector<UInt>& sortedNodes,
473 std::vector<Point>& nodalValues);
474
479 [[nodiscard]] bool HasTriangleNoAcuteAngles(const std::vector<UInt>& faceNodes, const std::vector<Point>& nodes) const;
480
484 bool HasDuplicateNodes(const UInt numClosingEdges, const std::vector<UInt>& node, std::vector<UInt>& sortedNodes) const;
485
489 bool HasDuplicateEdgeFaces(const UInt numClosingEdges, const std::vector<UInt>& edges, std::vector<UInt>& sortedEdgesFaces) const;
490
492 void ResizeAndInitializeFaceVectors();
493
497 void DoAdministrationGivenFaceNodesMapping(const std::vector<std::vector<UInt>>& faceNodes,
498 const std::vector<std::uint8_t>& numFaceNodes);
499
502 void DoAdministration(CompoundUndoAction* undoAction = nullptr);
503
505 void InitialiseBoundaryNodeClassification(std::vector<int>& intNodeType) const;
506
508 MeshNodeType ClassifyNode(const UInt nodeId) const;
509
510 // /// @brief Count the number of valid edges in list
511 // UInt CountNumberOfValidEdges(const std::vector<UInt>& edgesNumFaces, const UInt numNodes) const;
512
514 void ComputeMidPointsAndNormals(const std::vector<Point>& polygon,
515 const std::vector<UInt>& edgesNumFaces,
516 const UInt numNodes,
517 std::array<Point, constants::geometric::maximumNumberOfNodesPerFace>& middlePoints,
518 std::array<Point, constants::geometric::maximumNumberOfNodesPerFace>& normals,
519 UInt& pointCount) const;
520
522 Point ComputeCircumCentre(const Point& centerOfMass,
523 const UInt pointCount,
524 const std::array<Point, constants::geometric::maximumNumberOfNodesPerFace>& middlePoints,
525 const std::array<Point, constants::geometric::maximumNumberOfNodesPerFace>& normals) const;
526
528 void ComputeAverageFlowEdgesLength(std::vector<double>& edgesLength,
529 std::vector<double>& averageFlowEdgesLength) const;
530
532 void ComputeAverageEdgeLength(const std::vector<double>& edgesLength,
533 const std::vector<double>& averageFlowEdgesLength,
534 std::vector<bool>& curvilinearGridIndicator,
535 std::vector<std::array<double, 2>>& averageEdgesLength,
536 std::vector<double>& aspectRatios) const;
537
540 UInt InvalidateEdgesWithNoFace();
541
542 std::vector<MeshNodeType> m_nodesTypes;
543 };
544
545} // namespace meshkernel
A class defining a bounding box.
Definition BoundingBox.hpp:40
A class derived from Mesh, which describes unstructures 2d meshes.
Definition Mesh2D.hpp:58
Mesh2D()
Default constructor.
Mesh2D(const std::vector< Edge > &edges, const std::vector< Point > &nodes, const std::vector< std::vector< UInt > > &faceNodes, const std::vector< std::uint8_t > &numFaceNodes, Projection projection)
Construct a mesh2d from face nodes and num face nodes.
~Mesh2D() override=default
Default destructor.
std::vector< int > NodeMaskFromEdgeMask(std::vector< int > const &edgeMask) const
From the edge mask compute the node mask.
static std::unique_ptr< Mesh2D > Merge(const std::span< const Point > &mesh1Nodes, const std::span< const Edge > &mesh1Edges, const std::span< const Point > &mesh2Nodes, const std::span< const Edge > &mesh2Edges, const Projection projection)
Merges mesh node and edge connectivity into a single mesh.
std::unique_ptr< meshkernel::UndoAction > DeleteSmallFlowEdges(double smallFlowEdgesThreshold)
Deletes small flow edges (removesmallflowlinks, part 1)
void ComputeFaceClosedPolygonWithLocalMappings(UInt faceIndex, std::vector< Point > &polygonNodesCache, std::vector< UInt > &localNodeIndicesCache, std::vector< UInt > &globalEdgeIndicesCache) const
For a face create a closed polygon and fill local mapping caches (get_cellpolygon)
UInt NextFace(const UInt faceId, const UInt edgeId) const
Get the next face adjacent to the edge on the opposite side.
MeshNodeType GetNodeType(const UInt nodeId) const
Get the node type.
Definition Mesh2D.hpp:227
DeleteMeshOptions
Enumerator describing the different options to delete a mesh.
Definition Mesh2D.hpp:65
Point ComputeFaceCircumenter(std::vector< Point > &polygon, const std::vector< UInt > &edgesNumFaces) const
For a closed polygon, compute the circumcenter of a face (getcircumcenter)
std::vector< BoundingBox > GetEdgesBoundingBoxes() const
Get the bounding boxes of the mesh edges.
void FindNodesSharedByFaces(UInt nodeIndex, const std::vector< UInt > &sharedFaces, std::vector< UInt > &connectedNodes, std::vector< std::vector< UInt > > &faceNodeMapping) const
Find all unique nodes.
UInt FindOppositeEdge(const UInt faceId, const UInt edgeId) const
Find edge on the opposite side of the element.
std::vector< UInt > SortedFacesAroundNode(UInt node) const
Sorts the faces around a node, sorted in counter clock wise order.
std::vector< UInt > GetHangingEdges() const
Gets the hanging edges.
Property
Enumerator for different properties on a 2D mesh.
Definition Mesh2D.hpp:73
std::vector< int > MaskEdgesOfFacesInPolygon(const Polygons &polygons, bool invertSelection, bool includeIntersected) const
Masks the edges of all faces entirely included in all polygons.
void MakeDualFace(const std::span< const Point > edgeCentres, UInt node, double enlargementFactor, std::vector< Point > &dualFace) const
Make a dual face around the node, enlarged by a factor.
void FindFaces()
Constructs the face nodes mapping, face mass centers and areas.
void RestoreAction(const SphericalCoordinatesOffsetAction &undoAction)
Undo the coordinate offset action.
void CommitAction(const SphericalCoordinatesOffsetAction &undoAction)
Apply the coordinate offset action.
std::tuple< UInt, UInt > IsSegmentCrossingABoundaryEdge(const Point &firstPoint, const Point &secondPoint) const
Inquire if a segment is crossing a face.
void ComputeAspectRatios(std::vector< double > &aspectRatios) const
Gets the aspect ratios (the ratios edges lengths to flow edges lengths)
UInt FindCommonFace(const UInt edge1, const UInt edge2) const
Find the id of the element that is common to both edges.
std::unique_ptr< UndoAction > DeleteSmallTrianglesAtBoundaries(double minFractionalAreaTriangles)
Deletes small triangles at the boundaries (removesmallflowlinks, part 2)
void Administrate(CompoundUndoAction *undoAction=nullptr) override
Perform complete administration.
std::vector< Point > ComputeBoundaryPolygons(const std::vector< Point > &polygon)
Convert all mesh boundaries to a vector of polygon nodes, including holes (copynetboundstopol)
std::vector< UInt > PointFaceIndices(const std::vector< Point > &points)
For a collection of points, compute the face indices including them.
UInt IsStartOrEnd(const UInt edgeId, const UInt nodeId) const
Determine if the node is at the start or end of the edge.
std::vector< UInt > GetEdgesCrossingSmallFlowEdges(double smallFlowEdgesThreshold)
Gets the edges crossing the small flow edges.
void WalkBoundaryFromNode(const Polygon &polygon, std::vector< bool > &isVisited, UInt &currentNode, std::vector< Point > &meshBoundaryPolygon) const
Constructs a polygon from the meshboundary, by walking through the mesh.
std::unique_ptr< UndoAction > DeleteDegeneratedTriangles()
Deletes coinciding triangles.
Mesh2D(const std::vector< Point > &nodes, const Polygons &polygons, Projection projection)
Create triangular grid from nodes (triangulatesamplestonetwork)
void ComputeCircumcentersMassCentersAndFaceAreas(bool computeMassCenters=false)
Compute face circumcenters.
std::vector< Point > GetFlowEdgesCenters(const std::vector< UInt > &edges) const
Gets the flow edges centers from the crossing edges.
Mesh2D(Projection projection)
Construct a mesh2d using only the projection.
static std::unique_ptr< Mesh2D > Merge(const Mesh2D &mesh1, const Mesh2D &mesh2)
Merges mesh connectivity.
std::unique_ptr< UndoAction > DeleteMesh(const Polygons &polygon, DeleteMeshOptions deletionOption, bool invertDeletion)
Deletes a mesh in a polygon, using several options (delnet)
void GetConnectingNodes(UInt nodeIndex, std::vector< UInt > &connectedNodes) const
Get indices of all nodes that are connected directly to a give node along connected edges.
Mesh2D(const std::vector< Edge > &edges, const std::vector< Point > &nodes, Projection projection)
Construct a mesh2d starting from the edges and nodes.
std::vector< int > NodeMaskFromPolygon(const Polygons &polygons, bool inside) const
Mask all nodes included in all polygons.
UInt IsLeftOrRight(const UInt elementId, const UInt edgeId) const
Determine if the element lies on the left or right side of the edge.
std::vector< Point > GetObtuseTrianglesCenters()
Gets the mass centers of obtuse triangles.
void ComputeNodeNeighbours(std::vector< std::vector< UInt > > &nodesNodes, UInt &maxNumNeighbours) const
Computes node neighbours.
BoundingBox GetBoundingBox() const
Get the mesh bounding box.
void ClassifyNodes()
Classifies the nodes (makenetnodescoding)
std::vector< bool > FilterBasedOnMetric(Location location, Property property, double minValue, double maxValue) const
This method generates a mask indicating which locations are within the specified range of the given m...
void FindFacesConnectedToNode(UInt nodeIndex, std::vector< UInt > &sharedFaces) const
Find all faces that have the given node as a vertex.
void GetNodeTypes(std::vector< MeshNodeType > &nodeTypes) const
Get the node type.
Definition Mesh2D.hpp:230
std::unique_ptr< SphericalCoordinatesOffsetAction > OffsetSphericalCoordinates(double minx, double maxx)
Offset the x coordinates if m_projection is spherical.
std::unique_ptr< UndoAction > DeleteHangingEdges()
Deletes the hanging edges.
void FindFacesGivenFaceNodesMapping(const std::vector< std::vector< UInt > > &faceNodes, const std::vector< std::uint8_t > &numFaceNodes)
Find remaining face information given the face nodes mapping.
std::unique_ptr< UndoAction > TriangulateFaces()
Transform non-triangular faces in triangular faces.
A class describing an unstructured mesh. This class contains the shared functionality between 1d or 2...
Definition Mesh.hpp:99
void RestoreAction(const ResetNodeAction &undoAction)
Undo the reset node action.
void CommitAction(const ResetNodeAction &undoAction)
Apply the reset node action.
A struct describing a point in a two-dimensional space.
Definition Point.hpp:41
A closed polygon.
Definition Polygon.hpp:46
A class containing a list of polygonaly enclosed regions.
Definition Polygons.hpp:45
Contains the logic of the C++ static library.
Definition AveragingInterpolation.hpp:37
Projection
Enumerator describing the supported projections.
Definition Definitions.hpp:43
MeshNodeType
Possible unstructured node types.
Definition Definitions.hpp:148
Location
Mesh locations enumeration.
Definition Definitions.hpp:76
std::uint32_t UInt
Integer type used when indexing mesh graph entities.
Definition Definitions.hpp:39