1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
|
/*
* This file is part of Chalk
*
* Copyright (c) 2005 Michael Thaler <michael.thaler@physik.tu-muenchen.de>
*
* ported from Gimp, Copyright (C) 1997 Eiichi Takamori <taka@ma1.seikyou.ne.jp>
* original pixelize.c for GIMP 0.54 by Tracy Scott
*
* 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 <math.h>
#include <tqvaluevector.h>
#include <kis_point.h>
#include "kis_polygon.h"
void KisPolygon::addPoint(double x, double y)
{
KisPoint point(x, y);
append(point);
}
void KisPolygon::rotate(double theta)
{
double ct, st, ox, oy;
ct = cos( theta );
st = sin( theta );
KisPointVector::iterator it;
for( it = begin(); it != end(); ++it )
{
ox = (*it).x();
oy = (*it).y();
(*it).setX( ct * ox - st * oy );
(*it).setY( st * ox + ct * oy );
}
}
void KisPolygon::translate(double tx, double ty)
{
KisPointVector::iterator it;
for( it = begin(); it != end(); ++it )
{
(*it).setX( (*it).x() + tx );
(*it).setY( (*it).y() + ty );
}
}
TQ_INT32 KisPolygon::extents (double& x1, double& y1, double& x2, double& y2)
{
if ( empty() )
{
return 0;
}
x1 = x2 = front().x();
y1 = y2 = front().y();
KisPointVector::iterator it;
for( it = begin(); it != end(); ++it )
{
if ((*it).x() < x1)
{
x1 = (*it).x();
}
if ((*it).x() > x2)
{
x2 = (*it).x();
}
if ((*it).y() < y1)
{
y1 = (*it).y();
}
if ((*it).y() > y2)
{
y2 = (*it).y();
}
}
return 1;
}
TQ_INT32 KisPolygon::numberOfPoints()
{
return count();
}
|
