You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
101 lines
3.2 KiB
101 lines
3.2 KiB
/*
|
|
* This file is part of Chalk
|
|
*
|
|
* Copyright (c) 2006 Cyrille Berger <cberger@cberger.net>
|
|
*
|
|
* 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; either version 2 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* 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.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
*/
|
|
|
|
#include "kis_perspective_grid.h"
|
|
|
|
int KisSubPerspectiveGrid::s_lastIndex = 0;
|
|
|
|
KisSubPerspectiveGrid::KisSubPerspectiveGrid(KisPerspectiveGridNodeSP topLeft, KisPerspectiveGridNodeSP topRight, KisPerspectiveGridNodeSP bottomRight, KisPerspectiveGridNodeSP bottomLeft) : m_topLeft(topLeft), m_topRight(topRight), m_bottomRight(bottomRight), m_bottomLeft(bottomLeft), m_subdivisions(5), m_leftGrid(0), m_rightGrid(0), m_topGrid(0), m_bottomGrid(0), m_index(++s_lastIndex)
|
|
{
|
|
|
|
}
|
|
|
|
bool KisSubPerspectiveGrid::contains(const KisPoint p) const
|
|
{
|
|
return true;
|
|
KisPerspectiveMath::LineEquation d1 = KisPerspectiveMath::computeLineEquation( topLeft(), topRight() );
|
|
kdDebug() << p.y() << " " << (p.x() * d1.a + d1.b) << endl;
|
|
if( p.y() >= p.x() * d1.a + d1.b)
|
|
{
|
|
d1 = KisPerspectiveMath::computeLineEquation( topRight(), bottomRight() );
|
|
kdDebug() << p.y() << " " << (p.x() * d1.a + d1.b) << endl;
|
|
if( p.y() >= p.x() * d1.a + d1.b)
|
|
{
|
|
d1 = KisPerspectiveMath::computeLineEquation( bottomRight(), bottomLeft() );
|
|
kdDebug() << p.y() << " " << (p.x() * d1.a + d1.b) << endl;
|
|
if( p.y() <= p.x() * d1.a + d1.b)
|
|
{
|
|
d1 = KisPerspectiveMath::computeLineEquation( bottomLeft(), topLeft() );
|
|
kdDebug() << p.y() << " " << (p.x() * d1.a + d1.b) << endl;
|
|
if( p.y() <= p.x() * d1.a + d1.b)
|
|
{
|
|
return true;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
|
|
|
|
KisPerspectiveGrid::KisPerspectiveGrid()
|
|
{
|
|
}
|
|
|
|
|
|
KisPerspectiveGrid::~KisPerspectiveGrid()
|
|
{
|
|
clearSubGrids( );
|
|
}
|
|
|
|
bool KisPerspectiveGrid::addNewSubGrid( KisSubPerspectiveGrid* ng )
|
|
{
|
|
if(hasSubGrids() && !ng->topGrid() && !ng->bottomGrid() && !ng->leftGrid() && !ng->rightGrid() )
|
|
{
|
|
kdError() << "sub grids need a neighbourgh if they are not the first grid to be added" << endl;
|
|
return false;
|
|
}
|
|
m_subGrids.push_back(ng);
|
|
return true;
|
|
}
|
|
|
|
|
|
void KisPerspectiveGrid::clearSubGrids( )
|
|
{
|
|
for( TQValueList<KisSubPerspectiveGrid*>::const_iterator it = begin(); it != end(); ++it)
|
|
{
|
|
delete *it;
|
|
}
|
|
m_subGrids.clear();
|
|
}
|
|
|
|
KisSubPerspectiveGrid* KisPerspectiveGrid::gridAt(KisPoint p)
|
|
{
|
|
for( TQValueList<KisSubPerspectiveGrid*>::const_iterator it = begin(); it != end(); ++it)
|
|
{
|
|
if( (*it)->contains(p) )
|
|
{
|
|
return *it;
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|