summaryrefslogtreecommitdiffstats
path: root/chalk/core/kis_perspective_grid.cpp
diff options
context:
space:
mode:
authortpearson <tpearson@283d02a7-25f6-0310-bc7c-ecb5cbfe19da>2011-06-26 00:41:16 +0000
committertpearson <tpearson@283d02a7-25f6-0310-bc7c-ecb5cbfe19da>2011-06-26 00:41:16 +0000
commit698569f8428ca088f764d704034a1330517b98c0 (patch)
treebf45be6946ebbbee9cce5a5bcf838f4c952d87e6 /chalk/core/kis_perspective_grid.cpp
parent2785103a6bd4de55bd26d79e34d0fdd4b329a73a (diff)
downloadkoffice-698569f8428ca088f764d704034a1330517b98c0.tar.gz
koffice-698569f8428ca088f764d704034a1330517b98c0.zip
Finish rebranding of Krita as Chalk
git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/applications/koffice@1238363 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
Diffstat (limited to 'chalk/core/kis_perspective_grid.cpp')
-rw-r--r--chalk/core/kis_perspective_grid.cpp100
1 files changed, 100 insertions, 0 deletions
diff --git a/chalk/core/kis_perspective_grid.cpp b/chalk/core/kis_perspective_grid.cpp
new file mode 100644
index 00000000..6eb5fbe8
--- /dev/null
+++ b/chalk/core/kis_perspective_grid.cpp
@@ -0,0 +1,100 @@
+/*
+ * 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::tqcontains(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)->tqcontains(p) )
+ {
+ return *it;
+ }
+ }
+ return 0;
+}
+