/************************************************************************ ** ** @file ** @author Roman Telezhynskyi ** @date 3 11, 2016 ** ** @brief ** @copyright ** This source code is part of the Valentina project, a pattern making ** program, whose allow create and modeling patterns of clothing. ** Copyright (C) 2016 Valentina project ** All Rights Reserved. ** ** Valentina 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, either version 3 of the License, or ** (at your option) any later version. ** ** Valentina 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 Valentina. If not, see . ** *************************************************************************/ #ifndef VABSTRACTPIECE_H #define VABSTRACTPIECE_H #include #include #include #include #include #include "../vmisc/diagnostic.h" #include "../vmisc/def.h" #include "../vmisc/compatibility.h" #include "../vgeometry/vgobject.h" #include "vsapoint.h" #include "testpath.h" class VAbstractPieceData; class QPainterPath; class VGrainlineData; class VContainer; class VRawSAPoint; class VAbstractPiece { Q_DECLARE_TR_FUNCTIONS(VAbstractPiece) public: VAbstractPiece(); VAbstractPiece(const VAbstractPiece &piece); virtual ~VAbstractPiece(); VAbstractPiece &operator=(const VAbstractPiece &piece); #ifdef Q_COMPILER_RVALUE_REFS VAbstractPiece(const VAbstractPiece &&piece) Q_DECL_NOTHROW; VAbstractPiece &operator=(VAbstractPiece &&piece) Q_DECL_NOTHROW; #endif QString GetName() const; void SetName(const QString &value); bool IsForbidFlipping() const; void SetForbidFlipping(bool value); bool IsForceFlipping() const; void SetForceFlipping(bool value); bool IsSeamAllowance() const; void SetSeamAllowance(bool value); bool IsSeamAllowanceBuiltIn() const; void SetSeamAllowanceBuiltIn(bool value); bool IsHideMainPath() const; void SetHideMainPath(bool value); qreal GetSAWidth() const; void SetSAWidth(qreal value); qreal GetMx() const; void SetMx(qreal value); qreal GetMy() const; void SetMy(qreal value); uint GetPriority() const; void SetPriority(uint value); static QVector Equidistant(QVector points, qreal width, const QString &name); static qreal SumTrapezoids(const QVector &points); static QVector CheckLoops(const QVector &points); static QVector CheckLoops(const QVector &points); static QVector EkvPoint(QVector points, const VSAPoint &p1Line1, const VSAPoint &p2Line1, const VSAPoint &p1Line2, const VSAPoint &p2Line2, qreal width, bool *needRollback = nullptr); static QLineF ParallelLine(const VSAPoint &p1, const VSAPoint &p2, qreal width); static bool IsAllowanceValid(const QVector &base, const QVector &allowance); template static bool IsInsidePolygon(const QVector &path, const QVector &polygon, qreal accuracy = accuracyPointOnLine); template static QVector CorrectEquidistantPoints(const QVector &points, bool removeFirstAndLast = true); static QVector RollbackSeamAllowance(QVector points, const QLineF &cuttingEdge, bool *success); static QVector GrainlinePoints(const VGrainlineData &geom, const VContainer *pattern, const QRectF &boundingRect, qreal &dAng); static QPainterPath PainterPath(const QVector &points); friend QDataStream& operator<< (QDataStream& dataStream, const VAbstractPiece& piece); friend QDataStream& operator>> (QDataStream& dataStream, VAbstractPiece& piece); protected: template static QVector RemoveDublicates(const QVector &points, bool removeFirstAndLast = true); static bool IsEkvPointOnLine(const QPointF &iPoint, const QPointF &prevPoint, const QPointF &nextPoint); static bool IsEkvPointOnLine(const VSAPoint &iPoint, const VSAPoint &prevPoint, const VSAPoint &nextPoint); static bool IsItemContained(const QRectF &parentBoundingRect, const QVector &shape, qreal &dX, qreal &dY); static QVector CorrectPosition(const QRectF &parentBoundingRect, QVector points); static bool FindGrainlineGeometry(const VGrainlineData& geom, const VContainer *pattern, qreal &length, qreal &rotationAngle, QPointF &pos); private: QSharedDataPointer d; }; Q_DECLARE_TYPEINFO(VAbstractPiece, Q_MOVABLE_TYPE); //--------------------------------------------------------------------------------------------------------------------- /** * @brief CorrectEquidistantPoints clear equivalent points and remove point on line from equdistant. * @param points list of points equdistant. * @return corrected list. */ template QVector VAbstractPiece::CorrectEquidistantPoints(const QVector &points, bool removeFirstAndLast) { // DumpVector(points, QStringLiteral("input.json.XXXXXX")); // Uncomment for dumping test data if (points.size()<4)//Better don't check if only three points. We can destroy equidistant. { qDebug()<<"Only three points."; return points; } //Clear equivalent points QVector buf1 = RemoveDublicates(points, removeFirstAndLast); if (buf1.size()<3) { return buf1; } int prev = -1; int next = -1; QVector buf2; //Remove point on line for (qint32 i = 0; i < buf1.size(); ++i) {// In this case we alwayse will have bounded intersection, so all is need is to check if point i is on line. // Unfortunatelly QLineF::intersect can't be used in this case because of the floating-point accuraccy problem. if (prev == -1) { if (i == 0) { prev = buf1.size() - 1; const T &prevPoint = buf1.at(prev); const T &iPoint = buf1.at(i); if (iPoint == prevPoint) { prev = buf1.size() - 2; } } else { prev = i-1; } } if (i == buf1.size() - 1) { next = 0; const T &nextPoint = buf1.at(next); const T &iPoint = buf1.at(i); if (iPoint == nextPoint) { next = 1; } } else { next = i+1; } const T &iPoint = buf1.at(i); const T &prevPoint = buf1.at(prev); const T &nextPoint = buf1.at(next); if (not IsEkvPointOnLine(iPoint, prevPoint, nextPoint)) { buf2.append(iPoint); prev = -1; } } if (not buf2.isEmpty() && buf2.first() != buf2.last()) { buf2.append(buf2.first()); } buf2 = RemoveDublicates(buf2, false); // DumpVector(buf2, QStringLiteral("output.json.XXXXXX")); // Uncomment for dumping test data return buf2; } //--------------------------------------------------------------------------------------------------------------------- template QVector VAbstractPiece::RemoveDublicates(const QVector &points, bool removeFirstAndLast) { QVector p = points; if (removeFirstAndLast) { if (not p.isEmpty() && p.size() > 1) { // Path can't be closed // See issue #686 if (VFuzzyComparePoints(p.first(), p.last())) { p.removeLast(); } } } for (int i = 0; i < p.size()-1; ++i) { if (VFuzzyComparePoints(p.at(i), p.at(i+1))) { if (not removeFirstAndLast && (i == p.size()-2)) { p.erase(p.begin() + i); } else { p.erase(p.begin() + i + 1); } --i; } } return p; } //--------------------------------------------------------------------------------------------------------------------- template bool VAbstractPiece::IsInsidePolygon(const QVector &path, const QVector &polygon, qreal accuracy) { // Edges must not intersect for (auto i = 0; i < path.count(); ++i) { int nextI = -1; if (i < path.count()-1) { nextI = i + 1; } else { nextI = 0; } QLineF baseSegment(path.at(i), path.at(nextI)); if (baseSegment.isNull()) { continue; } for (auto j = 0; j < polygon.count(); ++j) { int nextJ = -1; if (j < polygon.count()-1) { nextJ = j + 1; } else { nextJ = 0; } QLineF allowanceSegment(polygon.at(j), polygon.at(nextJ)); if (allowanceSegment.isNull()) { continue; } QPointF crosPoint; const auto type = Intersects(baseSegment, allowanceSegment, &crosPoint); if (type == QLineF::BoundedIntersection && not VFuzzyComparePoints(baseSegment.p1(), crosPoint, accuracy) && not VFuzzyComparePoints(baseSegment.p2(), crosPoint, accuracy) && not VGObject::IsPointOnLineviaPDP(allowanceSegment.p1(), baseSegment.p1(), baseSegment.p2(), accuracy) && not VGObject::IsPointOnLineviaPDP(allowanceSegment.p2(), baseSegment.p1(), baseSegment.p2(), accuracy)) { return false; } } } // Just instersection edges is not enough. The base must be inside of the allowance. QPolygonF allowancePolygon(polygon); for (auto &point : path) { if (not allowancePolygon.containsPoint(point, Qt::WindingFill)) { return false; } } return true; } #endif // VABSTRACTPIECE_H