62 lines
2.0 KiB
C++
62 lines
2.0 KiB
C++
#include "all_includes.hh"
|
|
|
|
QuartierQuad::QuartierQuad(Vertex ne, Vertex se, Vertex sw, Vertex nw) : Chose() {
|
|
addEntropy(ne, se, sw, nw);
|
|
c[NE] = ne;
|
|
c[SE] = se;
|
|
c[SW] = sw;
|
|
c[NW] = nw;
|
|
}
|
|
|
|
QuartierQuad::~QuartierQuad() {
|
|
children.clear();
|
|
triangles.clear();
|
|
}
|
|
|
|
void QuartierQuad::getBoundingBoxPoints() {
|
|
addBBPoint(c[NE]);
|
|
addBBPoint(c[SE]);
|
|
addBBPoint(c[SW]);
|
|
addBBPoint(c[NW]);
|
|
addBBPoint(c[NE] + Vertex(0,0,1000)); // TODO
|
|
addBBPoint(c[SE] + Vertex(0,0,1000));
|
|
addBBPoint(c[SW] + Vertex(0,0,1000));
|
|
addBBPoint(c[NW] + Vertex(0,0,1000));
|
|
}
|
|
|
|
Chose* QuartierQuad::factory(int seed, int n, Vertex ne, Vertex se, Vertex sw, Vertex nw) {
|
|
Quad q = Quad(ne,se,sw,nw);
|
|
bool small = q.minLength() < 2500;
|
|
bool big = q.maxLength() >= 5000;
|
|
bool anglesAcceptable = q.minAngle() > Angle::d2r(90-60) && q.maxAngle() < Angle::d2r(90+60);
|
|
bool anglesOk = q.minAngle() > Angle::d2r(90-40) && q.maxAngle() < Angle::d2r(90+40);
|
|
bool tooWideX = q.minLengthEW() * 2 < q.maxLengthNS(); // trop allongé (côté E ou W deux fois plus petit que le côté N ou S).
|
|
bool tooWideY = q.minLengthNS() * 2 < q.maxLengthEW(); // trop allongé (côté N ou S deux fois plus petit que le côté E ou W).
|
|
if (!big && proba(seed, n, 1, 20)) {
|
|
return new TerrainQuadHerbe(ne, se, sw, nw);
|
|
} else if (small && anglesAcceptable) {
|
|
return new BatimentQuad(ne, se, sw, nw, N);
|
|
} else if (!small && !anglesOk) {
|
|
return new QuartierQuadAngle(ne, se, sw, nw);
|
|
} else if (!small && tooWideY) {
|
|
return new QuartierQuadRect(nw, ne, se, sw);
|
|
} else if (!small && tooWideX) {
|
|
return new QuartierQuadRect(ne, se, sw, nw);
|
|
} else if (!small) {
|
|
return new QuartierQuadCarre(ne, se, sw, nw);
|
|
} else {
|
|
return new TerrainQuadHerbe(ne, se, sw, nw);
|
|
}
|
|
}
|
|
|
|
bool QuartierQuad::split() {
|
|
std::cout << "ERROR : QuartierQuad cannot be split." << std::endl;
|
|
return false;
|
|
}
|
|
|
|
void QuartierQuad::triangulation() {
|
|
triangles.reserve(2);
|
|
addTriangle(new GPUTriangle(c[NE], c[NW], c[SW], 0xc0, 0xc0, 0xc0));
|
|
addTriangle(new GPUTriangle(c[SW], c[SE], c[NE], 0xc0, 0xc0, 0xc0));
|
|
}
|