2014-06-25 16:08:12 +02:00
|
|
|
/************************************************************************
|
|
|
|
**
|
|
|
|
** @file vabstractcurve.cpp
|
|
|
|
** @author Roman Telezhynskyi <dismine(at)gmail.com>
|
|
|
|
** @date 25 6, 2014
|
|
|
|
**
|
|
|
|
** @brief
|
|
|
|
** @copyright
|
|
|
|
** This source code is part of the Valentine project, a pattern making
|
|
|
|
** program, whose allow create and modeling patterns of clothing.
|
2015-02-27 11:27:48 +01:00
|
|
|
** Copyright (C) 2013-2015 Valentina project
|
2014-06-25 16:08:12 +02:00
|
|
|
** <https://bitbucket.org/dismine/valentina> 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 <http://www.gnu.org/licenses/>.
|
|
|
|
**
|
|
|
|
*************************************************************************/
|
|
|
|
|
|
|
|
#include "vabstractcurve.h"
|
2016-02-15 15:30:48 +01:00
|
|
|
#include "vabstractcurve_p.h"
|
2014-06-25 16:08:12 +02:00
|
|
|
|
2014-07-13 14:49:00 +02:00
|
|
|
#include <QPainterPath>
|
2014-10-03 12:32:12 +02:00
|
|
|
#include <QDebug>
|
2014-07-13 14:49:00 +02:00
|
|
|
|
2014-06-25 16:08:12 +02:00
|
|
|
VAbstractCurve::VAbstractCurve(const GOType &type, const quint32 &idObject, const Draw &mode)
|
2016-02-15 15:30:48 +01:00
|
|
|
:VGObject(type, idObject, mode), d (new VAbstractCurveData())
|
2014-06-25 16:08:12 +02:00
|
|
|
{}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
VAbstractCurve::VAbstractCurve(const VAbstractCurve &curve)
|
2016-02-15 15:30:48 +01:00
|
|
|
:VGObject(curve), d (curve.d)
|
2014-06-25 16:08:12 +02:00
|
|
|
{}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
VAbstractCurve &VAbstractCurve::operator=(const VAbstractCurve &curve)
|
|
|
|
{
|
2014-07-27 14:30:28 +02:00
|
|
|
if ( &curve == this )
|
|
|
|
{
|
|
|
|
return *this;
|
|
|
|
}
|
2014-06-25 16:08:12 +02:00
|
|
|
VGObject::operator=(curve);
|
2016-02-15 15:30:48 +01:00
|
|
|
d = curve.d;
|
2014-06-25 16:08:12 +02:00
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2016-02-15 15:30:48 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
VAbstractCurve::~VAbstractCurve()
|
|
|
|
{}
|
|
|
|
|
2014-12-15 15:25:40 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2014-12-17 13:56:14 +01:00
|
|
|
QVector<QPointF> VAbstractCurve::GetSegmentPoints(const QPointF &begin, const QPointF &end, bool reverse) const
|
2014-12-15 15:25:40 +01:00
|
|
|
{
|
|
|
|
QVector<QPointF> points = GetPoints();
|
2014-12-17 13:56:14 +01:00
|
|
|
if (reverse)
|
2014-12-16 14:33:00 +01:00
|
|
|
{
|
2014-12-17 13:56:14 +01:00
|
|
|
points = GetReversePoints(points);
|
2014-12-16 14:33:00 +01:00
|
|
|
}
|
2014-12-15 15:25:40 +01:00
|
|
|
points = FromBegin(points, begin);
|
|
|
|
points = ToEnd(points, end);
|
|
|
|
return points;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2014-12-21 12:35:12 +01:00
|
|
|
QVector<QPointF> VAbstractCurve::FromBegin(const QVector<QPointF> &points, const QPointF &begin)
|
2014-12-15 15:25:40 +01:00
|
|
|
{
|
|
|
|
if (points.count() >= 2)
|
|
|
|
{
|
|
|
|
QVector<QPointF> segment;
|
|
|
|
bool theBegin = false;
|
|
|
|
for (qint32 i = 0; i < points.count()-1; ++i)
|
|
|
|
{
|
|
|
|
if (theBegin == false)
|
|
|
|
{
|
2016-01-08 16:59:51 +01:00
|
|
|
if (IsPointOnLineSegment(begin, points.at(i), points.at(i+1)))
|
2014-12-15 15:25:40 +01:00
|
|
|
{
|
|
|
|
theBegin = true;
|
|
|
|
segment.append(begin);
|
|
|
|
if (i == points.count()-2)
|
|
|
|
{
|
|
|
|
segment.append(points.at(i+1));
|
|
|
|
}
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
segment.append(points.at(i));
|
|
|
|
if (i == points.count()-2)
|
|
|
|
{
|
|
|
|
segment.append(points.at(i+1));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (segment.isEmpty())
|
|
|
|
{
|
|
|
|
return points;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return segment;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return points;
|
|
|
|
}
|
|
|
|
return points;
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2015-04-15 14:44:57 +02:00
|
|
|
QVector<QPointF> VAbstractCurve::ToEnd(const QVector<QPointF> &points, const QPointF &end)
|
2014-12-15 15:25:40 +01:00
|
|
|
{
|
|
|
|
QVector<QPointF> reversed = GetReversePoints(points);
|
|
|
|
reversed = FromBegin(reversed, end);
|
|
|
|
return GetReversePoints(reversed);
|
|
|
|
}
|
|
|
|
|
2014-06-25 16:08:12 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2014-08-17 16:22:30 +02:00
|
|
|
QPainterPath VAbstractCurve::GetPath(PathDirection direction) const
|
2014-06-25 16:08:12 +02:00
|
|
|
{
|
|
|
|
QPainterPath path;
|
|
|
|
|
|
|
|
QVector<QPointF> points = GetPoints();
|
|
|
|
if (points.count() >= 2)
|
|
|
|
{
|
|
|
|
for (qint32 i = 0; i < points.count()-1; ++i)
|
|
|
|
{
|
|
|
|
path.moveTo(points.at(i));
|
|
|
|
path.lineTo(points.at(i+1));
|
|
|
|
}
|
2014-08-17 16:22:30 +02:00
|
|
|
|
|
|
|
if (direction == PathDirection::Show && points.count() >= 3)
|
|
|
|
{
|
|
|
|
path.addPath(ShowDirection(points));
|
|
|
|
}
|
2014-06-25 16:08:12 +02:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
qDebug()<<"points.count() < 2"<<Q_FUNC_INFO;
|
|
|
|
}
|
|
|
|
return path;
|
|
|
|
}
|
2014-08-17 16:22:30 +02:00
|
|
|
|
2014-10-23 10:38:57 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
/**
|
|
|
|
* @brief IntersectLine return list of points for real intersection with line
|
|
|
|
* @param line line that intersect with curve
|
|
|
|
* @return list of intersection points
|
|
|
|
*/
|
|
|
|
QVector<QPointF> VAbstractCurve::IntersectLine(const QLineF &line) const
|
|
|
|
{
|
2016-01-24 17:15:08 +01:00
|
|
|
return CurveIntersectLine(this->GetPoints(), line);
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
bool VAbstractCurve::IsIntersectLine(const QLineF &line) const
|
|
|
|
{
|
|
|
|
const QVector<QPointF> points = IntersectLine(line);
|
|
|
|
return not points.isEmpty();
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2016-02-15 15:30:48 +01:00
|
|
|
quint32 VAbstractCurve::GetDuplicate() const
|
|
|
|
{
|
|
|
|
return d->duplicate;
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
void VAbstractCurve::SetDuplicate(quint32 number)
|
|
|
|
{
|
|
|
|
d->duplicate = number;
|
|
|
|
CreateName();
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2016-01-24 17:15:08 +01:00
|
|
|
QVector<QPointF> VAbstractCurve::CurveIntersectLine(const QVector<QPointF> &points, const QLineF &line)
|
|
|
|
{
|
2014-10-23 10:38:57 +02:00
|
|
|
QVector<QPointF> intersections;
|
2016-01-24 17:15:08 +01:00
|
|
|
for ( auto i = 0; i < points.count()-1; ++i )
|
2014-10-23 10:38:57 +02:00
|
|
|
{
|
|
|
|
QPointF crosPoint;
|
2016-01-24 17:15:08 +01:00
|
|
|
const auto type = line.intersect(QLineF(points.at(i), points.at(i+1)), &crosPoint);
|
2014-10-23 10:38:57 +02:00
|
|
|
if ( type == QLineF::BoundedIntersection )
|
|
|
|
{
|
|
|
|
intersections.append(crosPoint);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return intersections;
|
|
|
|
}
|
|
|
|
|
2014-08-17 16:22:30 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QPainterPath VAbstractCurve::ShowDirection(const QVector<QPointF> &points) const
|
|
|
|
{
|
|
|
|
QPainterPath path;
|
|
|
|
|
|
|
|
if (points.count() >= 2)
|
|
|
|
{
|
|
|
|
/*Need find coordinate midle of curve.
|
|
|
|
Universal way is take all points and find sum.*/
|
2015-06-09 20:23:37 +02:00
|
|
|
const qreal seek_length = qAbs(GetLength())/2.0;
|
2014-08-17 16:22:30 +02:00
|
|
|
qreal found_length = 0;
|
|
|
|
QLineF arrow;
|
|
|
|
for (qint32 i = 1; i <= points.size()-1; ++i)
|
|
|
|
{
|
|
|
|
arrow = QLineF(points.at(i-1), points.at(i));
|
|
|
|
found_length += arrow.length();//Length that we aready find
|
|
|
|
|
|
|
|
if (seek_length <= found_length)// if have found more that need stop.
|
|
|
|
{
|
|
|
|
//subtract length in last line and you will find position of the middle point.
|
|
|
|
arrow.setLength(arrow.length() - (found_length - seek_length));
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
//Reverse line because we want start arrow from this point
|
|
|
|
arrow = QLineF(arrow.p2(), arrow.p1());
|
|
|
|
const qreal angle = arrow.angle();//we each time change line angle, better save original angle value
|
|
|
|
arrow.setLength(14);//arrow length in pixels
|
|
|
|
|
|
|
|
arrow.setAngle(angle-35);
|
|
|
|
path.moveTo(arrow.p1());
|
|
|
|
path.lineTo(arrow.p2());
|
|
|
|
|
|
|
|
arrow.setAngle(angle+35);
|
|
|
|
path.moveTo(arrow.p1());
|
|
|
|
path.lineTo(arrow.p2());
|
|
|
|
}
|
|
|
|
return path;
|
|
|
|
}
|