1 // Copyright 2002 David Hilvert <dhilvert@auricle.dyndns.org>,
2 // <dhilvert@ugcs.caltech.edu>
4 /* This file is part of the Anti-Lamenessing Engine.
6 The Anti-Lamenessing Engine is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 3 of the License, or
9 (at your option) any later version.
11 The Anti-Lamenessing Engine is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with the Anti-Lamenessing Engine; if not, write to the Free Software
18 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
25 * Structure to describe a point
36 point(ale_pos x0
, ale_pos x1
) {
41 const ale_pos
&operator[](unsigned int i
) const {
47 ale_pos
&operator[](unsigned int i
) {
53 point
operator+(point p
) const {
54 return point(p
[0] + x
[0], p
[1] + x
[1]);
57 point
operator-(point p
) const {
58 return point(x
[0] - p
[0], x
[1] - p
[1]);
61 point
operator-() const {
62 return point(-x
[0], -x
[1]);
65 point
operator+=(point p
) {
66 (*this) = (*this) + p
;
71 point
operator-=(point p
) {
72 (*this) = (*this) - p
;
77 point
mult(ale_real d
) const {
78 return point(x
[0] * d
, x
[1] * d
);
81 point
operator*(point p
) const {
83 * element-wise multiplication
85 return point(x
[0] * p
[0], x
[1] * p
[1]);
88 point
operator *=(ale_real d
) {
93 point
operator/(ale_real d
) const {
94 return point(x
[0] / d
, x
[1] / d
);
97 ale_pos
normsq() const {
98 return x
[0] * x
[0] + x
[1] * x
[1];
101 ale_pos
norm() const {
102 return sqrt(normsq());
105 ale_pos
absmaxnorm() const {
106 ale_pos a
= fabs(x
[0]);
107 ale_pos b
= fabs(x
[1]);
109 return (a
> b
) ? a
: b
;
112 ale_pos
lengthtosq(point p
) const {
113 point diff
= operator-(p
);
115 return diff
[0] * diff
[0] + diff
[1] * diff
[1];
117 ale_pos
lengthto(point p
) const {
118 return sqrt(lengthtosq(p
));
121 ale_pos
dproduct(point p
) const {
122 return (x
[0] * p
[0] + x
[1] * p
[1]);
125 ale_pos
anglebetw(point p
, point q
) {
127 * by the law of cosines, the cosine is equal to:
129 * (lengthtosq(p) + lengthtosq(q) - p.lengthtosq(q))
130 * / (2 * lengthto(p) * lengthto(q))
133 ale_pos to_p
= lengthtosq(p
);
134 ale_pos to_q
= lengthtosq(q
);
136 ale_pos cos_of
= (to_p
+ to_q
- p
.lengthtosq(q
))
137 / (2 * sqrt(to_p
) * sqrt(to_q
));
142 static point
posinf() {
148 assert (isinf(a
) && a
> 0);
153 static point
neginf() {
156 assert (isinf(n
[0]) && n
[0] < 0);
161 void accumulate_max(point p
) {
162 for (int d
= 0; d
< 2; d
++)
167 void accumulate_min(point p
) {
168 for (int d
= 0; d
< 2; d
++)
173 static point
undefined() {
181 int defined() const {
187 return (::finite(x
[0])
191 static int defined(const point
&p
) {
196 inline point
operator*(const point
&p
, double d
) {
199 inline point
operator*(double d
, const point
&p
) {
202 inline point
operator*(float d
, const point
&p
) {