118 lines
2.9 KiB
C++
118 lines
2.9 KiB
C++
#include "all_includes.hh"
|
|
|
|
Quad::Quad() {}
|
|
|
|
Quad::Quad(Vertex ne, Vertex se, Vertex sw, Vertex nw) {
|
|
c[NE] = ne;
|
|
c[SE] = se;
|
|
c[SW] = sw;
|
|
c[NW] = nw;
|
|
}
|
|
|
|
Quad Quad::inset(Cardinal side, float offset) const {
|
|
Quad q = (*this) << side;
|
|
Vertex offsetDirection = (q[NW]-q[NE]).perpendicularCw();
|
|
float distE = offset / offsetDirection.cosAngle(q[SE] - q[NE]);
|
|
float distW = offset / offsetDirection.cosAngle(q[SW] - q[NW]);
|
|
q[NE] = q[NE] + (q[SE] - q[NE]).setNorm(distE);
|
|
q[NW] = q[NW] + (q[SW] - q[NW]).setNorm(distW);
|
|
return q >> side;
|
|
}
|
|
|
|
Quad Quad::insetNESW(float offsetN, float offsetE, float offsetS, float offsetW) const {
|
|
return (*this).inset(N,offsetN).inset(E,offsetE).inset(S,offsetS).inset(W,offsetW);
|
|
}
|
|
|
|
Quad Quad::insetNESW(float offset) const {
|
|
return insetNESW(offset, offset, offset, offset);
|
|
}
|
|
|
|
Quad Quad::makeParallelogram() {
|
|
int l1, l2;
|
|
|
|
if(Segment(c[NW],c[NE]).length() < Segment(c[SE],c[SW]).length()) {
|
|
if((l1 = Segment(c[NE],c[SE]).length()) < (l2 = Segment(c[SW],c[NW]).length())) {
|
|
c[SW] = Segment(c[NW],c[SW]).reduce(l1).v;
|
|
c[SE] = c[SW] + (c[NE] - c[NW]);
|
|
}
|
|
else if((l1 = Segment(c[NE],c[SE]).length()) > (l2 = Segment(c[SW],c[NW]).length())) {
|
|
c[SE] = Segment(c[NE],c[SE]).reduce(l2).v;
|
|
c[SW] = c[SE] + (c[NW] - c[NE]);
|
|
}
|
|
}
|
|
else {
|
|
if((l1 = Segment(c[NE],c[SE]).length()) < (l2 = Segment(c[SW],c[NW]).length())) {
|
|
c[NW] = Segment(c[SW],c[NW]).reduce(l1).v;
|
|
c[NE] = c[NW] + (c[SE] - c[SW]);
|
|
}
|
|
else if((l1 = Segment(c[NE],c[SE]).length()) > (l2 = Segment(c[SW],c[NW]).length())) {
|
|
c[NE] = Segment(c[SE],c[NE]).reduce(l2).v;
|
|
c[NW] = c[NE] + (c[SW] - c[SE]);
|
|
}
|
|
}
|
|
|
|
return Quad(c[0],c[1],c[2],c[3]);
|
|
}
|
|
|
|
float Quad::minLengthNS() {
|
|
return std::min(
|
|
Segment(c[NW],c[NE]).length(),
|
|
Segment(c[SE],c[SW]).length()
|
|
);
|
|
}
|
|
|
|
float Quad::minLengthEW() {
|
|
return std::min(
|
|
Segment(c[NE],c[SE]).length(),
|
|
Segment(c[SW],c[NW]).length()
|
|
);
|
|
}
|
|
|
|
float Quad::maxLengthNS() {
|
|
return std::max(
|
|
Segment(c[NW],c[NE]).length(),
|
|
Segment(c[SE],c[SW]).length()
|
|
);
|
|
}
|
|
|
|
float Quad::maxLengthEW() {
|
|
return std::max(
|
|
Segment(c[NE],c[SE]).length(),
|
|
Segment(c[SW],c[NW]).length()
|
|
);
|
|
}
|
|
|
|
float Quad::minLength() {
|
|
return std::min(minLengthNS(), minLengthEW());
|
|
}
|
|
|
|
float Quad::maxLength() {
|
|
return std::max(maxLengthNS(), maxLengthEW());
|
|
}
|
|
|
|
float Quad::minAngle() {
|
|
float a = 370; // > 360.
|
|
for (int i = 0; i < 4; i++) {
|
|
a = std::min(a, Triangle(c[NE+i], c[SE+i], c[SW+i]).angle());
|
|
}
|
|
return a;
|
|
}
|
|
|
|
float Quad::maxAngle() {
|
|
float a = 0;
|
|
for (int i = 0; i < 4; i++) {
|
|
a = std::max(a, Triangle(c[NE+i], c[SE+i], c[SW+i]).angle());
|
|
}
|
|
return a;
|
|
}
|
|
|
|
Quad operator+(const Quad& q, const Vertex& v) {
|
|
return Quad(q[NE] + v, q[SE] + v, q[SW] + v, q[NW] + v);
|
|
}
|
|
|
|
void Quad::cutCornerCorner(Coin from) const {
|
|
Triangle t1(c[from-1], c[from], c[from+1]);
|
|
Triangle t2(c[from+1], c[from+2], c[from-1]);
|
|
// TODO
|
|
}
|