43 lines
1.1 KiB
C++
43 lines
1.1 KiB
C++
#include "all_includes.hh"
|
|
|
|
RouteQuadChaussee::RouteQuadChaussee(Vertex ne, Vertex se, Vertex sw, Vertex nw) : Chose(), ne(ne), se(se), sw(sw), nw(nw) {
|
|
triangulation();
|
|
}
|
|
|
|
RouteQuadChaussee::~RouteQuadChaussee() {
|
|
for(unsigned int i = 0; i < children.size(); i++)
|
|
delete(children[i]);
|
|
children.clear();
|
|
triangles.clear();
|
|
}
|
|
|
|
std::vector<Vertex*> RouteQuadChaussee::getBoundingBoxPoints() const {
|
|
std::vector<Vertex*> list;
|
|
return list;
|
|
}
|
|
|
|
bool RouteQuadChaussee::split() {
|
|
// TODO
|
|
return false;
|
|
}
|
|
|
|
void RouteQuadChaussee::triangulation() {
|
|
triangles.reserve(2);
|
|
addTriangle(new Triangle(ne, nw, sw, 0x36, 0x36, 0x36));
|
|
addTriangle(new Triangle(sw, se, ne, 0x36, 0x36, 0x36));
|
|
}
|
|
|
|
// Version avec trottoirs.
|
|
/*void RouteQuadChaussee::triangulation() {
|
|
triangles.reserve(2);
|
|
Vertex nne, nnw, nse, nsw; // Nouvel emplacement de la route.
|
|
|
|
nnw = nw + ((ne - nw)/6);
|
|
nsw = sw + ((se - sw)/6);
|
|
nne = ne - ((ne - nw)/6);
|
|
nse = se - ((se - sw)/6);
|
|
|
|
addChild(new TrottoirRoute(nnw, nsw, sw, nw, 20));
|
|
addChild(new TrottoirRoute(ne, se, nse, nne,20));
|
|
}*/
|