d8b212aa44
transparent one for the kart selection screen and mini map). 2) Added very first version of minimap (scale is wrong, no kart display yet). git-svn-id: svn+ssh://svn.code.sf.net/p/supertuxkart/code/main/branches/irrlicht@3778 178a84e3-b1eb-0310-8ba1-8eac791a3b58
99 lines
4.5 KiB
C++
99 lines
4.5 KiB
C++
// $Id$
|
|
//
|
|
// SuperTuxKart - a fun racing game with go-kart
|
|
// Copyright (C) 2009 Joerg Henrichs
|
|
//
|
|
// This program is free software; you can redistribute it and/or
|
|
// modify it under the terms of the GNU General Public License
|
|
// as published by the Free Software Foundation; either version 3
|
|
// of the License, or (at your option) any later version.
|
|
//
|
|
// This program is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with this program; if not, write to the Free Software
|
|
// Foundation, Inc., 59 Temple Place - Suite 330, B
|
|
|
|
#ifndef HEADER_QUAD_GRAPH_HPP
|
|
#define HEADER_QUAD_GRAPH_HPP
|
|
|
|
#include <vector>
|
|
#include <string>
|
|
|
|
#include "tracks/graph_node.hpp"
|
|
#include "tracks/quad_set.hpp"
|
|
|
|
/** This class stores a graph of quads. */
|
|
class QuadGraph {
|
|
|
|
private:
|
|
/** The actual graph data structure. */
|
|
std::vector<GraphNode*> m_all_nodes;
|
|
/** The set of all quads. */
|
|
QuadSet *m_all_quads;
|
|
/** For debug mode only: the node of the debug mesh. */
|
|
scene::ISceneNode *m_node;
|
|
/** For debug only: the mesh of the debug mesh. */
|
|
scene::IMesh *m_mesh;
|
|
/** For debug only: the actual mesh buffer storing the quads. */
|
|
scene::IMeshBuffer *m_mesh_buffer;
|
|
|
|
void setDefaultSuccessors();
|
|
void load (const std::string &filename);
|
|
void createMesh();
|
|
public:
|
|
static const int UNKNOWN_SECTOR;
|
|
|
|
QuadGraph (const std::string &quad_file_name,
|
|
const std::string graph_file_name);
|
|
~QuadGraph ();
|
|
void createDebugMesh();
|
|
void cleanupDebugMesh();
|
|
void getSuccessors(int quadNumber,
|
|
std::vector<unsigned int>& succ) const;
|
|
void spatialToTrack(Vec3 *dst, const Vec3& xyz,
|
|
const int sector) const;
|
|
void findRoadSector(const Vec3& XYZ, int *sector,
|
|
std::vector<int> *all_sectors=NULL) const;
|
|
int findOutOfRoadSector(const Vec3& xyz,
|
|
const int curr_sector=UNKNOWN_SECTOR,
|
|
std::vector<int> *all_sectors=NULL
|
|
) const;
|
|
video::ITexture *makeMiniMap(const core::dimension2di &where,
|
|
const std::string &name,
|
|
const video::SColor &fill_color
|
|
=video::SColor(127, 255, 255, 255) );
|
|
|
|
/** Returns the number of nodes in the graph. */
|
|
unsigned int getNumNodes() const { return m_all_nodes.size(); }
|
|
// ----------------------------------------------------------------------
|
|
/** Return the distance to the j-th successor of node n. */
|
|
float getDistanceToNext(int n, int j) const
|
|
{ return m_all_nodes[n]->getDistanceToSuccessor(j);}
|
|
// ----------------------------------------------------------------------
|
|
/** Returns the angle of the line between node n and its j-th.
|
|
* successor. */
|
|
float getAngleToNext(int n, int j) const
|
|
{ return m_all_nodes[n]->getAngleToSuccessor(j); }
|
|
// ----------------------------------------------------------------------
|
|
/** Returns the number of successors of a node n. */
|
|
int getNumberOfSuccessors(int n) const
|
|
{ return m_all_nodes[n]->getNumberOfSuccessors(); }
|
|
// ----------------------------------------------------------------------
|
|
/** Returns the quad that belongs to a graph node. */
|
|
const Quad& getQuad(unsigned int j) const
|
|
{ return m_all_quads->getQuad(m_all_nodes[j]->getIndex()); }
|
|
// ----------------------------------------------------------------------
|
|
/** Returns the quad that belongs to a graph node. */
|
|
GraphNode& getNode(unsigned int j) const{ return *m_all_nodes[j]; }
|
|
// ----------------------------------------------------------------------
|
|
/** Returns the distance from the start to the beginning of a quad. */
|
|
float getDistanceFromStart(int j) const
|
|
{ return m_all_nodes[j]->getDistanceFromStart(); }
|
|
}; // QuadGraph
|
|
|
|
#endif
|