env_map.h

#ifndef ENV_MAP_H
#define ENV_MAP_H

#include <iostream>
#include <algorithm>

#include "Topology/generic/parameters.h"
#include "Topology/map/map2.h"
#include "Topology/generic/embeddedMap2.h"

#include "Algo/ImplicitHierarchicalMesh/ihm.h"
#include "Algo/ImplicitHierarchicalMesh/subdivision.h"

#include "Algo/Modelisation/polyhedron.h"
#include "Algo/Modelisation/extrusion.h"
#include "Algo/Modelisation/subdivision.h"
#include "Algo/Geometry/centroid.h"
#include "Algo/Geometry/area.h"

#include "Container/fakeAttribute.h"

#include "env_generator.h"

#include "Algo/Parallel/parallel_foreach.h"

using namespace CGoGN;

class Agent;

struct PFP: public PFP_STANDARD
{
	// definition de la carte
// 	typedef EmbeddedMap2<Map2> MAP;
 	typedef Algo::IHM::ImplicitHierarchicalMap MAP;

	// definition des listes d'agent
	typedef std::vector<Agent*> AGENTS;
	typedef std::vector<Dart> OBSTACLES;
	typedef NoMathIONameAttribute<AGENTS> AGENTVECT;
	typedef NoMathIONameAttribute<OBSTACLES> OBSTACLEVECT;
	typedef AttributeHandler<AGENTVECT> TAB_AGENTVECT;
	typedef AttributeHandler<OBSTACLEVECT> TAB_OBSTACLEVECT;

	typedef NoMathIONameAttribute<std::pair<bool,bool> > BOOLATTRIB;
};

typedef PFP::VEC3 VEC3;

class EnvMap
{
public :
	EnvMap();
	
	unsigned int mapMemoryCost();
	Dart getBelongingCell(const PFP::VEC3& pos);
	
	void init();
	
	void foreach_neighborFace(Dart d, FunctorType& f);

	void registerObstaclesInFaces();
	void addNeighborObstacles(PFP::OBSTACLES& obst, Dart d, bool edgeNeighbor);
	
	void setAgentNeighborsAndObstacles(Agent* agent);
	
//	void agentChangeFaceThroughEdge(Agent* agent);
	void agentChangeFace(Agent* agent, Dart oldFace);

	void pushAgentInCells(Agent* agent, Dart d);
	void popAgentInCells(Agent* agent, Dart d);
	
	void clearUpdateCandidates();
	void updateMap();

	void resetAgentInFace(Agent* agent);
	
	PFP::MAP map;

	PFP::TVEC3 position;
	PFP::TVEC3 normal;

	AttributeHandler<PFP::BOOLATTRIB> subdivisableFace;

	PFP::TAB_AGENTVECT agentvect;
	PFP::TAB_AGENTVECT neighborAgentvect;
	
	PFP::TAB_OBSTACLEVECT obstvect;

	CellMarker obstacleMark;
	CellMarker buildingMark;

	static const unsigned int nbAgentsToSubdivide = 7;
	static const unsigned int nbAgentsToSimplify = 7;

//	std::map<unsigned int, Dart> refineCandidate;
//	std::map<unsigned int, Dart> coarsenCandidate;

	CellMarker refineMark;
	std::vector<Dart> refineCandidate;
//	std::vector<Dart> coarsenCandidate;
};

/**************************************
*           INLINE FUNCTIONS          *
**************************************/

inline void EnvMap::pushAgentInCells(Agent* agent, Dart d)
{
	assert(map.getCurrentLevel() == map.getMaxLevel());
	assert(std::find(agentvect[d].begin(), agentvect[d].end(), agent) == agentvect[d].end());
	
	agentvect[d].push_back(agent);

	Dart dd = d;
	do
	{
		Dart ddd = map.alpha1(map.alpha1(dd));
		while(ddd != dd)
		{
			neighborAgentvect[ddd].push_back(agent);
			ddd = map.alpha1(ddd);
		}
		dd = map.phi1(dd);
	} while(dd != d);
}

inline void EnvMap::popAgentInCells(Agent* agent, Dart d)
{
	assert(map.getCurrentLevel() == map.getMaxLevel());
	assert(std::find(agentvect[d].begin(), agentvect[d].end(), agent) != agentvect[d].end());
	
	PFP::AGENTS& a = agentvect[d];
	PFP::AGENTS::iterator end = a.end();
	bool found = false;
	for(PFP::AGENTS::iterator it = a.begin(); it != end && !found; ++it)
	{
		if(*it == agent)
		{
			*it = a.back();
			a.pop_back();
			found = true;
		}
	}

	Dart dd = d;
	do
	{
		Dart ddd = map.alpha1(map.alpha1(dd));
		while(ddd != dd)
		{
			bool found = false;
			PFP::AGENTS& na = neighborAgentvect[ddd];
			PFP::AGENTS::iterator end = na.end();
			for(PFP::AGENTS::iterator it = na.begin(); it != end && !found; ++it)
			{
				if(*it == agent)
				{
					*it = na.back();
					na.pop_back();
					found = true;
				}
			}
			ddd = map.alpha1(ddd);
		}
		dd = map.phi1(dd);
	} while(dd != d);
}

inline void EnvMap::clearUpdateCandidates()
{
	refineCandidate.clear();
//	coarsenCandidate.clear();
}

#endif