vectorimage.cpp

/*

Pencil2D - Traditional Animation Software
Copyright (C) 2005-2007 Patrick Corrieri & Pascal Naidon
Copyright (C) 2012-2020 Matthew Chiawen Chang

This program 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; version 2 of the License.

This program 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.

*/
#include "vectorimage.h"

#include <cmath>
#include <QImage>
#include <QFile>
#include <QFileInfo>
#include <QDebug>
#include <QXmlStreamWriter>
#include "object.h"


VectorImage::VectorImage()
{
    deselectAll();
}

VectorImage::VectorImage(const VectorImage& v2) : KeyFrame(v2)
{
    deselectAll();
    mObject = v2.mObject;
    mCurves = v2.mCurves;
    mArea = v2.mArea;
}

VectorImage::~VectorImage()
{
}

VectorImage& VectorImage::operator=(const VectorImage& a) {
    if (this != &a) {
        deselectAll();
        mObject = a.mObject;
        mCurves = a.mCurves;
        mArea = a.mArea;
        modification();
    }
    return *this;
}

VectorImage* VectorImage::clone()
{
    return new VectorImage(*this);
}

bool VectorImage::read(QString filePath)
{
    QFileInfo fileInfo(filePath);
    if (fileInfo.isDir())
    {
        return false;
    }

    QFile file(filePath);
    if (!file.open(QFile::ReadOnly))
    {
        return false;
    }

    QDomDocument doc;
    if (!doc.setContent(&file)) return false; // this is not a XML file
    QDomDocumentType type = doc.doctype();
    if (type.name() != "PencilVectorImage") return false; // this is not a Pencil document

    QDomElement element = doc.documentElement();
    if (element.tagName() == "image")
    {
        if (element.attribute("type") == "vector")
        {
            loadDomElement(element);
        }
    }

    setFileName(filePath);
    setModified(false);
    return true;
}

Status VectorImage::write(QString filePath, QString format)
{
    DebugDetails debugInfo;
    debugInfo << "VectorImage::write";
    debugInfo << QString("filePath = ").append(filePath);
    debugInfo << QString("format = ").append(format);

    QFile file(filePath);
    bool result = file.open(QIODevice::WriteOnly);
    if (!result)
    {
        qDebug() << "VectorImage - Cannot write file" << filePath << file.error();
        debugInfo << ("file.error() = " + file.errorString());
        return Status(Status::FAIL, debugInfo);
    }

    if (format != "VEC")
    {
        debugInfo << "Unrecognized format";
        return Status(Status::FAIL, debugInfo);
    }

    QXmlStreamWriter xmlStream(&file);
    xmlStream.setAutoFormatting(true);
    xmlStream.writeStartDocument();
    xmlStream.writeDTD("<!DOCTYPE PencilVectorImage>");

    xmlStream.writeStartElement("image");
    xmlStream.writeAttribute("type", "vector");

    Status st = createDomElement(xmlStream);
    if (!st.ok())
    {
        debugInfo.collect(st.details());
        debugInfo << "- xml creation failed";
        return Status(Status::FAIL, debugInfo);
    }
    xmlStream.writeEndElement(); // Close image element
    xmlStream.writeEndDocument();

    setFileName(filePath);
    return Status::OK;
}

Status VectorImage::createDomElement(QXmlStreamWriter& xmlStream)
{
    DebugDetails debugInfo;
    debugInfo << "VectorImage::createDomElement";

    for (int i = 0; i < mCurves.size(); i++)
    {
        Status st = mCurves[i].createDomElement(xmlStream);
        if (!st.ok())
        {
            debugInfo.collect(st.details());
            debugInfo << QString("- m_curves[%1] failed to write").arg(i);
            return Status(Status::FAIL, debugInfo);
        }
    }
    for (int i = 0; i < mArea.size(); i++)
    {
        Status st = mArea[i].createDomElement(xmlStream);
        if (!st.ok())
        {
            debugInfo.collect(st.details());
            debugInfo << QString("- area[%1] failed to write").arg(i);
            return Status(Status::FAIL, debugInfo);
        }
    }
    return Status::OK;
}

void VectorImage::loadDomElement(QDomElement element)
{
    QDomNode atomTag = element.firstChild(); // an atom in a vector picture is a curve or an area
    while (!atomTag.isNull())
    {
        QDomElement atomElement = atomTag.toElement();
        if (!atomElement.isNull())
        {
            if (atomElement.tagName() == "curve")
            {
                BezierCurve newCurve;
                newCurve.loadDomElement(atomElement);
                mCurves.append(newCurve);
            }
            if (atomElement.tagName() == "area")
            {
                BezierArea newArea;
                newArea.loadDomElement(atomElement);
                addArea(newArea);
            }
        }
        atomTag = atomTag.nextSibling();
    }
    clean();
}

BezierCurve& VectorImage::curve(int i)
{
    return mCurves[i];
}

void VectorImage::addPoint(int curveNumber, int vertexNumber, qreal fraction)
{
    mCurves[curveNumber].addPoint(vertexNumber, fraction);
    // updates the bezierAreas
    for (int j = 0; j < mArea.size(); j++)
    {
        // shift the references of all the points beyond the new point
        for (int k = 0; k < mArea.at(j).mVertex.size(); k++)
        {
            if (mArea[j].getVertexRef(k).curveNumber == curveNumber)
            {
                if (mArea[j].getVertexRef(k).vertexNumber >= vertexNumber)
                {
                    mArea[j].mVertex[k].vertexNumber++;
                }
            }
        }
        // insert the new point in the area if necessary
        for (int k = 1; k < mArea.at(j).mVertex.size(); k++)
        {
            if (VertexRef(curveNumber, vertexNumber + 1) == mArea.at(j).mVertex.at(k))   // area[j].vertex[k] == VertexRef(curveNumber, vertexNumber+1)
            {
                if (VertexRef(curveNumber, vertexNumber - 1) == mArea.at(j).mVertex.at(k - 1))
                {
                    mArea[j].mVertex.insert(k, VertexRef(curveNumber, vertexNumber));
                }
            }
            if (VertexRef(curveNumber, vertexNumber - 1) == mArea.at(j).mVertex.at(k))
            {
                if (VertexRef(curveNumber, vertexNumber + 1) == mArea.at(j).mVertex.at(k - 1))
                {
                    mArea[j].mVertex.insert(k, VertexRef(curveNumber, vertexNumber));
                }
            }
        }
    }
    modification();
}

void VectorImage::removeCurveAt(int i)
{
    // first change the curve numbers in the areas
    for (int j = 0; j < mArea.size(); j++)
    {
        for (int k = 0; k < mArea.at(j).mVertex.size(); k++)
        {
            if (mArea.at(j).mVertex[k].curveNumber > i) { mArea[j].mVertex[k].curveNumber--; }
        }
    }
    // then remove curve
    mCurves.removeAt(i);
    modification();
}

void VectorImage::insertCurve(int position, BezierCurve& newCurve, qreal factor, bool interacts)
{
    if (newCurve.getVertexSize() < 1) // security - a new curve should have a least 2 vertices
        return;

    // Does the curve interact with others or with itself?
    if (interacts)
    {
        // tolerance for taking the intersection as an existing vertex on a curve
        qreal tol = qMax(newCurve.getWidth() / factor, 3.0 / factor);
        //qDebug() << "tolerance" << tol;

        checkCurveExtremity(newCurve, tol);
        checkCurveIntersections(newCurve, tol);
    }


    // Append or insert the curve in the list
    if (position < 0 || position > mCurves.size() - 1)
    {
        mCurves.append(newCurve);
    }
    else
    {
        // If it's an insert we have to shift the curve numbers in the areas
        for (int i = 0; i < mArea.size(); i++)
        {
            for (int j = 0; j < mArea.at(i).mVertex.size(); j++)
            {
                if (mArea.at(i).mVertex[j].curveNumber >= position) {
                    mArea[i].mVertex[j].curveNumber++;
                }
            }
        }
        mCurves.insert(position, newCurve);
    }
    updateImageSize(newCurve);
    modification();
}

void VectorImage::addCurve(BezierCurve& newCurve, qreal factor, bool interacts)
{
    insertCurve(-1, newCurve, factor, interacts);
}

void VectorImage::checkCurveExtremity(BezierCurve& newCurve, qreal tolerance)
{
    // finds if the new curve is closed
    QPointF P = newCurve.getVertex(-1);
    QPointF Q = newCurve.getVertex(newCurve.getVertexSize() - 1);
    if (BezierCurve::eLength(P - Q) < tolerance)
    {
        newCurve.setVertex(newCurve.getVertexSize() - 1, P);
    }

    // finds if the first or last point of the new curve is close to other curves
    for (int i = 0; i < mCurves.size(); i++)   // for each other curve
    {
        for (int j = 0; j < mCurves.at(i).getVertexSize(); j++)   // for each cubic section of the other curve
        {
            QPointF P = newCurve.getVertex(-1);
            QPointF Q = newCurve.getVertex(newCurve.getVertexSize() - 1);
            QPointF P1 = mCurves.at(i).getVertex(j - 1);
            QPointF P2 = mCurves.at(i).getVertex(j);
            qreal tol3 = 2.0*sqrt(0.25*((P1 - P2).x()*(P1 - P2).x() + (P1 - P2).y()*(P1 - P2).y()) + tolerance*tolerance);
            qreal dist1 = BezierCurve::eLength(P - P1);
            qreal dist2 = BezierCurve::eLength(P - P2);
            if (dist1 <= 0.2*tolerance)
            {
                newCurve.setVertex(-1, P1); //qDebug() << "--b " << P1;
            }
            else
            {
                if (dist2 <= 0.2*tolerance)
                {
                    newCurve.setVertex(-1, P2); //qDebug() << "--c " << P2;
                }
                else
                {
                    if (dist1 + dist2 <= 3 * tol3)   // preselection, to speed up
                    {
                        QPointF nearestPoint = P;
                        qreal t = -1.0;
                        qreal distance = BezierCurve::findDistance(mCurves[i], j, P, nearestPoint, t);
                        if (distance < tolerance)
                        {
                            newCurve.setOrigin(nearestPoint); //qDebug() << "--d " << nearestPoint;
                            addPoint(i, j, t);
                        }
                    }
                }
            }

            dist1 = BezierCurve::eLength(Q - P1);
            dist2 = BezierCurve::eLength(Q - P2);
            if (dist1 <= 0.2*tolerance)
            {
                newCurve.setLastVertex(P1); //qDebug() << "--e " << P1;
            }
            else
            {
                if (dist2 <= 0.2*tolerance)
                {
                    newCurve.setLastVertex(P2); //qDebug() << "--f " << P2;
                }
                else
                {
                    if (dist1 + dist2 <= 3 * tol3)   // pre-selection, to speed up
                    {
                        QPointF nearestPoint = Q;
                        qreal t = -1.0;;
                        qreal distance = BezierCurve::findDistance(mCurves[i], j, Q, nearestPoint, t);
                        if (distance < tolerance)
                        {
                            newCurve.setLastVertex(nearestPoint); //qDebug() << "--g " << nearestPoint;
                            addPoint(i, j, t);
                        }
                    }
                }
                //qDebug() << "Modif last";
            }
        }
    }
    modification();
}

void VectorImage::checkCurveIntersections(BezierCurve& newCurve, qreal tolerance)
{
    // finds if the new curve intersects itself
    for (int k = 0; k < newCurve.getVertexSize(); k++)   // for each cubic section of the new curve
    {
        for (int j = k + 1; j < newCurve.getVertexSize(); j++)   // for each other cubic section of the new curve
        {
            QList<Intersection> intersections;
            bool intersection = BezierCurve::findIntersection(newCurve, k, newCurve, j, intersections);
            if (intersection)
            {
                //qDebug() << "INTERSECTION" << intersectionPoint << t1 << t2;
                //newCurve.addPoint(k, intersectionPoint);
                newCurve.addPoint(k, intersections[0].t1); //qDebug() << "--a " << newCurve.getVertex(k) << newCurve.getVertex(k+1);
                k++;
                j++;
                //newCurve.addPoint(j, intersectionPoint);
                newCurve.addPoint(j, intersections[0].t2); //qDebug() << "--a " << newCurve.getVertex(j) << newCurve.getVertex(j+1);
                j++;
            }
        }
    }

    // finds if the new curve interesects other curves
    for (int k = 0; k < newCurve.getVertexSize(); k++)   // for each cubic section of the new curve
    {
        //if (k==0) L1 = QLineF(P1 + 1.5*tol*(P1-Q1)/BezierCurve::eLength(P1-Q1), Q1);  // we extend slightly the line for the near point
        //if (k==newCurve.getVertexSize()-1) L1 = QLineF(P1, Q1- 1.5*tol*(P1-Q1)/BezierCurve::eLength(P1-Q1));  // we extend slightly the line for the last point
        //QPointF extension1 = 1.5*tol*(P1-Q1)/BezierCurve::eLength(P1-Q1);
        //L1 = QLineF(P1 + extension1, Q1 - extension1);
        for (int i = 0; i < mCurves.size(); i++)   // for each other curve // TO DO: should only loop on "nearby" curves instead of all
        {
            // ---- finds if the first or last point of the other curve is close to the current cubic section of the new curve
            QPointF P = mCurves.at(i).getVertex(-1);
            QPointF Q = mCurves.at(i).getVertex(mCurves.at(i).getVertexSize() - 1);
            QPointF P1 = newCurve.getVertex(k - 1);
            QPointF P2 = newCurve.getVertex(k);
            qreal tol3 = 2.0*sqrt(0.25*((P1 - P2).x()*(P1 - P2).x() + (P1 - P2).y()*(P1 - P2).y()) + tolerance*tolerance);
            qreal dist1 = BezierCurve::eLength(P - P1);
            qreal dist2 = BezierCurve::eLength(P - P2);

            if (dist1 < 0.2*tolerance)
            {
                mCurves[i].setVertex(-1, P1);  // memo: curve.at(i) is just a copy which can be read, curve[i] is a reference which can be modified
            }
            else
            {
                if (dist2 < 0.2*tolerance)
                {
                    mCurves[i].setVertex(-1, P2);
                }
                else
                {
                    if (dist1 + dist2 < 3 * tol3)
                    {
                        // TO DO: find a better intersection point
                        QPointF nearestPoint = P;
                        qreal t = -1.0;
                        qreal distance = BezierCurve::findDistance(newCurve, k, P, nearestPoint, t);
                        //qDebug() << "OK1" << t;
                        if (distance < tolerance)
                        {
                            P = nearestPoint;
                            //m_curves[i].setOrigin(P);
                            //newCurve.addPoint(k, P); //qDebug() << "--i " << P;
                        }
                    }
                }
                //qDebug() << "Modif first";
            }
            dist1 = BezierCurve::eLength(Q - P1);
            dist2 = BezierCurve::eLength(Q - P2);
            if (dist1 < 0.2*tolerance)
            {
                mCurves[i].setVertex(mCurves.at(i).getVertexSize() - 1, P1);
            }
            else
            {
                if (dist2 < 0.2*tolerance)
                {
                    mCurves[i].setVertex(mCurves.at(i).getVertexSize() - 1, P2);
                }
                else
                {
                    if (dist1 + dist2 < 3 * tol3)
                    {
                        // TO DO: find a better intersection point
                        QPointF nearestPoint = Q;
                        qreal t = -1.0;;
                        qreal distance = BezierCurve::findDistance(newCurve, k, Q, nearestPoint, t);
                        //qDebug() << "OK2" << t;
                        if (distance < tolerance)
                        {
                            Q = nearestPoint;
                            //m_curves[i].setLastVertex(Q);
                            //newCurve.addPoint(k, Q); //qDebug() << "--j " << Q;
                        }
                    }
                }
                //qDebug() << "Modif first";
            }

            // ---- finds if any cubic section of the other curve intersects the current cubic section of the new curve
            for (int j = 0; j < mCurves.at(i).getVertexSize(); j++)   // for each cubic section of the other curve
            {
                QList<Intersection> intersections;
                bool intersection = BezierCurve::findIntersection(newCurve, k, mCurves.at(i), j, intersections);
                if (intersection)
                {
                    //qDebug() << "Found " << intersections.size() << " intersections";
                    QPointF intersectionPoint = intersections[0].point;
                    qreal t1 = intersections[0].t1;
                    qreal t2 = intersections[0].t2;
                    if (BezierCurve::eLength(intersectionPoint - newCurve.getVertex(k - 1)) <= 0.1*tolerance)   // the first point is close to the intersection
                    {
                        newCurve.setVertex(k - 1, intersectionPoint); //qDebug() << "--k " << intersectionPoint;
                        //qDebug() << "--------- recal " << k-1 << intersectionPoint;
                    }
                    else
                    {
                        if (BezierCurve::eLength(intersectionPoint - newCurve.getVertex(k)) <= 0.1*tolerance)   // the second point is close to the intersection
                        {
                            newCurve.setVertex(k, intersectionPoint); //qDebug() << "--l " << intersectionPoint;
                            //qDebug() << "-------- recal " << k << intersectionPoint;
                        }
                        else     // none of the point is close to the intersection -> we add a new point
                        {
                            //newCurve.addPoint(k, intersectionPoint);
                            newCurve.addPoint(k, t1); //qDebug() << "--m " << newCurve.getVertex(k);
                            //qDebug() << "----- add " << k << newCurve.getVertex(k);
                            //k++;
                        }
                    }
                    if (BezierCurve::eLength(intersectionPoint - mCurves.at(i).getVertex(j - 1)) <= 0.1*tolerance)   // the first point is close to the intersection
                    {
                        mCurves[i].setVertex(j - 1, intersectionPoint); //qDebug() << "--n " << intersectionPoint;
                        //qDebug() << "-------- recal2 " << j-1 << intersectionPoint;
                    }
                    else
                    {
                        if (BezierCurve::eLength(intersectionPoint - mCurves.at(i).getVertex(j)) <= 0.1*tolerance)   // the second point is close to the intersection
                        {
                            mCurves[i].setVertex(j, intersectionPoint); //qDebug() << "--o " << intersectionPoint;
                            //qDebug() << "-------- recal2 " << j << intersectionPoint;
                        }
                        else     // none of the point is close to the intersection -> we add a new point
                        {
                            addPoint(i, j, t2);
                            //qDebug() << "----- add2 " << j << curve[i].getVertex(j);
                            //j++;
                        }
                    }
                }
            }
        }
    }
}

void VectorImage::select(QRectF rectangle)
{
    for (int i = 0; i < mCurves.size(); i++)
    {
        bool bSelected = mCurves[i].intersects(rectangle);
        setSelected(i, bSelected);
    }

    for (int i = 0; i < mArea.size(); i++)
    {
        bool b = rectangle.contains(mArea[i].mPath.boundingRect());
        setAreaSelected(i, b);
    }
    modification();
}

void VectorImage::setSelected(int curveNumber, bool YesOrNo)
{
    if (mCurves.isEmpty()) return;

    mCurves[curveNumber].setSelected(YesOrNo);

    if (YesOrNo)
        mSelectionRect |= mCurves[curveNumber].getBoundingRect();
    modification();
}

void VectorImage::setSelected(int curveNumber, int vertexNumber, bool YesOrNo)
{
    if (mCurves.isEmpty()) return;
    mCurves[curveNumber].setSelected(vertexNumber, YesOrNo);
    QPointF vertex = getVertex(curveNumber, vertexNumber);
    if (YesOrNo) mSelectionRect |= QRectF(vertex.x(), vertex.y(), 0.0, 0.0);

    modification();
}

void VectorImage::setSelected(VertexRef vertexRef, bool YesOrNo)
{
    setSelected(vertexRef.curveNumber, vertexRef.vertexNumber, YesOrNo);
}

void VectorImage::setSelected(QList<int> curveList, bool YesOrNo)
{
    for (int i = 0; i < curveList.size(); i++)
    {
        setSelected(curveList.at(i), YesOrNo);
    }
}

void VectorImage::setSelected(QList<VertexRef> vertexList, bool YesOrNo)
{
    for (int i = 0; i < vertexList.size(); i++)
    {
        setSelected(vertexList.at(i), YesOrNo);
    }
}

void VectorImage::setAreaSelected(int areaNumber, bool YesOrNo)
{
    mArea[areaNumber].setSelected(YesOrNo);
    if (YesOrNo) mSelectionRect |= mArea[areaNumber].mPath.boundingRect();
    modification();
}

bool VectorImage::isAreaSelected(int areaNumber)
{
    return mArea[areaNumber].isSelected();
}

bool VectorImage::isPathFilled()
{
    bool filled = false;
    QList<int> curveNumbers = getSelectedCurveNumbers();
    for (int curveNum : curveNumbers)
    {
        //qDebug() << mCurves[curveNum].isFilled();
        if (mCurves[curveNum].isSelected())
        {
            // FIXME: something wrong here.
            filled = mCurves[curveNum].isFilled();
        }
    }
    return filled;
}

bool VectorImage::isSelected(int curveNumber)
{
    return mCurves[curveNumber].isSelected();
}

bool VectorImage::isSelected(int curveNumber, int vertexNumber)
{
    return mCurves[curveNumber].isSelected(vertexNumber);
}

bool VectorImage::isSelected(VertexRef vertexRef)
{
    return isSelected(vertexRef.curveNumber, vertexRef.vertexNumber);
}

bool VectorImage::isSelected(QList<int> curveList)
{
    bool result = true;
    for (int i = 0; i < curveList.size(); i++)
    {
        result &= isSelected(curveList.at(i));
    }
    return result;
}

bool VectorImage::isSelected(QList<VertexRef> vertexList)
{
    bool result = true;
    for (int i = 0; i < vertexList.size(); i++)
    {
        result &= isSelected(vertexList.at(i));
    }
    return result;
}

int VectorImage::getFirstSelectedCurve()
{
    int result = -1;
    for (int i = 0; i < mCurves.size() && result == -1; i++)
    {
        if (isSelected(i)) result = i;
    }
    return result;
}

int VectorImage::getFirstSelectedArea()
{
    int result = -1;
    for (int i = 0; i < mArea.size() && result == -1; i++)
    {
        if (isAreaSelected(i)) result = i;
    }
    return result;
}

void VectorImage::selectAll()
{
    for (int i = 0; i < mCurves.size(); i++)
    {
        setSelected(i, true);
    }
    mSelectionTransformation.reset();
}

bool VectorImage::isAnyCurveSelected()
{
    if (mCurves.isEmpty()) return false;
    for (int curve = 0; curve < mCurves.size(); curve++)
    {
        if (mCurves[curve].isSelected()) return true;
    }
    return false;
}

void VectorImage::deselectAll()
{
    if (mCurves.empty()) return;
    for (int i = 0; i < mCurves.size(); i++)
    {
        mCurves[i].setSelected(false);
    }
    for (int i = 0; i < mArea.size(); i++)
    {
        mArea[i].setSelected(false);
    }
    mSelectionRect = QRectF(0, 0, 0, 0);
    mSelectionTransformation.reset();
    modification();
}

void VectorImage::setSelectionRect(QRectF rectangle)
{
    mSelectionRect = rectangle;
    select(rectangle);
}

void VectorImage::calculateSelectionRect()
{
    mSelectionRect = QRectF(0, 0, 0, 0);
    for (int i = 0; i < mCurves.size(); i++)
    {
        if (mCurves.at(i).isPartlySelected())
            mSelectionRect |= mCurves[i].getBoundingRect();
    }
}

void VectorImage::setSelectionTransformation(QTransform transform)
{
    mSelectionTransformation = transform;
    modification();
}

void VectorImage::deleteSelection()
{
    // ---- deletes areas
    for (int i = 0; i < mArea.size(); i++)
    {
        if (mArea[i].isSelected())
        {
            mArea.removeAt(i);
            i--;
        }
    }
    // ---- deletes curves
    for (int i = 0; i < mCurves.size(); i++)
    {
        if (mCurves[i].isSelected())
        {
            // eliminates areas which are associated to this curve
            for (int j = 0; j < mArea.size(); j++)
            {
                bool toBeDeleted = false;
                for (int k = 0; k < mArea.at(j).mVertex.size(); k++)
                {
                    if (mArea.at(j).mVertex[k].curveNumber == i) { toBeDeleted = true; }
                    if (mArea.at(j).mVertex[k].curveNumber > i)
                    {
                        mArea[j].mVertex[k].curveNumber = mArea[j].mVertex[k].curveNumber - 1;
                    }
                }
                if (toBeDeleted)
                {
                    mArea.removeAt(j);
                    j--;
                }
            }
            mCurves.removeAt(i);
            i--;
        }
    }
    modification();
}

void VectorImage::removeVertex(int curve, int vertex)
{
    // first eliminates areas which are associated to this point
    for (int j = 0; j < mArea.size(); j++)
    {
        bool toBeDeleted = false;
        for (int k = 0; k < mArea.at(j).mVertex.size(); k++)
        {
            if (mArea.at(j).mVertex[k].curveNumber == curve && mArea.at(j).mVertex[k].vertexNumber == vertex) { toBeDeleted = true; }
            //if (area.at(j).vertex[k].curveNumber > i) { area[j].vertex[k].curveNumber = area[j].vertex[k].curveNumber - 1; }
        }
        if (toBeDeleted)
        {
            mArea.removeAt(j);
            j--;
        }
    }
    // then eliminates the point
    if (mCurves[curve].getVertexSize() > 1)
    {
        // second possibility: we split the curve into two parts:
        if (vertex == -1 || vertex == getCurveSize(curve) - 1)   // we just remove the first or last point
        {
            mCurves[curve].removeVertex(vertex);
            vertex--;
            // we also need to update the areas
            for (int j = 0; j < mArea.size(); j++)
            {
                for (int k = 0; k < mArea.at(j).mVertex.size(); k++)
                {
                    if (mArea.at(j).mVertex[k].curveNumber == curve && mArea.at(j).mVertex[k].vertexNumber > vertex) { mArea[j].mVertex[k].vertexNumber--; }
                }
            }
        }
        else
        {
            int n = getCurveSize(curve);
            BezierCurve newCurve = mCurves.at(curve); // duplicate curve
            for (int p = vertex; p < n; p++)    // removes the end of of the curve i (after m, included) -> left part
            {
                mCurves[curve].removeVertex(getCurveSize(curve) - 1);
            }
            for (int p = -1; p <= vertex; p++)   // removes the beginning of the new curve (before m, included) -> right part
            {
                newCurve.removeVertex(-1);
            }
            //if (newCurve.getVertexSize() > 0) curve.insert(i+1, newCurve);
            if (newCurve.getVertexSize() > 0) mCurves.append(newCurve); // insert the right part if it has more than one point
            // we also need to update the areas
            for (int j = 0; j < mArea.size(); j++)
            {
                for (int k = 0; k < mArea.at(j).mVertex.size(); k++)
                {
                    if (mArea.at(j).mVertex[k].curveNumber == curve && mArea.at(j).mVertex[k].vertexNumber > vertex)
                    {
                        mArea[j].mVertex[k].curveNumber = mCurves.size() - 1;
                        mArea[j].mVertex[k].vertexNumber = mArea[j].mVertex[k].vertexNumber - vertex - 1;
                    }
                }
            }

            if (getCurveSize(curve) < 1)   // the left part has less than two points so we remove it
            {
                removeCurveAt(curve);
                curve--;
            }
        }
    }
    else     // there are just two points left, so we remove the whole curve
    {
        removeCurveAt(curve);
        curve--;
    }
}

void VectorImage::deleteSelectedPoints()
{
    for (int i = 0; i < mCurves.size(); i++)
    {
        for (int m = -1; m < getCurveSize(i); m++)
        {
            if (mCurves.at(i).isSelected(m))   // point m of curve i is selected
            {
                removeVertex(i, m);
            }
        }
    }
    modification();
}

void VectorImage::paste(VectorImage& vectorImage)
{
    mSelectionRect = QRect(0, 0, 0, 0);
    int n = mCurves.size();
    QList<int> selectedCurves;

    bool hasSelection = getFirstSelectedCurve() < -1;

    for (int i = 0; i < vectorImage.mCurves.size(); i++)
    {
        // If nothing is selected, paste everything
        if (!hasSelection || vectorImage.mCurves.at(i).isSelected())
        {
            mCurves.append(vectorImage.mCurves.at(i));
            selectedCurves << i;
            mSelectionRect |= vectorImage.mCurves[i].getBoundingRect();
        }
    }
    for (int i = 0; i < vectorImage.mArea.size(); i++)
    {
        BezierArea newArea = vectorImage.mArea.at(i);
        bool ok = true;
        for (int j = 0; j < newArea.mVertex.size(); j++)
        {
            int curveNumber = newArea.mVertex.at(j).curveNumber;
            int vertexNumber = newArea.mVertex.at(j).vertexNumber;

            // If nothing is selected, paste everything
            //
            if (!hasSelection || vectorImage.mCurves.at(curveNumber).isSelected())
            {
                newArea.mVertex[j] = VertexRef(selectedCurves.indexOf(curveNumber) + n, vertexNumber);
            }
            else
            {
                ok = false;
            }
        }
        if (ok) mArea.append(newArea);
    }
    modification();
}

QColor VectorImage::getColor(int colorNumber)
{
    return mObject->getColor(colorNumber).color;
}

int VectorImage::getColorNumber(QPointF point)
{
    int result = -1;
    int areaNumber = getLastAreaNumber(point);
    if (areaNumber != -1)
    {
        result = mArea[areaNumber].mColorNumber;
    }
    return result;
}
int VectorImage::getCurvesColor(int curve)
{
    int result = -1;
    if (curve > -1)
    {
        result = mCurves[curve].getColorNumber();
    }
    return result;
}

bool VectorImage::isCurveVisible(int curve)
{
    if (curve > -1 && curve < mCurves.length())
    {
        return !mCurves[curve].isInvisible();
    }
    return false;
}

bool VectorImage::usesColor(int index)
{
    for (int i = 0; i < mArea.size(); i++)
    {
        if (mArea[i].mColorNumber == index) return true;
    }
    for (int i = 0; i < mCurves.size(); i++)
    {
        if (mCurves[i].getColorNumber() == index) return true;
    }
    return false;
}

void VectorImage::removeColor(int index)
{
    for (int i = 0; i < mArea.size(); i++)
    {
        if (mArea[i].getColorNumber() > index) mArea[i].decreaseColorNumber();
    }
    for (int i = 0; i < mCurves.size(); i++)
    {
        if (mCurves[i].getColorNumber() > index) mCurves[i].decreaseColorNumber();
    }
}

void VectorImage::moveColor(int start, int end)
{
    for(int i=0; i< mArea.size(); i++)
     {
         if (mArea[i].getColorNumber() == start) mArea[i].setColorNumber(end);
     }
     for(int i=0; i< mCurves.size(); i++)
     {
         if (mCurves[i].getColorNumber() == start) mCurves[i].setColorNumber(end);
     }
}

void VectorImage::paintImage(QPainter& painter,
    bool simplified,
    bool showThinCurves,
    bool antialiasing)
{
    painter.setRenderHint(QPainter::Antialiasing, antialiasing);

    painter.setClipping(false);
    painter.setOpacity(1.0);
    QTransform painterMatrix = painter.transform();

    QRect mappedViewRect = QRect(0, 0, painter.device()->width(), painter.device()->height());
    painterMatrix.inverted().mapRect(mappedViewRect);

    // --- draw filled areas ----
    if (!simplified)
    {
        for (int i = 0; i < mArea.size(); i++)
        {
            updateArea(mArea[i]); // to do: if selected

            // --- fill areas ---- //
            QColor color = getColor(mArea[i].mColorNumber);

            painter.save();
            painter.setWorldMatrixEnabled(false);

            if (mArea[i].isSelected())
            {
                painter.setBrush(QBrush(qPremultiply(color.rgba()), Qt::Dense2Pattern));
            }
            else
            {
                painter.setPen(QPen(QBrush(color), 1, Qt::NoPen, Qt::RoundCap, Qt::RoundJoin));
                painter.setBrush(QBrush(color, Qt::SolidPattern));
            }

            painter.drawPath(painter.transform().map(mArea[i].mPath));
            painter.restore();
            painter.setWorldMatrixEnabled(true);
            painter.setRenderHint(QPainter::Antialiasing, antialiasing);
            painter.setClipping(false);
        }
    }

    // ---- draw curves ----
    for (BezierCurve curve : mCurves)
    {
        curve.drawPath(painter, mObject, mSelectionTransformation, simplified, showThinCurves);
        painter.setClipping(false);
    }
}

void VectorImage::outputImage(QImage* image,
                              QTransform myView,
                              bool simplified,
                              bool showThinCurves,
                              bool antialiasing)
{
    image->fill(qRgba(0, 0, 0, 0));
    QPainter painter(image);
    painter.setTransform(myView);
    paintImage(painter, simplified, showThinCurves, antialiasing);
}

void VectorImage::clear()
{
    while (mCurves.size() > 0) { mCurves.removeAt(0); }
    while (mArea.size() > 0) { mArea.removeAt(0); }
    modification();
}

void VectorImage::clean()
{
    for (int i = 0; i < mCurves.size(); i++)
    {
        if (mCurves.at(i).getVertexSize() == 0)
        {
            mCurves.removeAt(i);
            i--;
        }
    }
}

void VectorImage::applySelectionTransformation()
{
    applySelectionTransformation(mSelectionTransformation);
}

void VectorImage::applySelectionTransformation(QTransform transf)
{
    for (int i = 0; i < mCurves.size(); i++)
    {
        if (mCurves.at(i).isPartlySelected())
        {
            mCurves[i].transform(transf);
        }
    }
    calculateSelectionRect();
    mSelectionTransformation.reset();
    modification();
}

void VectorImage::applyColorToSelectedCurve(int colorNumber)
{
    for (int i = 0; i < mCurves.size(); i++)
    {
        if (mCurves.at(i).isSelected()) mCurves[i].setColorNumber(colorNumber);
    }
    modification();
}

void VectorImage::applyColorToSelectedArea(int colorNumber)
{
    for (int i = 0; i < mArea.size(); i++)
    {
        if (mArea.at(i).isSelected()) mArea[i].setColorNumber(colorNumber);
    }
    modification();
}

void VectorImage::applyWidthToSelection(qreal width)
{
    for (int i = 0; i < mCurves.size(); i++)
    {
        if (mCurves.at(i).isSelected()) mCurves[i].setWidth(width);
    }
    modification();
}

void VectorImage::applyFeatherToSelection(qreal feather)
{
    for (int i = 0; i < mCurves.size(); i++)
    {
        if (mCurves.at(i).isSelected()) mCurves[i].setFeather(feather);
    }
    modification();
}

void VectorImage::applyOpacityToSelection(qreal opacity)
{
    Q_UNUSED(opacity);
    for (int i = 0; i < mCurves.size(); i++)
    {
        //if ( curve.at(i).isSelected()) curve[i].setOpacity(width);
    }
    modification();
}

void VectorImage::applyInvisibilityToSelection(bool YesOrNo)
{
    for (int i = 0; i < mCurves.size(); i++)
    {
        if (mCurves.at(i).isSelected()) mCurves[i].setInvisibility(YesOrNo);
    }
    modification();
}

void VectorImage::applyVariableWidthToSelection(bool YesOrNo)
{
    for (int i = 0; i < mCurves.size(); i++)
    {
        if (mCurves.at(i).isSelected()) {
            mCurves[i].setVariableWidth(YesOrNo);
        }
    }
    modification();
}

QList<int> VectorImage::getCurvesCloseTo(QPointF P1, qreal maxDistance)
{
    QList<int> result;
    for (int j = 0; j < mCurves.size(); j++)
    {
        BezierCurve myCurve;
        if (mCurves[j].isPartlySelected())
        {
            myCurve = mCurves[j].transformed(mSelectionTransformation);
        }
        else
        {
            myCurve = mCurves[j];
        }
        if (myCurve.intersects(P1, maxDistance))
        {
            result.append(j);
            // store stroke for later use.
            mGetStrokedPath = myCurve.getStrokedPath(1.0, true);
        }
    }
    return result;
}

VertexRef VectorImage::getClosestVertexTo(const BezierCurve& curve, int curveNum, QPointF thePoint)
{
    VertexRef result;
    result = VertexRef(-1, -1);  // result = [-1, -1]

    // distance of the closest point
    QPointF P2 = getVertex(0, 0);
    qreal minDistance = thePoint.dotProduct(QPointF(thePoint - P2), QPointF(thePoint - P2));

    for (int vertexPoint = -1; vertexPoint < curve.getVertexSize(); vertexPoint++)
    {
        P2 = curve.getVertex(vertexPoint);
        qreal distance = thePoint.dotProduct(QPointF(thePoint - P2), QPointF(thePoint - P2));

        if (distance < minDistance)
        {
            minDistance = distance;
            result = VertexRef(curveNum, vertexPoint);
        }
    }
    return result;
}

QList<VertexRef> VectorImage::getVerticesCloseTo(QPointF P1, qreal maxDistance)
{
    QList<VertexRef> result;

    // Square maxDistance rather than taking the square root for each distance
    maxDistance *= maxDistance;

    for (int curve = 0; curve < mCurves.size(); curve++)
    {
        for (int vertex = -1; vertex < mCurves.at(curve).getVertexSize(); vertex++)
        {
            QPointF P2 = getVertex(curve, vertex);
            qreal distance = P1.dotProduct(QPointF(P1 - P2), QPointF(P1 - P2));
            if (distance < maxDistance)
            {
                result.append(VertexRef(curve, vertex));
            }
        }
    }
    return result;
}

QList<VertexRef> VectorImage::getVerticesCloseTo(QPointF P1, qreal maxDistance, QList<VertexRef>* listOfPoints)
{
    QList<VertexRef> result;
    for (int j = 0; j < listOfPoints->size(); j++)
    {
        QPointF P2 = getVertex(listOfPoints->at(j));
        qreal distance = P1.dotProduct(QPointF(P1 - P2), QPointF(P1 - P2));
        if (distance < maxDistance)
        {
            result.append(listOfPoints->at(j));
        }
    }
    return result;
}

QList<VertexRef> VectorImage::getVerticesCloseTo(VertexRef P1ref, qreal maxDistance)
{
    return getVerticesCloseTo(getVertex(P1ref), maxDistance);
}

QList<VertexRef> VectorImage::getVerticesCloseTo(VertexRef P1ref, qreal maxDistance, QList<VertexRef>* listOfPoints)
{
    return getVerticesCloseTo(getVertex(P1ref), maxDistance, listOfPoints);
}

QList<VertexRef> VectorImage::getAndRemoveVerticesCloseTo(QPointF P1, qreal maxDistance, QList<VertexRef>* listOfPoints)
{
    QList<VertexRef> result;
    for (int j = 0; j < listOfPoints->size(); j++)
    {
        QPointF P2 = getVertex(listOfPoints->at(j));
        qreal distance = P1.dotProduct(QPointF(P1 - P2), QPointF(P1 - P2));
        if (distance < maxDistance)
        {
            result.append(listOfPoints->at(j));
            listOfPoints->removeAt(j);
        }
    }
    return result;
}

QList<VertexRef> VectorImage::getAndRemoveVerticesCloseTo(VertexRef P1Ref, qreal maxDistance, QList<VertexRef>* listOfPoints)
{
    return getAndRemoveVerticesCloseTo(getVertex(P1Ref), maxDistance, listOfPoints);
}

QPointF VectorImage::getVertex(int curveNumber, int vertexNumber)
{
    QPointF result = QPointF(0, 0);
    if (curveNumber > -1 && curveNumber < mCurves.size())
    {
        BezierCurve myCurve = mCurves.at(curveNumber);
        if (myCurve.isPartlySelected())
        {
            myCurve = myCurve.transformed(mSelectionTransformation);
        }

        if (vertexNumber > -2 && vertexNumber < myCurve.getVertexSize())
        {
            result = myCurve.getVertex(vertexNumber);
        }
    }
    return result;
}

QPointF VectorImage::getVertex(VertexRef vertexRef)
{
    return getVertex(vertexRef.curveNumber, vertexRef.vertexNumber);
}

QPointF VectorImage::getC1(int curveNumber, int vertexNumber)
{
    QPointF result = QPointF(0, 0);
    if (curveNumber > -1 && curveNumber < mCurves.size())
    {
        BezierCurve myCurve = mCurves.at(curveNumber);
        if (myCurve.isPartlySelected()) myCurve = myCurve.transformed(mSelectionTransformation);
        if (vertexNumber > -1 && vertexNumber < myCurve.getVertexSize())
        {
            result = myCurve.getC1(vertexNumber);
        }
    }
    return result;
}

QPointF VectorImage::getC1(VertexRef vertexRef)
{
    return getC1(vertexRef.curveNumber, vertexRef.vertexNumber);
}

QPointF VectorImage::getC2(int curveNumber, int vertexNumber)
{
    QPointF result = QPointF(0, 0);
    if (curveNumber > -1 && curveNumber < mCurves.size())
    {
        BezierCurve myCurve = mCurves.at(curveNumber);
        if (myCurve.isPartlySelected()) myCurve = myCurve.transformed(mSelectionTransformation);
        if (vertexNumber > -1 && vertexNumber < myCurve.getVertexSize())
        {
            result = myCurve.getC2(vertexNumber);
        }
    }
    return result;
}

QPointF VectorImage::getC2(VertexRef vertexRef)
{
    return getC2(vertexRef.curveNumber, vertexRef.vertexNumber);
}

QList<VertexRef> VectorImage::getCurveVertices(int curveNumber)
{
    QList<VertexRef> result;

    if (curveNumber > -1 && curveNumber < mCurves.size())
    {
        BezierCurve myCurve = mCurves[curveNumber];

        for (int k = -1; k < myCurve.getVertexSize(); k++)
        {
            VertexRef vertexRef = VertexRef(curveNumber, k);
            result.append(vertexRef);
        }
    }

    return result;
}

QList<VertexRef> VectorImage::getAllVertices()
{
    QList<VertexRef> result;
    for (int j = 0; j < mCurves.size(); j++)
    {
        for (int k = -1; k < mCurves.at(j).getVertexSize(); k++)
        {
            VertexRef vertexRef = VertexRef(j, k);
            result.append(vertexRef);
        }
    }
    // Add Area vertices
    return result;
}

int VectorImage::getCurveSize(int curveNumber)
{
    if (curveNumber > -1 && curveNumber < mCurves.size())
    {
        return mCurves.at(curveNumber).getVertexSize();
    }
    else
    {
        return -1;
    }
}

QList<BezierCurve> VectorImage::getSelectedCurves()
{
    QList<BezierCurve> curves;
    for (int curve = 0; curve < mCurves.size(); curve++)
    {
        if (mCurves[curve].isSelected())
        {
            curves.append(mCurves[curve]);
        }
    }
    return curves;
}

QList<int> VectorImage::getSelectedCurveNumbers()
{
    QList<int> result;
    for (int curve = 0; curve < mCurves.size(); curve++)
    {
        if (mCurves[curve].isSelected())
        {
            result.append(curve);
        }
    }
    return result;
}

int VectorImage::getNumOfCurvesSelected()
{
    int count = 0;
    for (int curve = 0; curve < mCurves.size(); curve++)
    {
        if (mCurves[curve].isSelected())
        {
            count++;
        }
    }
    return count;
}

BezierArea VectorImage::getSelectedArea(QPointF currentPoint)
{
    for (int i = 0; i < mArea.size(); i++)
    {
        if (mArea[i].mPath.controlPointRect().contains(currentPoint))
        {
            return mArea[i];
        }
    }
    return BezierArea();
}

void VectorImage::fillSelectedPath(int color)
{
    QList<VertexRef> vertexPath;
    QList<int> curveNumbers = getSelectedCurveNumbers();
    QList<BezierCurve> curves = getSelectedCurves();
    QList<VertexRef> vertexList;
    VertexRef vertex;
    for (int curve = 0; curve < getNumOfCurvesSelected(); curve++)
    {
        vertexList = getCurveVertices(curveNumbers[curve]);
        for (int i = 0; i < vertexList.size(); i++)
        {
            QPointF point = getVertex(vertexList[i]);
            vertex = getClosestVertexTo(curves[curve], curveNumbers[curve], point);

            if (vertex.curveNumber != -1 && !vertexPath.contains(vertex))
            {
                vertexPath.append(vertex);
            }
        }

        BezierArea bezierArea(vertexPath, color);
        addArea(bezierArea);

        // set selected curves as filled
        mCurves[curveNumbers[curve]].setFilled(true);

        // clear path for next area
        vertexPath.clear();
    }

    modification();
}

void VectorImage::fillContour(QList<QPointF> contourPath, int color)
{
    QList<VertexRef> vertexPath;
    VertexRef vertex;

    BezierCurve lastCurve = getLastCurve();
    int lastCurveNum = getLastCurveNumber();

    for (QPointF point : contourPath) {
        vertex = getClosestVertexTo(lastCurve, lastCurveNum, point);

        if (vertex.curveNumber != -1 && !vertexPath.contains(vertex)) {
            vertexPath.append(vertex);
        }
    }

    BezierArea bezierArea(vertexPath, color);

    addArea(bezierArea);
    modification();
}

//QList<QPointF> VectorImage::getfillContourPoints(QPoint point)
//{
//    // We get the contour points from a bitmap version of the vector layer as it is much faster to process
//    QImage* image = new QImage( mSize, QImage::Format_ARGB32_Premultiplied );
//    image->fill(Qt::white);
//    QPainter painter( image );

//    // Adapt the QWidget view coordinates to the QImage coordinates
//    QTransform translate;
//    translate.translate( mSize.width() / 2.f , mSize.height() / 2.f );
//    painter.setTransform( translate );
//    paintImage( painter, true, true, false );

//    QList<QPoint> queue; // queue all the pixels of the filled area (as they are found)
//    QList<QPointF> contourPoints; // refs of points near the contour pixels

//    qreal maxWidth = mSize.width();
//    qreal maxHeight = mSize.height();

//    // To keep track of the highest y contour point to make sure it is on the main contour and not inside.
//    int highestY = point.y();

//    // Convert point to image coordinates as the image doesn't have the same coordinates origin as the
//    // QWidget view
//    QPointF startPoint((maxWidth / 2) + point.x(), (maxHeight / 2) + point.y());
//    queue.append( startPoint.toPoint() );

//    // Check the color of the clicked point
//    QRgb colorFrom = image->pixel(startPoint.x(), startPoint.y());
//    QRgb colorTo = Qt::green;

//    QPoint currentPoint;

//    int leftX, rightX;
//    bool foundLeftBound, foundRightBound;

//    // ----- flood fill and remember the contour pixels -> contourPixels
//    // ----- from the standard flood fill algorithm
//    // ----- http://en.wikipedia.org/wiki/Flood_fill
//    while ( queue.size() > 0 ) {

//        // Get the first point in the queue and remove it afterwards
//        currentPoint = queue.at(0);
//        queue.removeAt(0);

//        // Inspect a line from edge to edge
//        if (image->pixel(currentPoint.x(), currentPoint.y()) == colorFrom) {
//            leftX = currentPoint.x();
//            rightX = currentPoint.x();

//            foundLeftBound = false;
//            foundRightBound = false;

//            while (!foundLeftBound) {
//                leftX--;

//                // Are we getting to the end of the document ?
//                if ( leftX < 1) {
//                    qWarning() << " Out of bound left ";
//                    QList<QPointF> emptylist;
//                    return emptylist;
//                }

//                QPoint leftPoint = QPoint(leftX, currentPoint.y());

//                // Are we getting to a curve ?
//                if ( image->pixel(leftPoint.x(), leftPoint.y()) != colorFrom &&
//                     image->pixel(leftPoint.x(), leftPoint.y()) != colorTo ) {

//                    foundLeftBound = true;

//                    // Convert point to view coordinates
//                    QPointF contourPoint( leftPoint.x() - (maxWidth / 2), leftPoint.y() - (maxHeight / 2));

//                    // Check if the left bound is just a line crossing the main shape
//                    bool foundFillAfter = false;
//                    int increment = 1;

//                    while (leftPoint.x() - increment > 0 && increment < 3 && !foundFillAfter) {
//                        QPoint pointAfter = QPoint(leftPoint.x() - increment, leftPoint.y());

//                        if (image->pixel(pointAfter.x(), pointAfter.y()) == colorTo) {
//                            foundFillAfter = true;
//                        }

//                        increment++;
//                    }

//                    // If the bound is not a contour, we must ignore it
//                    if (foundFillAfter) {

//                        // If the bound is not a contour, we must ignore it
//                        contourPoints.removeOne(contourPoint);
//                    } else {
//                        contourPoints.append(contourPoint);
//                    }
//                }
//            }

//            while (!foundRightBound) {
//                rightX++;

//                // Are we getting to the end of the document ?
//                if ( rightX > maxWidth - 1 ) {
//                    qWarning() << " Out of bound right ";
//                    QList<QPointF> emptylist;
//                    return emptylist;
//                }

//                QPoint rightPoint = QPoint(rightX, currentPoint.y());

//                // Are we getting to a curve ?
//                if ( image->pixel(rightPoint.x(), rightPoint.y()) != colorFrom &&
//                     image->pixel(rightPoint.x(), rightPoint.y()) != colorTo) {

//                    foundRightBound = true;

//                    // Convert point to view coordinates
//                    QPointF contourPoint( rightPoint.x() - (maxWidth / 2), rightPoint.y() - (maxHeight / 2));

//                    // Check if the left bound is just a line crossing the main shape
//                    bool foundFillAfter = false;
//                    int increment = 1;

//                    while (rightPoint.x() + increment < maxWidth && increment < 3 && !foundFillAfter) {
//                        QPoint pointAfter = QPoint(rightPoint.x() + increment, rightPoint.y());

//                        if (image->pixel(pointAfter.x(), pointAfter.y()) == colorTo) {
//                            foundFillAfter = true;
//                        }

//                        increment++;
//                    }

//                    if (foundFillAfter) {

//                        // If the bound is not a contour, we must ignore it
//                        contourPoints.removeOne(contourPoint);
//                    } else {
//                        contourPoints.append(contourPoint);
//                    }
//                }
//            }

//            int lineY = currentPoint.y();
//            int topY = lineY - 1;
//            int bottomY = lineY + 1;

//            if ( topY < 1 || bottomY > maxHeight - 1 ) {
//                qWarning() << " Out of bound top / bottom ";
//                QList<QPointF> emptylist;
//                return emptylist;
//            }

//            for (int x = leftX + 1; x < rightX; x++) {

//                // The current line point is checked (Colored)
//                QPoint linePoint = QPoint(x, lineY);
//                image->setPixel(linePoint.x(), linePoint.y(), colorTo);

//                QPoint topPoint = QPoint(x, topY);

//                if ( image->pixel(topPoint.x(), topPoint.y()) != colorFrom &&
//                     image->pixel(topPoint.x(), topPoint.y()) != colorTo) {

//                    // Convert point to view coordinates
//                    QPointF contourPoint( topPoint.x() - (maxWidth / 2), topPoint.y() - (maxHeight / 2));

//                    // Check if the left bound is just a line crossing the main shape
//                    bool foundFillAfter = false;
//                    int increment = 1;

//                    while (topPoint.y() - increment > 0 && increment < 3 && !foundFillAfter) {
//                        QPoint pointAfter = QPoint(topPoint.x(), topPoint.y() - increment);

//                        if (image->pixel(pointAfter.x(), pointAfter.y()) == colorTo) {
//                            foundFillAfter = true;
//                        }
//                        increment ++;
//                    }


//                    if (foundFillAfter) {

//                        // If the bound is not a contour, we must ignore it
//                        contourPoints.removeOne(contourPoint);
//                    } else {
//                        contourPoints.append(contourPoint);
//                    }
//                } else {
//                    queue.append(topPoint);
//                }

//                QPoint bottomPoint = QPoint(x, bottomY);

//                if ( image->pixel(bottomPoint.x(), bottomPoint.y()) != colorFrom &&
//                     image->pixel(bottomPoint.x(), bottomPoint.y()) != colorTo ) {

//                    QPointF contourPoint( bottomPoint.x() - (maxWidth / 2), bottomPoint.y() - (maxHeight / 2));

//                    // Check if the left bound is just a line crossing the main shape
//                    bool foundFillAfter = false;
//                    int increment = 1;

//                    while (bottomPoint.y() + increment < maxHeight && increment < 3 && !foundFillAfter) {
//                        QPoint pointAfter = QPoint(bottomPoint.x(), bottomPoint.y() + increment);

//                        if (image->pixel(pointAfter.x(), pointAfter.y()) == colorTo) {
//                            foundFillAfter = true;
//                        }

//                        increment++;
//                    }

//                    if (foundFillAfter) {

//                        // If the bound is not a contour, we must ignore it
//                        contourPoints.removeOne(contourPoint);
//                    }
//                    else {

//                        // Keep track of the highest Y position (lowest point) at the beginning of the list
//                        // so that we can parse the list from a point that is a real extremity.
//                        // of the area.
//                        if (highestY < bottomY) {

//                            highestY = bottomY;
//                            contourPoints.insert(0, contourPoint);
//                        } else {
//                            contourPoints.append(contourPoint);
//                        }
//                    }

//                } else {
//                    queue.append(bottomPoint);
//                }
//            }
//        }
//    }
//    return contourPoints;
//}

//void VectorImage::fill(QPointF point, int color, float tolerance)
//{
//    // Check if we clicked on a curve. In that case, we change its color.
//    QList<int> closestCurves = getCurvesCloseTo( point, tolerance );

//    if (closestCurves.size() > 0) // the user click on one or more curves
//    {
//        // For each clicked curves, we change the color if requiered
//        for (int i = 0; i < closestCurves.size(); i++) {
//            int curveNumber = closestCurves[i];
//            m_curves[curveNumber].setColorNumber(color);
//        }

//        return;
//    }

//    // Check if we clicked on an area of the same color.
//    // We don't want to create another area.
//    int areaNum = getLastAreaNumber(point);
//    if (areaNum > -1 && area[areaNum].mColorNumber == color) {
//        return;
//    }

//    // Get the contour points
//    QList<QPointF> contourPoints = getfillContourPoints(point.toPoint());

//    // Make a path from the external contour points.
//    // Put the points in the right order.
//    QList<QPointF> mainContourPath;
//    QPointF currentPoint;

//    if (contourPoints.size() > 0) {
//        currentPoint = QPointF(contourPoints[0].x(), contourPoints[0].y());
//        mainContourPath.append(currentPoint);
//        contourPoints.removeAt(0);
//    }

//    bool completedPath = false;
//    bool foundError = (contourPoints.size() < 1 && !completedPath);

//    int maxDelta = 2;
//    int minDelta = -2;

//    while (!completedPath && !foundError) {

//        bool foundNextPoint = false;

//        int i = 0;
//        while (i < contourPoints.size() && !foundNextPoint) {
//            QPointF point = contourPoints.at(i);

//            if (mainContourPath.contains(point)) {
//                contourPoints.removeAt(i);
//            }
//            else {
//                qreal deltaX = currentPoint.x() - point.x();
//                qreal deltaY = currentPoint.y() - point.y();

//                if ( (deltaX < maxDelta && deltaX > minDelta) &&
//                     (deltaY < maxDelta && deltaY > minDelta)) {

//                    currentPoint = QPointF(point.x(), point.y());
//                    mainContourPath.append(currentPoint);
//                    contourPoints.removeAt(i);

//                    foundNextPoint = true;

//                    maxDelta = 2;
//                    minDelta = -2;
//                }
//                i++;
//            }
//        }

//        // Check if we have looped
//        if (!foundNextPoint) {

//            qreal deltaX = currentPoint.x() - mainContourPath[0].x();
//            qreal deltaY = currentPoint.y() - mainContourPath[0].y();

//            if ( (deltaX < maxDelta && deltaX > minDelta) &&
//                 (deltaY < maxDelta && deltaY > minDelta)) {
//                completedPath = true;
//                foundNextPoint = true;
//            }
//            else if (maxDelta == 2){
//                // Check if we can find the point after
//                //
//                maxDelta = 3;
//                minDelta = -3;
//                foundNextPoint = true;
//            }
//            else {
//                qWarning() << " couldn't find next point after " << currentPoint.x() << ", " << currentPoint.y();
//            }
//        }
//        else if (contourPoints.size() < 1) {
//            // If we found the next point and we have no more points, it means, we have the end of the path
//            completedPath = true;
//            foundNextPoint = true;
//        }

//        foundError = ( (contourPoints.size() < 1 && !completedPath) || !foundNextPoint );
//    }

//    // Add exclude paths

//    // Fill the path if we have one.
//    if (completedPath) {
//        fillSelectedPath(mainContourPath, color);
//    }
//    else {
//        // Check if we clicked on an area in this position and as we couldn't create one,
//        // we update this one. It may be an area drawn from a stroke path.
//        int areaNum = getLastAreaNumber(point);
//        if (areaNum > -1) {

//            int clickedColorNum = area[areaNum].getColorNumber();

//            if (clickedColorNum != color) {
//                area[areaNum].setColorNumber(color);
//            }
//        }
//    }
//}

void VectorImage::addArea(BezierArea bezierArea)
{
    updateArea(bezierArea);
    mArea.append(bezierArea);
    modification();
}

int VectorImage::getFirstAreaNumber(QPointF point)
{
    int result = -1;
    for (int i = 0; i < mArea.size() && result == -1; i++)
    {
        if (mArea[i].mPath.controlPointRect().contains(point))
        {
            if (mArea[i].mPath.contains(point))
            {
                result = i;
            }
        }
    }
    return result;
}

int VectorImage::getLastAreaNumber(QPointF point)
{
    return getLastAreaNumber(point, mArea.size() - 1);
}
int VectorImage::getLastCurveNumber()
{
    return !mCurves.isEmpty() ? mCurves.size() - 1 : 0;
}

BezierCurve VectorImage::getLastCurve()
{
    return !mCurves.isEmpty() ? mCurves[mCurves.size() - 1] : BezierCurve();
}

int VectorImage::getLastAreaNumber(QPointF point, int maxAreaNumber)
{
    int result = -1;
    for (int i = maxAreaNumber; i > -1 && result == -1; i--)
    {
        if (mArea[i].mPath.controlPointRect().contains(point))
        {
            if (mArea[i].mPath.contains(point))
            {
                result = i;
            }
        }
    }
    return result;
}

void VectorImage::removeArea(QPointF point)
{
    int areaNumber = getLastAreaNumber(point);
    if (areaNumber != -1)
    {
        mArea.removeAt(areaNumber);
    }
    modification();
}

void VectorImage::removeAreaInCurve(int curve, int areaNumber)
{
    QPointF areaPoint = getVertex(curve, areaNumber);
    removeArea(areaPoint);
}

void VectorImage::updateArea(BezierArea& bezierArea)
{
    QPainterPath newPath;
    for (int i = 0; i < bezierArea.mVertex.size(); i++)
    {
        QPointF myPoint = getVertex(bezierArea.mVertex[i]);
        QPointF myC1;
        QPointF myC2;

        if (i == 0)
        {
            newPath.moveTo(myPoint);
        }
        else
        {
            if (bezierArea.mVertex[i - 1].curveNumber == bezierArea.mVertex[i].curveNumber)   // the two points are on the same curve
            {
                if (bezierArea.mVertex[i - 1].vertexNumber < bezierArea.mVertex[i].vertexNumber)   // the points follow the curve progression
                {
                    myC1 = getC1(bezierArea.mVertex[i]);
                    myC2 = getC2(bezierArea.mVertex[i]);
                }
                else
                {
                    myC1 = getC2(bezierArea.mVertex[i - 1]);
                    myC2 = getC1(bezierArea.mVertex[i - 1]);
                }
                newPath.cubicTo(myC1, myC2, myPoint);
            }
            else // the two points are not the same curve
            {
                if (bezierArea.mVertex[i].vertexNumber == -1)   // the current point is the first point in the new curve
                {
                    newPath.lineTo(myPoint);
                }
                else
                {
                    newPath.lineTo(myPoint);
                }
            }
        }
    }
    newPath.closeSubpath();
    bezierArea.mPath = newPath;
    bezierArea.mPath.setFillRule(Qt::WindingFill);
}

qreal VectorImage::getDistance(VertexRef r1, VertexRef r2)
{
    return BezierCurve::eLength(getVertex(r1) - getVertex(r2));
}

void VectorImage::updateImageSize(BezierCurve& updatedCurve) {

    // Set the current width of the document based on the extremity of the drawing.
    //
    // It calculates the size of the document in a way that the center point from
    // the view (0, 0) is always the center point of the document.
    //
    // It adds a point to the 4 sides of the document size in order
    // make sure that any curve, any vertex stays within the document.
    //

    QRectF rect = updatedCurve.getBoundingRect();

    QPoint topLeft = rect.topLeft().toPoint();
    QPoint bottomRight = rect.bottomRight().toPoint();

    int widthFromLeft = ((topLeft.x() * -1) * 2) + 2;

    if (widthFromLeft > mSize.width())
    {
        mSize.setWidth(widthFromLeft);
    }

    int widthFromRight = (bottomRight.x() * 2) + 2;

    if (widthFromRight > mSize.width())
    {
        mSize.setWidth(widthFromRight);
    }

    int heightFromTop = ((topLeft.y() * -1) * 2) + 2;

    if (heightFromTop > mSize.height())
    {
        mSize.setHeight(heightFromTop);
    }

    int heightFromBottom = (bottomRight.y() * 2) + 2;

    if (heightFromBottom > mSize.height())
    {
        mSize.setHeight(heightFromBottom);
    }
}