Loading...
Searching...
No Matches
pslgprep.h
Go to the documentation of this file.
1
26
27#ifndef OPENSWMMVIS_MESH_PSLGPREP_H
28#define OPENSWMMVIS_MESH_PSLGPREP_H
29
30#include "mesh/meshgenerator.h"
31
32#include <QPointF>
33#include <QPolygonF>
34#include <QRectF>
35#include <QVector>
36
37#include <functional>
38
39namespace mesh
40{
41namespace pslg
42{
43
59[[nodiscard]] QVector<QPointF> simplifyPolyline(const QVector<QPointF> &pts, double epsilon);
60
76[[nodiscard]] QVector<QPointF> simplifyRing(const QVector<QPointF> &ring, double epsilon);
77
115[[nodiscard]] QVector<QPointF> trimByStraightness(const QVector<QPointF> &pts, double maxTurnDeg,
116 double maxDeviation,
117 const QVector<bool> &protectedFlags = {},
118 bool closed = false, int *removedOut = nullptr);
119
147[[nodiscard]] QVector<QPointF> resampleAtSize(const QVector<QPointF> &path,
148 const std::function<double(double, double)> &hAt,
149 bool canonicalSegments = false);
150
166[[nodiscard]] QVector<bool> flagsForCoincidentVertices(const QVector<QPointF> &pts,
167 const QVector<QVector<QPointF>> &others,
168 double tol);
169
184[[nodiscard]] QVector<QPointF> densifyRing(const QVector<QPointF> &ring, double maxLen);
185
196[[nodiscard]] double polylineLength(const QVector<QPointF> &pts);
197
223[[nodiscard]] QVector<QPointF>
224unfoldPolyline(const QVector<QPointF> &pts, double maxTurnDeg = 150.0, bool *changedOut = nullptr);
225
256[[nodiscard]] QVector<QPointF> resampleMinLength(const QVector<QPointF> &pts, double minLen,
257 double maxDeviation, int *flaggedOut = nullptr);
258
279[[nodiscard]] QVector<QPointF> resampleRingMinLength(const QVector<QPointF> &ring, double minLen,
280 double maxDeviation,
281 int *flaggedOut = nullptr);
282
295[[nodiscard]] double ringSignedArea(const QVector<QPointF> &ring);
296
308[[nodiscard]] double distSqToSegment(const QPointF &p, const QPointF &a, const QPointF &b);
309
328void snapAndDedupe(QVector<mesh::SteinerPoint> &pts, double snapEps);
329
349[[nodiscard]] QVector<bool> greedyMinSeparation(const QVector<QPointF> &pts, double minSep);
350
359 QVector<QPointF> ring;
360 QPointF seed;
361 bool valid = false;
362};
363
383[[nodiscard]] PreparedRing prepareHoleRing(const QVector<QPointF> &raw, double simplifyEps,
384 double maxEdgeLen, double trimTurnDeg = 0.0,
385 double trimDeviation = 0.0);
386
417bool prepareHoleRings(const QVector<QVector<QPointF>> &raw, double simplifyEps, double maxEdgeLen,
418 QVector<PreparedRing> *out, const std::function<bool()> &isCancelled = {},
419 const std::function<void(int, int)> &onChunk = {}, int *skippedOut = nullptr,
420 double trimTurnDeg = 0.0, double trimDeviation = 0.0);
421
433{
434public:
451 void build(const QVector<QPolygonF> &domains, const QVector<QVector<QPointF>> &holes = {},
452 int nBands = 1024);
453
464 [[nodiscard]] bool contains(const QPointF &p) const;
470 [[nodiscard]] bool covers(const QPointF &p) const;
477 [[nodiscard]] QRectF boundingBox() const;
484 [[nodiscard]] bool isEmpty() const { return m_crossingEdges == 0; }
485
486private:
500 void addRing(const QVector<QPointF> &ring, int owner);
501
502 QVector<QPair<QPointF, QPointF>> m_edges;
503 QVector<int> m_owners;
504 int m_crossingEdges = 0;
505 QVector<QVector<int>> m_bandEdges;
506 double m_x0 = 0.0, m_x1 = 0.0, m_y0 = 0.0, m_y1 = 0.0;
507 double m_bandH = 0.0;
508 int m_nBands = 0;
509};
510
511} // namespace pslg
512} // namespace mesh
513
514#endif // OPENSWMMVIS_MESH_PSLGPREP_H
y-banded odd-even point-in-rings index.
Definition pslgprep.h:433
bool isEmpty() const
Check whether the index stores any crossing-capable ring edges.
Definition pslgprep.h:484
void build(const QVector< QPolygonF > &domains, const QVector< QVector< QPointF > > &holes={}, int nBands=1024)
Replace the odd-even ring index with owned y-banded edge copies.
Definition pslgprep.cpp:824
bool contains(const QPointF &p) const
Test one point using the indexed global even-odd crossing parity.
Definition pslgprep.cpp:866
bool covers(const QPointF &p) const
Union of domain interiors minus hole interiors, including exact authored boundary vertices/edges.
Definition pslgprep.cpp:887
QRectF boundingBox() const
Read the domain-vertex extent used to bound indexed queries.
Definition pslgprep.cpp:909
2D mesh generator (workplans/MESH_TRIANGLE_ENGINE_PLAN_2026-09-30.md): a constrained Delaunay triangu...
Preparation of planar straight-line graphs (PSLG) for meshing: Ramer–Douglas–Peucker simplification,...
QVector< QPointF > densifyRing(const QVector< QPointF > &ring, double maxLen)
Insert equal-length subdivisions along every explicitly present consecutive path edge.
Definition pslgprep.cpp:361
void snapAndDedupe(QVector< mesh::SteinerPoint > &pts, double snapEps)
Drop duplicate untagged Steiner points by rounded spatial-grid key without moving coordinates.
Definition pslgprep.cpp:651
QVector< bool > greedyMinSeparation(const QVector< QPointF > &pts, double minSep)
Keep points in priority order when no previously kept point is strictly closer than minSep.
Definition pslgprep.cpp:683
QVector< QPointF > simplifyPolyline(const QVector< QPointF > &pts, double epsilon)
Return an endpoint-preserving Ramer-Douglas-Peucker subsequence of an open path.
Definition pslgprep.cpp:91
QVector< bool > flagsForCoincidentVertices(const QVector< QPointF > &pts, const QVector< QVector< QPointF > > &others, double tol)
Flag query vertices within an inclusive tolerance of any vertex in other paths.
Definition pslgprep.cpp:325
PreparedRing prepareHoleRing(const QVector< QPointF > &raw, double simplifyEps, double maxEdgeLen, double trimTurnDeg=0.0, double trimDeviation=0.0)
Trim, simplify, validate, densify and seed one borrowed hole boundary.
Definition pslgprep.cpp:729
QVector< QPointF > simplifyRing(const QVector< QPointF > &ring, double epsilon)
Simplify a ring's open vertex sequence and restore its existing closure convention.
Definition pslgprep.cpp:107
double distSqToSegment(const QPointF &p, const QPointF &a, const QPointF &b)
Compute squared point-to-closed-segment distance using clamped projection.
Definition pslgprep.cpp:635
QVector< QPointF > resampleMinLength(const QVector< QPointF > &pts, double minLen, double maxDeviation, int *flaggedOut=nullptr)
Remove intermediate path vertices while respecting an original-point chord-deviation cap.
Definition pslgprep.cpp:501
double ringSignedArea(const QVector< QPointF > &ring)
Compute the ordinary double-precision shoelace area of an implicitly closed ring.
Definition pslgprep.cpp:392
QVector< QPointF > resampleRingMinLength(const QVector< QPointF > &ring, double minLen, double maxDeviation, int *flaggedOut=nullptr)
Apply minimum-length decimation to a ring while preserving at least three corners.
Definition pslgprep.cpp:586
QVector< QPointF > resampleAtSize(const QVector< QPointF > &path, const std::function< double(double, double)> &hAt, bool canonicalSegments=false)
Insert collinear samples according to a numerically integrated local target-size callback.
Definition pslgprep.cpp:252
double polylineLength(const QVector< QPointF > &pts)
Sum Euclidean lengths of consecutive explicitly stored path edges.
Definition pslgprep.cpp:384
QVector< QPointF > unfoldPolyline(const QVector< QPointF > &pts, double maxTurnDeg=150.0, bool *changedOut=nullptr)
Heuristically reorder reversed interior alignments and drop excessive backtracking turns.
Definition pslgprep.cpp:457
bool prepareHoleRings(const QVector< QVector< QPointF > > &raw, double simplifyEps, double maxEdgeLen, QVector< PreparedRing > *out, const std::function< bool()> &isCancelled={}, const std::function< void(int, int)> &onChunk={}, int *skippedOut=nullptr, double trimTurnDeg=0.0, double trimDeviation=0.0)
Prepare hole rings in order-preserving synchronous parallel chunks of at most 4096.
Definition pslgprep.cpp:759
QVector< QPointF > trimByStraightness(const QVector< QPointF > &pts, double maxTurnDeg, double maxDeviation, const QVector< bool > &protectedFlags={}, bool closed=false, int *removedOut=nullptr)
Remove flattest eligible vertices while preserving original-span chord deviation limits.
Definition pslgprep.cpp:138
The Qt-facing MeshKit API (meshkit::core_qt, meshkit::model_qt, meshkit::io_qt): mesh value types and...
One hole ring after preparation for the PSLG.
Definition pslgprep.h:358
QVector< QPointF > ring
simplified + densified boundary (mesh CRS)
Definition pslgprep.h:359
bool valid
false → degenerate or self-intersecting
Definition pslgprep.h:361
QPointF seed
interior seed point for the hole carve
Definition pslgprep.h:360