File size: 27,734 Bytes
985c397 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 | // SPDX-License-Identifier: LGPL-2.1-or-later
/***************************************************************************
* Copyright (c) 2005 Imetric 3D GmbH *
* *
* This file is part of the FreeCAD CAx development system. *
* *
* This library is free software; you can redistribute it and/or *
* modify it under the terms of the GNU Library General Public *
* License as published by the Free Software Foundation; either *
* version 2 of the License, or (at your option) any later version. *
* *
* This library 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 Library General Public License for more details. *
* *
* You should have received a copy of the GNU Library General Public *
* License along with this library; see the file COPYING.LIB. If not, *
* write to the Free Software Foundation, Inc., 59 Temple Place, *
* Suite 330, Boston, MA 02111-1307, USA *
* *
***************************************************************************/
#ifndef MESHALGORITHM_H
#define MESHALGORITHM_H
#include <map>
#include <set>
#include <vector>
#include "Elements.h"
#include "MeshKernel.h"
// forward declarations
namespace Base
{
class ViewProjMethod;
class Polygon2d;
} // namespace Base
namespace MeshCore
{
class MeshGeomFacet;
class MeshGeomEdge;
class MeshKernel;
class MeshFacetGrid;
class MeshFacetArray;
class MeshRefPointToFacets;
class AbstractPolygonTriangulator;
/**
* The MeshAlgorithm class provides algorithms base on meshes.
*/
class MeshExport MeshAlgorithm
{
public:
explicit MeshAlgorithm(const MeshKernel& rclM)
: _rclMesh(rclM)
{}
public:
/**
* Searches for the nearest facet to the ray defined by
* (\a rclPt, \a rclDir).
* The point \a rclRes holds the intersection point with the ray and the
* nearest facet with index \a rulFacet.
* \note This method tests all facets so it should only be used
* occasionally.
*/
bool NearestFacetOnRay(
const Base::Vector3f& rclPt,
const Base::Vector3f& rclDir,
Base::Vector3f& rclRes,
FacetIndex& rulFacet
) const;
/**
* Searches for the nearest facet to the ray defined by
* (\a rclPt, \a rclDir).
* The point \a rclRes holds the intersection point with the ray and the
* nearest facet with index \a rulFacet. The angle between the ray and the normal of the
* triangle must be less than or equal to \a fMaxAngle. \note This method tests all facets so it
* should only be used occasionally.
*/
bool NearestFacetOnRay(
const Base::Vector3f& rclPt,
const Base::Vector3f& rclDir,
float fMaxAngle,
Base::Vector3f& rclRes,
FacetIndex& rulFacet
) const;
/**
* Searches for the nearest facet to the ray defined by
* (\a rclPt, \a rclDir).
* The point \a rclRes holds the intersection point with the ray and the
* nearest facet with index \a rulFacet.
* \note This method is optimized by using a grid. So this method can be
* used for a lot of tests.
*/
bool NearestFacetOnRay(
const Base::Vector3f& rclPt,
const Base::Vector3f& rclDir,
const MeshFacetGrid& rclGrid,
Base::Vector3f& rclRes,
FacetIndex& rulFacet
) const;
/**
* Searches for the nearest facet to the ray defined by
* (\a rclPt, \a rclDir).
* The point \a rclRes holds the intersection point with the ray and the
* nearest facet with index \a rulFacet.
* \note This method tests all facets taken from \a raulFacets instead of
* the attached mesh. So the caller must ensure that the indices are valid
* facets.
*/
bool NearestFacetOnRay(
const Base::Vector3f& rclPt,
const Base::Vector3f& rclDir,
const std::vector<FacetIndex>& raulFacets,
Base::Vector3f& rclRes,
FacetIndex& rulFacet
) const;
/**
* Searches for the nearest facet to the ray defined by (\a rclPt, \a rclDir). The point \a
* rclRes holds the intersection point with the ray and the nearest facet with index \a
* rulFacet. More a search radius around the ray of \a fMaxSearchArea is defined. \note This
* method is optimized by using a grid. So this method can be used for a lot of tests.
*/
bool NearestFacetOnRay(
const Base::Vector3f& rclPt,
const Base::Vector3f& rclDir,
float fMaxSearchArea,
const MeshFacetGrid& rclGrid,
Base::Vector3f& rclRes,
FacetIndex& rulFacet
) const;
/**
* Searches for the first facet of the grid element (\a rGrid) in that the point \a rPt lies
* into which is a distance not higher than \a fMaxDistance. Of no such facet is found \a
* uIndex is undefined and false is returned, otherwise true. \note If the point \a rPt is
* outside of the grid \a rclGrid nothing is done.
*/
bool FirstFacetToVertex(
const Base::Vector3f& rPt,
float fMaxDistance,
const MeshFacetGrid& rGrid,
FacetIndex& uIndex
) const;
/**
* Checks from the viewpoint \a rcView if the vertex \a rcVertex is visible or it is hidden by a
* facet. If the vertex is visible true is returned, false otherwise.
*/
bool IsVertexVisible(
const Base::Vector3f& rcVertex,
const Base::Vector3f& rcView,
const MeshFacetGrid& rclGrid
) const;
/**
* Calculates the average length of edges.
*/
float GetAverageEdgeLength() const;
/**
* Calculates the minimum length of edges.
*/
float GetMinimumEdgeLength() const;
/**
* Calculates the maximum length of edges.
*/
float GetMaximumEdgeLength() const;
/**
* Calculates the gravity point of the mesh.
*/
Base::Vector3f GetGravityPoint() const;
/**
* Returns all boundaries of the mesh.
*/
void GetMeshBorders(std::list<std::vector<Base::Vector3f>>& rclBorders) const;
/**
* Returns all boundaries of the mesh. This method does basically the same as above unless that
* it returns the point indices of the boundaries.
*/
void GetMeshBorders(std::list<std::vector<PointIndex>>& rclBorders) const;
/**
* Returns all boundaries of a subset the mesh defined by \a raulInd.
*/
void GetFacetBorders(
const std::vector<FacetIndex>& raulInd,
std::list<std::vector<Base::Vector3f>>& rclBorders
) const;
/**
* Returns all boundaries of a subset the mesh defined by \a raulInd. This method does basically
* the same as above unless that it returns the point indices of the boundaries. If \a
* ignoreOrientation is false (the default) we may get a broken boundary curve if the mesh has
* facets with wrong orientation. However, if \a ignoreOrientation is true we may get a boundary
* curve with wrong orientation even if the mesh is topologically correct. You should let the
* default value unless you exactly know what you do.
*/
void GetFacetBorders(
const std::vector<FacetIndex>& raulInd,
std::list<std::vector<PointIndex>>& rclBorders,
bool ignoreOrientation = false
) const;
/**
* Returns the boundary of the mesh to the facet \a uFacet. If this facet does not have an open
* edge the returned boundary is empty.
*/
void GetFacetBorder(FacetIndex uFacet, std::list<PointIndex>& rBorder) const;
/**
* Returns the boundary of the mesh to the facets \a uFacest. If none of the facets have an open
* edge the returned boundary is empty.
*/
void GetFacetsBorders(
const std::vector<FacetIndex>& uFacets,
std::list<std::vector<PointIndex>>& rBorders
) const;
/**
* Boundaries that consist of several loops must be split in several independent boundaries
* to perform e.g. a polygon triangulation algorithm on them.
*/
void SplitBoundaryLoops(std::list<std::vector<PointIndex>>& aBorders);
/**
* Fills up the single boundary if it is a hole with high quality triangles and a maximum area
* of \a fMaxArea. The triangulation information is stored in \a rFaces and \a rPoints. To speed
* up the calculations the optional parameter \a pStructure can be specified that holds a
* facet-to-points structure of the underlying mesh. If the boundary is not a hole or the
* algorithm failed false is returned, otherwise true.
* @note \a boundary contains the point indices of the mesh data structure. The first and last
* index must therefore be equal.
* @note \a rPoints contains the geometric points of the triangulation. The number of points can
* be the same as or exceed the number of boundary indices but it cannot be lower.
* @note If the number of geometric points exceeds the number of boundary indices then the
* triangulation algorithm has introduced new points which are added to the end of \a rPoints.
*/
bool FillupHole(
const std::vector<PointIndex>& boundary,
AbstractPolygonTriangulator& cTria,
MeshFacetArray& rFaces,
MeshPointArray& rPoints,
int level,
const MeshRefPointToFacets* pP2FStructure = nullptr
) const;
/** Sets to all facets in \a raulInds the properties in raulProps.
* \note Both arrays must have the same size.
*/
void SetFacetsProperty(
const std::vector<FacetIndex>& raulInds,
const std::vector<unsigned long>& raulProps
) const;
/** Sets to all facets the flag \a tF. */
void SetFacetFlag(MeshFacet::TFlagType tF) const;
/** Sets to all points the flag \a tF. */
void SetPointFlag(MeshPoint::TFlagType tF) const;
/** Resets of all facets the flag \a tF. */
void ResetFacetFlag(MeshFacet::TFlagType tF) const;
/** Resets of all points the flag \a tF. */
void ResetPointFlag(MeshPoint::TFlagType tF) const;
/** Sets to all facets in \a raulInds the flag \a tF. */
void SetFacetsFlag(const std::vector<FacetIndex>& raulInds, MeshFacet::TFlagType tF) const;
/** Sets to all points in \a raulInds the flag \a tF. */
void SetPointsFlag(const std::vector<PointIndex>& raulInds, MeshPoint::TFlagType tF) const;
/** Gets all facets in \a raulInds with the flag \a tF. */
void GetFacetsFlag(std::vector<FacetIndex>& raulInds, MeshFacet::TFlagType tF) const;
/** Gets all points in \a raulInds with the flag \a tF. */
void GetPointsFlag(std::vector<PointIndex>& raulInds, MeshPoint::TFlagType tF) const;
/** Resets from all facets in \a raulInds the flag \a tF. */
void ResetFacetsFlag(const std::vector<FacetIndex>& raulInds, MeshFacet::TFlagType tF) const;
/** Resets from all points in \a raulInds the flag \a tF. */
void ResetPointsFlag(const std::vector<PointIndex>& raulInds, MeshPoint::TFlagType tF) const;
/** Count all facets with the flag \a tF. */
unsigned long CountFacetFlag(MeshFacet::TFlagType tF) const;
/** Count all points with the flag \a tF. */
unsigned long CountPointFlag(MeshPoint::TFlagType tF) const;
/** Returns all geometric points from the facets in \a rvecIndices. */
void PointsFromFacetsIndices(
const std::vector<FacetIndex>& rvecIndices,
std::vector<Base::Vector3f>& rvecPoints
) const;
/**
* Returns the indices of all facets that have at least one point that lies inside the tool
* mesh. The direction \a dir is used to try to foraminate the facets of the tool mesh and
* counts the number of foraminated facets. If this number is odd the considered point lies
* inside otherwise outside.
* @note The tool mesh must be a valid solid.
* @note It's not tested if \a rToolMesh is a valid solid. In case it is not the result is
* undefined.
*/
void GetFacetsFromToolMesh(
const MeshKernel& rToolMesh,
const Base::Vector3f& rcDir,
std::vector<FacetIndex>& raclCutted
) const;
/**
* Does basically the same as method above except it uses a mesh grid to speed up the
* computation.
*/
void GetFacetsFromToolMesh(
const MeshKernel& rToolMesh,
const Base::Vector3f& rcDir,
const MeshFacetGrid& rGrid,
std::vector<FacetIndex>& raclCutted
) const;
/**
* Checks whether the bounding box \a rBox is surrounded by the attached mesh which must be a
* solid. The direction \a rcDir is used to try to foraminate the facets of the tool mesh and
* counts the number of foraminated facets. 1 is returned if the box is completely inside the
* mesh 0 is returned if the box is partially inside (i.e. intersects) the mesh -1 is returned
* if the box is completely outside the mesh. This could also mean that the mesh is surrounded
* by \a rBox.
*/
int Surround(const Base::BoundBox3f& rBox, const Base::Vector3f& rcDir);
/**
* Projects the determined facets through projection with \a pclProj into the 2D plane and
* checks for intersection with the polygon. If \a bInner is \a true than all facets with at
* least one corner inside the polygon get deleted. If \a bInner is \a false then all facets
* with at least one corner outside the polygon get deleted. This algorithm is optimized by
* using a grid.
*/
void CheckFacets(
const MeshFacetGrid& rclGrid,
const Base::ViewProjMethod* pclProj,
const Base::Polygon2d& rclPoly,
bool bInner,
std::vector<FacetIndex>& facets
) const;
/**
* Does the same as the above method unless that it doesn't use a grid.
*/
void CheckFacets(
const Base::ViewProjMethod* pclProj,
const Base::Polygon2d& rclPoly,
bool bInner,
std::vector<FacetIndex>& facets
) const;
/**
* Determines all facets of the given array \a raclFacetIndices that lie at the edge or that
* have at least neighbour facet that is not inside the array. The resulting array \a
* raclResultIndices is not be deleted before the algorithm starts. \a usLevel indicates how
* often the algorithm is repeated.
*/
void CheckBorderFacets(
const std::vector<FacetIndex>& raclFacetIndices,
std::vector<FacetIndex>& raclResultIndices,
unsigned short usLevel = 1
) const;
/**
* Invokes CheckBorderFacets() to get all border facets of \a raclFacetIndices. Then the content
* of \a raclFacetIndices is replaced by all facets that can be deleted. \note The mesh
* structure is not modified by this method. This is in the responsibility of the user.
*/
void CutBorderFacets(std::vector<FacetIndex>& raclFacetIndices, unsigned short usLevel = 1) const;
/** Returns the number of border edges */
unsigned long CountBorderEdges() const;
/**
* Determines all border points as indices of the facets in \a raclFacetIndices. The points are
* unsorted.
*/
void GetBorderPoints(
const std::vector<FacetIndex>& raclFacetIndices,
std::set<PointIndex>& raclResultPointsIndices
) const;
/** Computes the surface of the mesh. */
float Surface() const;
/** Subsamples the mesh with point distance \a fDist and stores the points in \a rclPoints. */
void SubSampleByDist(float fDist, std::vector<Base::Vector3f>& rclPoints) const;
/**
* Subsamples the mesh to produce around \a ulCtPoints. \a ulCtPoints should be greater
* than 5 * number of facets.
*/
void SubSampleByCount(unsigned long ulCtPoints, std::vector<Base::Vector3f>& rclPoints) const;
/** Returns only the points of the mesh without actually sampling the data. */
void SubSampleAllPoints(std::vector<Base::Vector3f>& rclPoints) const;
/**
* Searches for all facets that intersect the "search tube" with radius \a r around the
* polyline.
*/
void SearchFacetsFromPolyline(
const std::vector<Base::Vector3f>& rclPolyline,
float fRadius,
const MeshFacetGrid& rclGrid,
std::vector<FacetIndex>& rclResultFacetsIndices
) const;
/** Projects a point directly to the mesh (means nearest facet), the result is the facet index
* and the foraminate point, use second version with grid for more performance.
*/
bool NearestPointFromPoint(
const Base::Vector3f& rclPt,
FacetIndex& rclResFacetIndex,
Base::Vector3f& rclResPoint
) const;
bool NearestPointFromPoint(
const Base::Vector3f& rclPt,
const MeshFacetGrid& rclGrid,
FacetIndex& rclResFacetIndex,
Base::Vector3f& rclResPoint
) const;
bool NearestPointFromPoint(
const Base::Vector3f& rclPt,
const MeshFacetGrid& rclGrid,
float fMaxSearchArea,
FacetIndex& rclResFacetIndex,
Base::Vector3f& rclResPoint
) const;
/** Cuts the mesh with a plane. The result is a list of polylines. */
bool CutWithPlane(
const Base::Vector3f& clBase,
const Base::Vector3f& clNormal,
const MeshFacetGrid& rclGrid,
std::list<std::vector<Base::Vector3f>>& rclResult,
float fMinEps = 1.0e-2F,
bool bConnectPolygons = false
) const;
/**
* Gets all facets that cut the plane (N,d) and that lie between the two points left and right.
* The plane is defined by it normalized normal and the signed distance to the origin.
*/
void GetFacetsFromPlane(
const MeshFacetGrid& rclGrid,
const Base::Vector3f& clNormal,
float dist,
const Base::Vector3f& rclLeft,
const Base::Vector3f& rclRight,
std::vector<FacetIndex>& rclRes
) const;
/** Returns true if the distance from the \a rclPt to the facet \a ulFacetIdx is less than \a
* fMaxDistance. If this restriction is met \a rfDistance is set to the actual distance,
* otherwise false is returned.
*/
bool Distance(
const Base::Vector3f& rclPt,
FacetIndex ulFacetIdx,
float fMaxDistance,
float& rfDistance
) const;
/**
* Calculates the minimum grid length so that not more elements than \a maxElements will be
* created when the grid gets built up. The minimum grid length must be at least \a fLength.
*/
float CalculateMinimumGridLength(
float fLength,
const Base::BoundBox3f& rBBox,
unsigned long maxElements
) const;
protected:
/** Helper method to connect the intersection points to polylines. */
bool ConnectLines(
std::list<std::pair<Base::Vector3f, Base::Vector3f>>& rclLines,
std::list<std::vector<Base::Vector3f>>& rclPolylines,
float fMinEps
) const;
bool ConnectPolygons(
std::list<std::vector<Base::Vector3f>>& clPolyList,
std::list<std::pair<Base::Vector3f, Base::Vector3f>>& rclLines
) const;
/** Searches the nearest facet in \a raulFacets to the ray (\a rclPt, \a rclDir). */
bool RayNearestField(
const Base::Vector3f& rclPt,
const Base::Vector3f& rclDir,
const std::vector<FacetIndex>& raulFacets,
Base::Vector3f& rclRes,
FacetIndex& rulFacet,
float fMaxAngle = Mathf::PI
) const;
/**
* Splits the boundary \a rBound in several loops and append this loops to the list of borders.
*/
void SplitBoundaryLoops(
const std::vector<PointIndex>& rBound,
std::list<std::vector<PointIndex>>& aBorders
);
/**
* From the given \a openEdges a boundary is split and added to \a boundary.
*/
void SplitBoundaryFromOpenEdges(
std::list<std::pair<PointIndex, PointIndex>>& openEdges,
std::list<PointIndex>& boundary
) const;
private:
const MeshKernel& _rclMesh; /**< The mesh kernel. */
};
class MeshExport MeshCollector
{
public:
MeshCollector() = default;
virtual ~MeshCollector() = default;
MeshCollector(const MeshCollector&) = default;
MeshCollector(MeshCollector&&) = default;
MeshCollector& operator=(const MeshCollector&) = default;
MeshCollector& operator=(MeshCollector&&) = default;
virtual void Append(const MeshCore::MeshKernel&, FacetIndex index) = 0;
};
class MeshExport PointCollector: public MeshCollector
{
public:
explicit PointCollector(std::vector<PointIndex>& ind)
: indices(ind)
{}
void Append(const MeshCore::MeshKernel& kernel, FacetIndex index) override
{
PointIndex ulP1 {}, ulP2 {}, ulP3 {};
kernel.GetFacetPoints(index, ulP1, ulP2, ulP3);
indices.push_back(ulP1);
indices.push_back(ulP2);
indices.push_back(ulP3);
}
private:
std::vector<PointIndex>& indices;
};
class MeshExport FacetCollector: public MeshCollector
{
public:
explicit FacetCollector(std::vector<FacetIndex>& ind)
: indices(ind)
{}
void Append(const MeshCore::MeshKernel&, FacetIndex index) override
{
indices.push_back(index);
}
private:
std::vector<FacetIndex>& indices;
};
/**
* The MeshRefPointToFacets builds up a structure to have access to all facets indexing
* a point.
* \note If the underlying mesh kernel gets changed this structure becomes invalid and must
* be rebuilt.
*/
class MeshExport MeshRefPointToFacets
{
public:
/// Construction
explicit MeshRefPointToFacets(const MeshKernel& rclM)
: _rclMesh(rclM)
{
Rebuild();
}
/// Rebuilds up data structure
void Rebuild();
const std::set<FacetIndex>& operator[](PointIndex) const;
std::vector<FacetIndex> GetIndices(PointIndex, PointIndex) const;
std::vector<FacetIndex> GetIndices(PointIndex, PointIndex, PointIndex) const;
MeshFacetArray::_TConstIterator GetFacet(FacetIndex) const;
std::set<PointIndex> NeighbourPoints(const std::vector<PointIndex>&, int level) const;
std::set<PointIndex> NeighbourPoints(PointIndex) const;
void Neighbours(FacetIndex ulFacetInd, float fMaxDist, MeshCollector& collect) const;
Base::Vector3f GetNormal(PointIndex) const;
void AddNeighbour(PointIndex, FacetIndex);
void RemoveNeighbour(PointIndex, FacetIndex);
void RemoveFacet(FacetIndex);
protected:
void SearchNeighbours(
const MeshFacetArray& rFacets,
FacetIndex index,
const Base::Vector3f& rclCenter,
float fMaxDist,
std::set<FacetIndex>& visit,
MeshCollector& collect
) const;
private:
const MeshKernel& _rclMesh; /**< The mesh kernel. */
std::vector<std::set<FacetIndex>> _map;
};
/**
* The MeshRefFacetToFacets builds up a structure to have access to all facets sharing
* at least one same point.
* \note If the underlying mesh kernel gets changed this structure becomes invalid and must
* be rebuilt.
*/
class MeshExport MeshRefFacetToFacets
{
public:
/// Construction
explicit MeshRefFacetToFacets(const MeshKernel& rclM)
: _rclMesh(rclM)
{
Rebuild();
}
/// Rebuilds up data structure
void Rebuild();
/// Returns a set of facets sharing one or more points with the facet with
/// index \a ulFacetIndex.
const std::set<FacetIndex>& operator[](FacetIndex) const;
/// Returns an array of common facets of the passed facet indexes.
std::vector<FacetIndex> GetIndices(FacetIndex, FacetIndex) const;
private:
const MeshKernel& _rclMesh; /**< The mesh kernel. */
std::vector<std::set<FacetIndex>> _map;
};
/**
* The MeshRefPointToPoints builds up a structure to have access to all neighbour points
* of a point. Two points are neighbours if there is an edge indexing both points.
* \note If the underlying mesh kernel gets changed this structure becomes invalid and must
* be rebuilt.
*/
class MeshExport MeshRefPointToPoints
{
public:
/// Construction
explicit MeshRefPointToPoints(const MeshKernel& rclM)
: _rclMesh(rclM)
{
Rebuild();
}
/// Rebuilds up data structure
void Rebuild();
const std::set<PointIndex>& operator[](PointIndex) const;
Base::Vector3f GetNormal(PointIndex) const;
float GetAverageEdgeLength(PointIndex) const;
void AddNeighbour(PointIndex, PointIndex);
void RemoveNeighbour(PointIndex, PointIndex);
private:
const MeshKernel& _rclMesh; /**< The mesh kernel. */
std::vector<std::set<PointIndex>> _map;
};
/**
* The MeshRefEdgeToFacets builds up a structure to have access to all facets
* of an edge. On a manifold mesh an edge has one or two facets associated.
* \note If the underlying mesh kernel gets changed this structure becomes invalid and must
* be rebuilt.
*/
class MeshExport MeshRefEdgeToFacets
{
public:
/// Construction
explicit MeshRefEdgeToFacets(const MeshKernel& rclM)
: _rclMesh(rclM)
{
Rebuild();
}
/// Rebuilds up data structure
void Rebuild();
const std::pair<FacetIndex, FacetIndex>& operator[](const MeshEdge&) const;
private:
class EdgeOrder
{
public:
bool operator()(const MeshEdge& e1, const MeshEdge& e2) const
{
if (e1.first < e2.first) {
return true;
}
if (e1.first > e2.first) {
return false;
}
if (e1.second < e2.second) {
return true;
}
return false;
}
};
using MeshFacetPair = std::pair<FacetIndex, FacetIndex>;
const MeshKernel& _rclMesh; /**< The mesh kernel. */
std::map<MeshEdge, MeshFacetPair, EdgeOrder> _map;
};
/**
* The MeshRefNormalToPoints builds up a structure to have access to the normal of a vertex.
* \note If the underlying mesh kernel gets changed this structure becomes invalid and must
* be rebuilt.
*/
class MeshExport MeshRefNormalToPoints
{
public:
/// Construction
explicit MeshRefNormalToPoints(const MeshKernel& rclM)
: _rclMesh(rclM)
{
Rebuild();
}
/// Rebuilds up data structure
void Rebuild();
const Base::Vector3f& operator[](PointIndex) const;
const std::vector<Base::Vector3f>& GetValues() const
{
return _norm;
}
private:
const MeshKernel& _rclMesh; /**< The mesh kernel. */
std::vector<Base::Vector3f> _norm;
};
} // namespace MeshCore
#endif // MESH_ALGORITHM_H
|