44[[nodiscard]] QVector<QPointF>
cleanPolyline(
const QVector<QPointF> &v,
80 const QPointF &from,
const QPointF &to);
90[[nodiscard]]
double polylineLength(
const QVector<QPointF> &vertices);
100[[nodiscard]] QVector<QPointF>
replacedAt(
const QVector<QPointF> &vertices,
int index,
101 const QPointF &newPt);
112[[nodiscard]] QVector<QPointF>
insertedAt(
const QVector<QPointF> &vertices,
int index,
113 const QPointF &newPt);
124[[nodiscard]] QVector<QPointF>
removedAt(
const QVector<QPointF> &vertices,
int index);
140[[nodiscard]]
double distanceToPolyline(
const QVector<QPointF> &vertices,
const QPointF &point,
141 int *segmentIndex =
nullptr,
142 QPointF *closestPoint =
nullptr);
151[[nodiscard]]
double polygonArea(
const QVector<QPointF> &polygon);
202[[nodiscard]]
bool pointInRing(
const QVector<QPointF> &ring,
const QPointF &pt);
218[[nodiscard]]
double netArea(
const RingPolygon &p);
226[[nodiscard]]
bool containsPoint(
const RingPolygon &p,
const QPointF &pt);
239[[nodiscard]] QPointF
interiorPoint(
const QVector<QPointF> &ring);
Pure geometry helpers for map editing: ring validation, interior points and related checks,...
bool containsPoint(const RingPolygon &p, const QPointF &pt)
True when pt is inside the exterior and outside every hole.
Definition editgeometry.cpp:349
double polygonArea(const QVector< QPointF > &polygon)
Compute the area of a polygon using the shoelace formula.
Definition editgeometry.cpp:181
QVector< QPointF > cleanPolyline(const QVector< QPointF > &v, double tol=kCoincidenceTol)
Drop consecutive coincident points from a polyline.
Definition editgeometry.cpp:38
RingValidity
Validity classes for a RingPolygon (in-house checks, no GEOS).
Definition editgeometry.h:242
@ HoleOutsideExterior
A hole escapes / crosses the exterior.
Definition editgeometry.h:246
@ SelfIntersecting
Exterior or a hole crosses itself.
Definition editgeometry.h:245
@ Ok
Every check passed.
Definition editgeometry.h:243
@ TooFewVertices
Exterior or a hole has < 3 vertices.
Definition editgeometry.h:244
@ HolesOverlap
Two holes overlap or nest.
Definition editgeometry.h:247
QVector< QPointF > replacedAt(const QVector< QPointF > &vertices, int index, const QPointF &newPt)
Replace one endpoint of a polyline, producing a new vector.
Definition editgeometry.cpp:98
RingPolygon normalizeRingPolygon(RingPolygon p, double tol=kCoincidenceTol)
Clean every ring (dedupe + de-close), drop degenerate interior rings, and orient exterior CCW / inter...
Definition editgeometry.cpp:323
RingValidity validateRingPolygon(const RingPolygon &p)
Validate a RingPolygon with in-house geometry checks (O(n^2) edge tests; intended for hand-digitized ...
Definition editgeometry.cpp:416
constexpr double kCoincidenceTol
Default coincidence tolerance, in layer-CRS units.
Definition editgeometry.h:30
double netArea(const RingPolygon &p)
Net area = |exterior| − Σ|holes|, clamped to >= 0.
Definition editgeometry.cpp:341
QVector< QPointF > orientInteriorToEndpoints(QVector< QPointF > interior, const QPointF &from, const QPointF &to)
Orient a link's interior bend points to run from from toward to.
Definition editgeometry.cpp:68
bool pointInRing(const QVector< QPointF > &ring, const QPointF &pt)
Even-odd point-in-ring test (boundary result is unspecified but stable).
Definition editgeometry.cpp:304
double distanceToPolyline(const QVector< QPointF > &vertices, const QPointF &point, int *segmentIndex=nullptr, QPointF *closestPoint=nullptr)
Distance from a point to the nearest point on a polyline segment.
Definition editgeometry.cpp:133
double signedRingArea(const QVector< QPointF > &ring)
Signed area of a ring via the shoelace formula.
Definition editgeometry.cpp:290
QVector< QPointF > insertedAt(const QVector< QPointF > &vertices, int index, const QPointF &newPt)
Insert a vertex at index, producing a new polyline of size+1.
Definition editgeometry.cpp:106
QPointF interiorPoint(const QVector< QPointF > &ring)
A point guaranteed strictly interior to a simple ring — robust for non-convex rings — suitable as a t...
Definition editgeometry.cpp:359
QVector< QPointF > removedAt(const QVector< QPointF > &vertices, int index)
Remove the vertex at index, producing a new polyline of size-1.
Definition editgeometry.cpp:117
double polylineLength(const QVector< QPointF > &vertices)
Compute the total length of a polyline.
Definition editgeometry.cpp:84
QVector< QPointF > cleanPolygonRing(const QVector< QPointF > &v, double tol=kCoincidenceTol)
Normalize a polygon ring: collapse coincident points and drop a redundant explicit closing vertex.
Definition editgeometry.cpp:55
A polygon: exactly one exterior ring + zero-or-more interior rings.
Definition editgeometry.h:170
int holeCount() const
Count stored interior rings without validating them.
Definition editgeometry.h:183
bool isEmpty() const
Test only whether the exterior has enough vertices to form a ring.
Definition editgeometry.h:178
QVector< QPointF > exterior
Outer boundary (open ring, >= 3 pts).
Definition editgeometry.h:171
QVector< QVector< QPointF > > interiors
Holes; each an open ring (>= 3 pts).
Definition editgeometry.h:172