2013-12-29 17:48:57 +01:00
|
|
|
/************************************************************************
|
|
|
|
**
|
|
|
|
** @file vgobject.cpp
|
2014-04-30 07:38:52 +02:00
|
|
|
** @author Roman Telezhynskyi <dismine(at)gmail.com>
|
2013-12-29 17:48:57 +01:00
|
|
|
** @date 27 12, 2013
|
|
|
|
**
|
|
|
|
** @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
|
2013-12-29 17:48:57 +01: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 "vgobject.h"
|
2014-08-20 14:01:35 +02:00
|
|
|
#include "vgobject_p.h"
|
2013-12-29 17:48:57 +01:00
|
|
|
|
2014-10-23 10:38:57 +02:00
|
|
|
#include <QLineF>
|
|
|
|
#include <QPointF>
|
|
|
|
#include <QRectF>
|
|
|
|
#include <QtCore/qmath.h>
|
2014-11-11 09:16:37 +01:00
|
|
|
#include <climits>
|
2014-10-23 10:38:57 +02:00
|
|
|
|
2014-05-02 13:11:30 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2014-06-01 09:35:13 +02:00
|
|
|
/**
|
|
|
|
* @brief VGObject default constructor.
|
|
|
|
*/
|
2013-12-29 17:48:57 +01:00
|
|
|
VGObject::VGObject()
|
2014-08-20 14:01:35 +02:00
|
|
|
:d(new VGObjectData)
|
2014-05-02 13:11:30 +02:00
|
|
|
{}
|
2013-12-29 17:48:57 +01:00
|
|
|
|
2014-05-02 13:11:30 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2014-06-01 09:35:13 +02:00
|
|
|
/**
|
|
|
|
* @brief VGObject constructor.
|
|
|
|
* @param type type graphical object.
|
|
|
|
* @param idObject id parent object.
|
|
|
|
* @param mode mode creation. Used in modeling mode.
|
|
|
|
*/
|
2014-06-12 09:22:29 +02:00
|
|
|
VGObject::VGObject(const GOType &type, const quint32 &idObject, const Draw &mode)
|
2014-08-20 14:01:35 +02:00
|
|
|
:d(new VGObjectData(type, idObject, mode))
|
2014-05-02 13:11:30 +02:00
|
|
|
{}
|
2013-12-29 17:48:57 +01:00
|
|
|
|
2014-05-02 13:11:30 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2014-06-01 09:35:13 +02:00
|
|
|
/**
|
|
|
|
* @brief VGObject copy constructor.
|
|
|
|
* @param obj object.
|
|
|
|
*/
|
2013-12-29 17:48:57 +01:00
|
|
|
VGObject::VGObject(const VGObject &obj)
|
2014-08-20 14:01:35 +02:00
|
|
|
:d (obj.d)
|
2014-05-02 13:11:30 +02:00
|
|
|
{}
|
2013-12-29 17:48:57 +01:00
|
|
|
|
2014-05-02 13:11:30 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2014-06-01 09:35:13 +02:00
|
|
|
/**
|
|
|
|
* @brief operator = assignment operator.
|
|
|
|
* @param obj object
|
|
|
|
* @return object
|
|
|
|
*/
|
2013-12-29 17:48:57 +01:00
|
|
|
VGObject &VGObject::operator=(const VGObject &obj)
|
|
|
|
{
|
2014-07-27 14:30:28 +02:00
|
|
|
if ( &obj == this )
|
|
|
|
{
|
|
|
|
return *this;
|
|
|
|
}
|
2014-08-20 14:01:35 +02:00
|
|
|
d = obj.d;
|
2013-12-29 17:48:57 +01:00
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2014-08-20 14:01:35 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
VGObject::~VGObject()
|
|
|
|
{}
|
|
|
|
|
2014-05-02 13:11:30 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2014-06-01 09:35:13 +02:00
|
|
|
/**
|
|
|
|
* @brief getIdObject return parent id.
|
|
|
|
* @return parent id or 0 if object don't have parent.
|
|
|
|
*/
|
2014-02-25 15:40:24 +01:00
|
|
|
quint32 VGObject::getIdObject() const
|
2013-12-29 17:48:57 +01:00
|
|
|
{
|
2014-08-20 14:01:35 +02:00
|
|
|
return d->idObject;
|
2013-12-29 17:48:57 +01:00
|
|
|
}
|
|
|
|
|
2014-05-02 13:11:30 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2014-06-01 09:35:13 +02:00
|
|
|
/**
|
|
|
|
* @brief setIdObject set parent id.
|
|
|
|
* @param value parent id.
|
|
|
|
*/
|
2014-02-25 15:40:24 +01:00
|
|
|
void VGObject::setIdObject(const quint32 &value)
|
2013-12-29 17:48:57 +01:00
|
|
|
{
|
2014-08-20 14:01:35 +02:00
|
|
|
d->idObject = value;
|
2013-12-29 17:48:57 +01:00
|
|
|
}
|
|
|
|
|
2014-05-02 13:11:30 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2014-06-01 09:35:13 +02:00
|
|
|
/**
|
|
|
|
* @brief name return name graphical object.
|
|
|
|
* @return name
|
|
|
|
*/
|
2013-12-29 17:48:57 +01:00
|
|
|
QString VGObject::name() const
|
|
|
|
{
|
2014-08-20 14:01:35 +02:00
|
|
|
return d->_name;
|
2013-12-29 17:48:57 +01:00
|
|
|
}
|
|
|
|
|
2014-05-02 13:11:30 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2014-06-01 09:35:13 +02:00
|
|
|
/**
|
|
|
|
* @brief setName set name graphical object.
|
|
|
|
* @param name name graphical object.
|
|
|
|
*/
|
2013-12-29 17:48:57 +01:00
|
|
|
void VGObject::setName(const QString &name)
|
|
|
|
{
|
2014-08-20 14:01:35 +02:00
|
|
|
d->_name = name;
|
2013-12-29 17:48:57 +01:00
|
|
|
}
|
|
|
|
|
2014-06-01 09:35:13 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
/**
|
|
|
|
* @brief getMode return mode creation.
|
|
|
|
* @return mode.
|
|
|
|
*/
|
2014-06-12 09:22:29 +02:00
|
|
|
Draw VGObject::getMode() const
|
2013-12-29 17:48:57 +01:00
|
|
|
{
|
2014-08-20 14:01:35 +02:00
|
|
|
return d->mode;
|
2013-12-29 17:48:57 +01:00
|
|
|
}
|
|
|
|
|
2014-05-02 13:11:30 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2014-06-01 09:35:13 +02:00
|
|
|
/**
|
|
|
|
* @brief setMode set mode creation.
|
|
|
|
* @param value mode.
|
|
|
|
*/
|
2014-06-12 09:22:29 +02:00
|
|
|
void VGObject::setMode(const Draw &value)
|
2013-12-29 17:48:57 +01:00
|
|
|
{
|
2014-08-20 14:01:35 +02:00
|
|
|
d->mode = value;
|
2013-12-29 17:48:57 +01:00
|
|
|
}
|
|
|
|
|
2014-05-02 13:11:30 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2014-06-01 09:35:13 +02:00
|
|
|
/**
|
|
|
|
* @brief getType return object type.
|
|
|
|
* @return type.
|
|
|
|
*/
|
2014-06-12 09:22:29 +02:00
|
|
|
GOType VGObject::getType() const
|
2013-12-29 17:48:57 +01:00
|
|
|
{
|
2014-08-20 14:01:35 +02:00
|
|
|
return d->type;
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2015-04-15 14:44:57 +02:00
|
|
|
// cppcheck-suppress unusedFunction
|
2014-08-20 14:01:35 +02:00
|
|
|
void VGObject::setType(const GOType &type)
|
|
|
|
{
|
|
|
|
d->type = type;
|
2013-12-29 17:48:57 +01:00
|
|
|
}
|
|
|
|
|
2014-05-02 13:11:30 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2014-06-01 09:35:13 +02:00
|
|
|
/**
|
|
|
|
* @brief id return id object.
|
|
|
|
* @return id
|
|
|
|
*/
|
2014-02-25 15:40:24 +01:00
|
|
|
quint32 VGObject::id() const
|
2013-12-29 17:48:57 +01:00
|
|
|
{
|
2014-08-20 14:01:35 +02:00
|
|
|
return d->_id;
|
2013-12-29 17:48:57 +01:00
|
|
|
}
|
|
|
|
|
2014-05-02 13:11:30 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2014-06-01 09:35:13 +02:00
|
|
|
/**
|
|
|
|
* @brief setId set id object.
|
|
|
|
* @param id id.
|
|
|
|
*/
|
2014-02-25 15:40:24 +01:00
|
|
|
void VGObject::setId(const quint32 &id)
|
2013-12-29 17:48:57 +01:00
|
|
|
{
|
2014-08-20 14:01:35 +02:00
|
|
|
d->_id = id;
|
2013-12-29 17:48:57 +01:00
|
|
|
}
|
2014-10-23 10:38:57 +02:00
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QLineF VGObject::BuildLine(const QPointF &p1, const qreal &length, const qreal &angle)
|
|
|
|
{
|
|
|
|
QLineF line = QLineF();
|
|
|
|
line.setP1(p1);
|
2015-11-25 14:45:38 +01:00
|
|
|
line.setAngle(angle);// First set angle then length. Length can have negative value.
|
2014-10-23 10:38:57 +02:00
|
|
|
line.setLength(length);
|
|
|
|
return line;
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QPointF VGObject::BuildRay(const QPointF &firstPoint, const qreal &angle, const QRectF &scRect)
|
|
|
|
{
|
2014-11-11 09:16:37 +01:00
|
|
|
QRectF rect = scRect;
|
2014-11-30 12:34:27 +01:00
|
|
|
if (rect.isValid() == false)
|
|
|
|
{
|
|
|
|
rect = QRectF(0, 0, 1200, 700);
|
|
|
|
}
|
2014-11-11 09:16:37 +01:00
|
|
|
if (rect.contains(firstPoint) == false)
|
|
|
|
{
|
2014-11-30 12:34:27 +01:00
|
|
|
// If point outside of scene rect create one around point and unite two rects.
|
|
|
|
QRectF rectangle(firstPoint.x()-rect.width()/2, firstPoint.y()-rect.height()/2, rect.width(), rect.height());
|
2014-11-11 09:16:37 +01:00
|
|
|
rect = rect.united(rectangle);
|
|
|
|
}
|
|
|
|
const qreal diagonal = qSqrt(pow(rect.height(), 2) + pow(rect.width(), 2));
|
|
|
|
const QLineF line = BuildLine(firstPoint, diagonal, angle);
|
2014-10-23 10:38:57 +02:00
|
|
|
|
2014-11-11 09:16:37 +01:00
|
|
|
return LineIntersectRect(rect, line);
|
2014-10-23 10:38:57 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QLineF VGObject::BuildAxis(const QPointF &p, const qreal &angle, const QRectF &scRect)
|
|
|
|
{
|
2014-11-11 09:16:37 +01:00
|
|
|
const QPointF endP1 = BuildRay(p, angle+180, scRect);
|
|
|
|
const QPointF endP2 = BuildRay(p, angle, scRect);
|
2014-10-23 10:38:57 +02:00
|
|
|
return QLineF(endP1, endP2);
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QLineF VGObject::BuildAxis(const QPointF &p1, const QPointF &p2, const QRectF &scRect)
|
|
|
|
{
|
|
|
|
QLineF line(p1, p2);
|
|
|
|
return BuildAxis(p1, line.angle(), scRect);
|
|
|
|
}
|
|
|
|
|
2015-06-05 15:43:41 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
int VGObject::ContactPoints(const QPointF &p, const QPointF ¢er, qreal radius, QPointF &p1, QPointF &p2)
|
|
|
|
{
|
|
|
|
const int flag = PointInCircle(p, center, radius);
|
|
|
|
|
|
|
|
if (flag == 0)
|
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (flag == 1)
|
|
|
|
{
|
|
|
|
p1 = p;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
const double d = QLineF (p, center).length();
|
|
|
|
const double k = sqrt (d * d - radius * radius);
|
|
|
|
return IntersectionCircles(p, k, center, radius, p1, p2);
|
|
|
|
}
|
|
|
|
|
2014-10-23 10:38:57 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
/**
|
|
|
|
* @brief LineIntersectRect find point intersection line and rect.
|
|
|
|
* @param rec rect.
|
|
|
|
* @param line line.
|
|
|
|
* @return point intersection.
|
|
|
|
*/
|
2014-11-11 09:16:37 +01:00
|
|
|
QPointF VGObject::LineIntersectRect(const QRectF &rec, const QLineF &line)
|
2014-10-23 10:38:57 +02:00
|
|
|
{
|
|
|
|
qreal x1, y1, x2, y2;
|
|
|
|
rec.getCoords(&x1, &y1, &x2, &y2);
|
|
|
|
QPointF point;
|
|
|
|
QLineF::IntersectType type = line.intersect(QLineF(QPointF(x1, y1), QPointF(x1, y2)), &point);
|
|
|
|
if ( type == QLineF::BoundedIntersection )
|
|
|
|
{
|
|
|
|
return point;
|
|
|
|
}
|
|
|
|
type = line.intersect(QLineF(QPointF(x1, y1), QPointF(x2, y1)), &point);
|
|
|
|
if ( type == QLineF::BoundedIntersection )
|
|
|
|
{
|
|
|
|
return point;
|
|
|
|
}
|
|
|
|
type = line.intersect(QLineF(QPointF(x1, y2), QPointF(x2, y2)), &point);
|
|
|
|
if ( type == QLineF::BoundedIntersection )
|
|
|
|
{
|
|
|
|
return point;
|
|
|
|
}
|
|
|
|
type = line.intersect(QLineF(QPointF(x2, y1), QPointF(x2, y2)), &point);
|
|
|
|
if ( type == QLineF::BoundedIntersection )
|
|
|
|
{
|
|
|
|
return point;
|
|
|
|
}
|
|
|
|
return point;
|
|
|
|
}
|
|
|
|
|
2015-05-25 14:49:28 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
int VGObject::IntersectionCircles(const QPointF &c1, double r1, const QPointF &c2, double r2, QPointF &p1, QPointF &p2)
|
|
|
|
{
|
|
|
|
if (qFuzzyCompare(c1.x(), c2.x()) && qFuzzyCompare(c1.y(), c2.y()) && qFuzzyCompare(r1, r2))
|
|
|
|
{
|
|
|
|
return 3;// Circles are equal
|
|
|
|
}
|
2015-05-27 18:24:20 +02:00
|
|
|
const double a = - 2.0 * (c2.x() - c1.x());
|
|
|
|
const double b = - 2.0 * (c2.y() - c1.y());
|
|
|
|
const double c = (c2.x() - c1.x())* (c2.x() - c1.x()) + (c2.y() - c1.y()) * (c2.y() - c1.y()) + r1 * r1 - r2 * r2;
|
|
|
|
|
|
|
|
const double x0 = -a*c/(a*a+b*b);
|
|
|
|
const double y0 = -b*c/(a*a+b*b);
|
|
|
|
|
|
|
|
if (c*c > r1*r1*(a*a+b*b))
|
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
else if (qFuzzyCompare(c*c, r1*r1*(a*a+b*b)))
|
|
|
|
{
|
|
|
|
p1 = QPointF(x0 + c1.x(), y0 + c1.y());
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
const double d = r1*r1 - c*c/(a*a+b*b);
|
|
|
|
const double mult = sqrt (d / (a*a+b*b));
|
|
|
|
|
|
|
|
const double ax = x0 + b * mult;
|
|
|
|
const double bx = x0 - b * mult;
|
|
|
|
const double ay = y0 - a * mult;
|
|
|
|
const double by = y0 + a * mult;
|
|
|
|
|
|
|
|
p1 = QPointF(ax + c1.x(), ay + c1.y());
|
|
|
|
p2 = QPointF(bx + c1.x(), by + c1.y());
|
|
|
|
return 2;
|
|
|
|
}
|
2015-05-25 14:49:28 +02:00
|
|
|
}
|
|
|
|
|
2014-10-23 10:38:57 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
/**
|
|
|
|
* @brief LineIntersectCircle find point intersection line and circle.
|
|
|
|
* @param center arc center.
|
|
|
|
* @param radius arc radius.
|
|
|
|
* @param line line
|
|
|
|
* @param p1 first intersection point.
|
|
|
|
* @param p2 second intersection point.
|
|
|
|
* @return 0 - intersection doesn't exist, 1 - one intersection point, 2 - two intersection points.
|
|
|
|
*/
|
|
|
|
qint32 VGObject::LineIntersectCircle(const QPointF ¢er, qreal radius, const QLineF &line, QPointF &p1, QPointF &p2)
|
|
|
|
{
|
|
|
|
//coefficient for equation of segment
|
|
|
|
qreal a = 0, b = 0, c = 0;
|
|
|
|
LineCoefficients(line, &a, &b, &c);
|
|
|
|
// projection center of circle on to line
|
2015-05-25 14:51:44 +02:00
|
|
|
const QPointF p = ClosestPoint (line, center);
|
2014-10-23 10:38:57 +02:00
|
|
|
// how many solutions?
|
|
|
|
qint32 flag = 0;
|
2015-05-25 14:51:44 +02:00
|
|
|
const qreal d = QLineF (center, p).length();
|
2014-10-23 10:38:57 +02:00
|
|
|
if (qFuzzyCompare(d, radius))
|
|
|
|
{
|
|
|
|
flag = 1;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if (radius > d)
|
|
|
|
{
|
|
|
|
flag = 2;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
// find distance from projection to points of intersection
|
2015-05-25 14:51:44 +02:00
|
|
|
const qreal k = qSqrt (qAbs(radius * radius - d * d));
|
|
|
|
const qreal t = QLineF (QPointF (0, 0), QPointF (b, - a)).length();
|
2014-10-23 10:38:57 +02:00
|
|
|
// add to projection a vectors aimed to points of intersection
|
|
|
|
p1 = addVector (p, QPointF (0, 0), QPointF (- b, a), k / t);
|
|
|
|
p2 = addVector (p, QPointF (0, 0), QPointF (b, - a), k / t);
|
|
|
|
return flag;
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
/**
|
|
|
|
* @brief ClosestPoint find point projection of point onto line.
|
|
|
|
* @param line line.
|
|
|
|
* @return point on line or extended line if origin size too small.
|
|
|
|
*/
|
|
|
|
QPointF VGObject::ClosestPoint(const QLineF &line, const QPointF &point)
|
|
|
|
{
|
|
|
|
qreal a = 0, b = 0, c = 0;
|
|
|
|
LineCoefficients(line, &a, &b, &c);
|
|
|
|
qreal x = point.x() + a;
|
|
|
|
qreal y = b + point.y();
|
|
|
|
QLineF lin (point, QPointF(x, y));
|
|
|
|
QPointF p;
|
|
|
|
QLineF::IntersectType intersect = line.intersect(lin, &p);
|
|
|
|
if (intersect == QLineF::UnboundedIntersection || intersect == QLineF::BoundedIntersection)
|
|
|
|
{
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return QPointF();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QPointF VGObject::addVector(const QPointF &p, const QPointF &p1, const QPointF &p2, qreal k)
|
|
|
|
{
|
|
|
|
return QPointF (p.x() + (p2.x() - p1.x()) * k, p.y() + (p2.y() - p1.y()) * k);
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
/**
|
|
|
|
* @brief LineCoefficients coefficient for equation of segment. Segment equestion ax+by+c=0.
|
|
|
|
* @param line line
|
|
|
|
* @param a a value
|
|
|
|
* @param b b value
|
|
|
|
* @param c c value
|
|
|
|
*/
|
|
|
|
void VGObject::LineCoefficients(const QLineF &line, qreal *a, qreal *b, qreal *c)
|
|
|
|
{
|
|
|
|
//coefficient for equation of segment
|
|
|
|
QPointF p1 = line.p1();
|
|
|
|
*a = line.p2().y() - p1.y();
|
|
|
|
*b = p1.x() - line.p2().x();
|
|
|
|
*c = - *a * p1.x() - *b * p1.y();
|
|
|
|
}
|
2014-12-15 15:25:40 +01:00
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2015-05-07 11:39:08 +02:00
|
|
|
/**
|
|
|
|
* @brief IsPointOnLineSegment Check if the point is on the line segment.
|
|
|
|
*
|
|
|
|
* Original idea http://www.sunshine2k.de/coding/java/PointOnLine/PointOnLine.html
|
|
|
|
*/
|
2015-05-07 10:49:56 +02:00
|
|
|
bool VGObject::IsPointOnLineSegment(const QPointF &t, const QPointF &p1, const QPointF &p2)
|
2014-12-15 15:25:40 +01:00
|
|
|
{
|
2015-05-07 11:39:08 +02:00
|
|
|
// The test point must lie inside the bounding box spanned by the two line points.
|
|
|
|
if (not ( (p1.x() <= t.x() && t.x() <= p2.x()) || (p2.x() <= t.x() && t.x() <= p1.x()) ))
|
|
|
|
{
|
|
|
|
// test point not in x-range
|
|
|
|
return false;
|
|
|
|
}
|
2014-12-15 15:25:40 +01:00
|
|
|
|
2015-05-07 11:39:08 +02:00
|
|
|
if (not ( (p1.y() <= t.y() && t.y() <= p2.y()) || (p2.y() <= t.y() && t.y() <= p1.y()) ))
|
2014-12-15 15:25:40 +01:00
|
|
|
{
|
2015-05-07 11:39:08 +02:00
|
|
|
// test point not in y-range
|
2014-12-15 15:25:40 +01:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2015-05-07 11:39:08 +02:00
|
|
|
// Test via the perp dot product (PDP)
|
|
|
|
return IsPointOnLineviaPDP(t, p1, p2);
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
/**
|
|
|
|
* @brief IsPointOnLineviaPDP use the perp dot product (PDP) way.
|
|
|
|
*
|
|
|
|
* The pdp is zero only if the t lies on the line e1 = vector from p1 to p2.
|
|
|
|
*/
|
|
|
|
bool VGObject::IsPointOnLineviaPDP(const QPointF &t, const QPointF &p1, const QPointF &p2)
|
|
|
|
{
|
|
|
|
return ( qAbs(PerpDotProduct(p1, p2, t) < GetEpsilon(p1, p2)) );
|
2014-12-15 15:25:40 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2015-05-07 11:39:08 +02:00
|
|
|
/**
|
|
|
|
* @brief PerpDotProduct Calculates the area of the parallelogram of the three points.
|
|
|
|
* This is actually the same as the area of the triangle defined by the three points, multiplied by 2.
|
|
|
|
* @return 2 * triangleArea(a,b,c)
|
|
|
|
*/
|
|
|
|
double VGObject::PerpDotProduct(const QPointF &t, const QPointF &p1, const QPointF &p2)
|
2014-12-15 15:25:40 +01:00
|
|
|
{
|
2015-05-07 11:39:08 +02:00
|
|
|
return (p1.x() - t.x()) * (p2.y() - t.y()) - (p1.y() - t.y()) * (p2.x() - t.x());
|
|
|
|
}
|
2014-12-15 15:25:40 +01:00
|
|
|
|
2015-05-07 11:39:08 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
/**
|
|
|
|
* @brief GetEpsilon solve the floating-point accuraccy problem.
|
|
|
|
*
|
|
|
|
* There is the floating-point accuraccy problem, so instead of checking against zero, some epsilon value has to be
|
|
|
|
* used. Because the size of the pdp value depends on the length of the vectors, no static value can be used. One
|
|
|
|
* approach is to compare the pdp/area value to the fraction of another area which also depends on the length of the
|
|
|
|
* line e1=(p1, p2), e.g. the area of the square with side e1 which is computed below
|
|
|
|
*/
|
|
|
|
double VGObject::GetEpsilon(const QPointF &p1, const QPointF &p2)
|
|
|
|
{
|
|
|
|
const int dx1 = p2.toPoint().x() - p1.toPoint().x();
|
|
|
|
const int dy1 = p2.toPoint().y() - p1.toPoint().y();
|
2015-10-28 15:22:36 +01:00
|
|
|
const double epsilon = 0.003 * (dx1 * dx1 + dy1 * dy1); //-V636
|
2015-05-07 11:39:08 +02:00
|
|
|
return epsilon;
|
2014-12-15 15:25:40 +01:00
|
|
|
}
|
|
|
|
|
2015-06-05 15:43:41 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
int VGObject::PointInCircle(const QPointF &p, const QPointF ¢er, qreal radius)
|
|
|
|
{
|
|
|
|
const double d = QLineF (p, center).length();
|
|
|
|
if (qFuzzyCompare(radius, d))
|
|
|
|
{
|
|
|
|
return 1; // on circle
|
|
|
|
}
|
|
|
|
if (radius > d)
|
|
|
|
{
|
|
|
|
return 0; // outside circle
|
|
|
|
}
|
|
|
|
return 2; // inside circle
|
|
|
|
}
|
|
|
|
|
2014-12-15 15:25:40 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2014-12-16 14:33:00 +01:00
|
|
|
/**
|
|
|
|
* @brief GetReversePoint return revers container of points.
|
|
|
|
* @param points container with points.
|
|
|
|
* @return reverced points.
|
|
|
|
*/
|
2014-12-15 15:25:40 +01:00
|
|
|
QVector<QPointF> VGObject::GetReversePoints(const QVector<QPointF> &points)
|
|
|
|
{
|
|
|
|
if (points.isEmpty())
|
|
|
|
{
|
|
|
|
return points;
|
|
|
|
}
|
|
|
|
QVector<QPointF> reversePoints;
|
|
|
|
for (qint32 i = points.size() - 1; i >= 0; --i)
|
|
|
|
{
|
|
|
|
reversePoints.append(points.at(i));
|
|
|
|
}
|
|
|
|
return reversePoints;
|
|
|
|
}
|
2014-12-16 14:33:00 +01:00
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
/**
|
|
|
|
* @brief GetLengthContour return length of contour.
|
|
|
|
* @param contour container with points of contour.
|
|
|
|
* @param newPoints point whos we try to add to contour.
|
|
|
|
* @return length length of contour.
|
|
|
|
*/
|
2015-04-15 14:44:57 +02:00
|
|
|
// cppcheck-suppress unusedFunction
|
2014-12-16 14:33:00 +01:00
|
|
|
int VGObject::GetLengthContour(const QVector<QPointF> &contour, const QVector<QPointF> &newPoints)
|
|
|
|
{
|
|
|
|
qreal length = 0;
|
|
|
|
QVector<QPointF> points;
|
|
|
|
points << contour << newPoints;
|
|
|
|
for (qint32 i = 0; i < points.size()-1; ++i)
|
|
|
|
{
|
|
|
|
QLineF line(points.at(i), points.at(i+1));
|
|
|
|
length += line.length();
|
|
|
|
}
|
|
|
|
return qFloor(length);
|
|
|
|
}
|