#include "network.h" #include "routeWalker.h" #include #include #include #include #include #include #include #include #include #include Network::Network(const std::string & tn) : texture {Texture::cachedTexture.get(tn)} { } Node::Ptr Network::nodeAt(glm::vec3 pos) { return newNodeAt(pos).first; } Network::NodeInsertion Network::newNodeAt(glm::vec3 pos) { if (const auto [n, i] = candidateNodeAt(pos); i == NodeIs::NotInNetwork) { return {*nodes.insert(std::move(n)).first, i}; } else { return {n, NodeIs::InNetwork}; } } Node::Ptr Network::findNodeAt(glm::vec3 pos) const { if (const auto n = nodes.find(pos); n != nodes.end()) { return *n; } return {}; } Network::NodeInsertion Network::candidateNodeAt(glm::vec3 pos) const { if (const auto n = nodes.find(pos); n != nodes.end()) { return {*n, NodeIs::InNetwork}; } return {std::make_shared(pos), NodeIs::NotInNetwork}; } Node::Ptr Network::intersectRayNodes(const Ray & ray) const { // Click within 2m of a node if (const auto node = std::find_if(nodes.begin(), nodes.end(), [&ray](const Node::Ptr & node) { glm::vec3 ipos, inorm; return glm::intersectRaySphere(ray.start, ray.direction, node->pos, 2.F, ipos, inorm); }); node != nodes.end()) { return *node; } return {}; } void Network::joinLinks(const Link::Ptr & l, const Link::Ptr & ol) { if (l != ol) { for (const auto oe : {0U, 1U}) { for (const auto te : {0U, 1U}) { if (l->ends[te].node == ol->ends[oe].node) { l->ends[te].nexts.emplace_back(ol, oe); ol->ends[oe].nexts.emplace_back(l, te); } } } } } Link::Nexts Network::routeFromTo(const Link::End & start, glm::vec3 dest) const { auto destNode {findNodeAt(dest)}; if (!destNode) { throw std::out_of_range("Node does not exist in network"); } return routeFromTo(start, destNode); } Link::Nexts Network::routeFromTo(const Link::End & end, const Node::Ptr & dest) const { return RouteWalker().findRouteTo(end, dest); } GenCurveDef Network::genCurveDef(const glm::vec3 & start, const glm::vec3 & end, float startDir) { const auto diff {end - start}; const auto vy {vector_yaw(diff)}; const auto dir = pi + startDir; const auto flatStart {!start}, flatEnd {!end}; const auto n2ed {(vy * 2) - dir - pi}; const auto centre {find_arc_centre(flatStart, dir, flatEnd, n2ed)}; if (centre.second) { // right hand arc return {end, start, centre.first}; } return {start, end, centre.first}; }