1 /***************************************************************************
2 * Copyright (C) 2011 by Till Theato (root@ttill.de) *
3 * This file is part of Kdenlive (www.kdenlive.org). *
5 * Kdenlive is free software: you can redistribute it and/or modify *
6 * it under the terms of the GNU General Public License as published by *
7 * the Free Software Foundation, either version 2 of the License, or *
8 * (at your option) any later version. *
10 * Kdenlive is distributed in the hope that it will be useful, *
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of *
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
13 * GNU General Public License for more details. *
15 * You should have received a copy of the GNU General Public License *
16 * along with Kdenlive. If not, see <http://www.gnu.org/licenses/>. *
17 ***************************************************************************/
19 #include "splineitem.h"
20 #include "bpointitem.h"
21 #include "nearestpoint.h"
23 #include <QGraphicsScene>
25 #include <QGraphicsSceneMouseEvent>
28 inline QPointF closestPointInRect(QPointF point, QRectF rect)
31 rect = rect.normalized();
32 closest.setX(qBound<qreal>(rect.left(), point.x(), rect.right()));
33 closest.setY(qBound<qreal>(rect.top(), point.y(), rect.bottom()));
37 void deCasteljau(BPoint *p1, BPoint *p2, BPoint *res, double t)
41 ab = QLineF(p1->p, p1->h2).pointAt(t);
42 bc = QLineF(p1->h2, p2->h1).pointAt(t);
43 cd = QLineF(p2->h1, p2->p).pointAt(t);
45 res->h1 = QLineF(ab, bc).pointAt(t);
46 res->h2 = QLineF(bc, cd).pointAt(t);
47 res->p = QLineF(res->h1, res->h2).pointAt(t);
54 SplineItem::SplineItem(const QList< BPoint >& points, QGraphicsItem* parent, QGraphicsScene *scene) :
55 QGraphicsPathItem(parent, scene)
57 QPen framepen(Qt::SolidLine);
58 framepen.setColor(Qt::yellow);
60 setBrush(Qt::NoBrush);
61 setAcceptHoverEvents(true);
64 if (points.isEmpty()) {
70 QPainterPath path(points.at(0).p);
72 for (int i = 0; i < points.count(); ++i) {
73 new BPointItem(points.at(i), this);
74 j = (i + 1) % points.count();
75 path.cubicTo(points.at(i).h2, points.at(j).h1, points.at(j).p);
80 int SplineItem::type() const
85 void SplineItem::updateSpline()
87 QPainterPath path(qgraphicsitem_cast<BPointItem *>(childItems().at(0))->getPoint().p);
91 for (int i = 0; i < childItems().count() - !m_closed; ++i) {
92 j = (i + 1) % childItems().count();
93 p1 = qgraphicsitem_cast<BPointItem *>(childItems().at(i))->getPoint();
94 p2 = qgraphicsitem_cast<BPointItem *>(childItems().at(j))->getPoint();
95 path.cubicTo(p1.h2, p2.h1, p2.p);
103 QList <BPoint> SplineItem::getPoints()
105 QList <BPoint> points;
106 foreach (QGraphicsItem *child, childItems())
107 points << qgraphicsitem_cast<BPointItem *>(child)->getPoint();
111 void SplineItem::removeChild(QGraphicsItem* child)
113 if (childItems().count() > 2) {
114 scene()->removeItem(child);
120 void SplineItem::mousePressEvent(QGraphicsSceneMouseEvent* event)
122 event->setAccepted(m_closed);
123 QGraphicsItem::mousePressEvent(event);
125 if (event->isAccepted())
129 QRectF r(event->scenePos() - QPointF(6, 6), QSizeF(12, 12));
130 if (event->button() == Qt::LeftButton && path().intersects(r) && !path().contains(r)) {
134 int ix = getClosestPointOnCurve(event->scenePos(), &t);
135 i1 = qgraphicsitem_cast<BPointItem *>(childItems().at(ix));
136 i2 = qgraphicsitem_cast<BPointItem *>(childItems().at((ix + 1) % childItems().count()));
140 deCasteljau(&p1, &p2, &p, t);
145 #if QT_VERSION >= 0x040600
146 BPointItem *i = new BPointItem(p, this);
149 QList <BPoint> points;
151 while (childItems().count()) {
152 item = qgraphicsitem_cast<BPointItem *>(childItems().takeFirst());
153 points.append(item->getPoint());
157 for ( ; j < points.count(); ++j) {
159 new BPointItem(p, this);
160 new BPointItem(points.at(j), this);
163 new BPointItem(p, this);
168 if (event->button() == Qt::RightButton) {
169 if (childItems().count() > 1) {
171 BPointItem *i1 = qgraphicsitem_cast<BPointItem *>(childItems().first());
172 BPointItem *i2 = qgraphicsitem_cast<BPointItem *>(childItems().last());
173 BPoint p1 = i1->getPoint();
174 BPoint p2 = i2->getPoint();
175 p1.h1 = QLineF(p1.p, p2.p).pointAt(.2);
176 p2.h2 = QLineF(p1.p, p2.p).pointAt(.8);
183 } else if (event->modifiers() == Qt::NoModifier) {
185 p.p = p.h1 = p.h2 = event->scenePos();
186 if (childItems().count()) {
187 BPointItem *i = qgraphicsitem_cast<BPointItem *>(childItems().last());
188 BPoint prev = i->getPoint();
189 prev.h2 = QLineF(prev.p, p.p).pointAt(.2);
190 p.h1 = QLineF(prev.p, p.p).pointAt(.8);
193 new BPointItem(p, this);
199 void SplineItem::mouseMoveEvent(QGraphicsSceneMouseEvent* event)
201 QGraphicsItem::mouseMoveEvent(event);
204 void SplineItem::mouseReleaseEvent(QGraphicsSceneMouseEvent* event)
206 QGraphicsItem::mouseReleaseEvent(event);
209 void SplineItem::hoverMoveEvent(QGraphicsSceneHoverEvent* event)
211 QGraphicsItem::hoverMoveEvent(event);
213 QRectF r(event->scenePos() - QPointF(6, 6), QSizeF(12, 12));
214 if (path().intersects(r) && !path().contains(r))
215 setCursor(QCursor(Qt::PointingHandCursor));
220 int SplineItem::getClosestPointOnCurve(QPointF point, double *tFinal)
222 // TODO: proper minDiff
223 qreal diff = 10000, param = 0;
225 int curveSegment = 0, j;
226 for (int i = 0; i < childItems().count(); ++i) {
227 j = (i + 1) % childItems().count();
228 p1 = qgraphicsitem_cast<BPointItem *>(childItems().at(i))->getPoint();
229 p2 = qgraphicsitem_cast<BPointItem *>(childItems().at(j))->getPoint();
230 QPolygonF bounding = QPolygonF() << p1.p << p1.h2 << p2.h1 << p2.p;
231 QPointF cl = closestPointInRect(point, bounding.boundingRect());
232 qreal d = (point - cl).manhattanLength();
252 Point2 n = NearestPointOnCurve(p, b, &t);
256 d = (point - cl).manhattanLength();
268 #include "splineitem.moc"