/*******************************************************************************
* CGoGN: Combinatorial and Geometric modeling with Generic N-dimensional Maps  *
* version 0.1                                                                  *
* Copyright (C) 2009-2012, IGG Team, LSIIT, University of Strasbourg           *
*                                                                              *
* This library is free software; you can redistribute it and/or modify it      *
* under the terms of the GNU Lesser General Public License as published by the *
* Free Software Foundation; either version 2.1 of the License, or (at your     *
* option) any later version.                                                   *
*                                                                              *
* This library 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 Lesser General Public License  *
* for more details.                                                            *
*                                                                              *
* You should have received a copy of the GNU Lesser General Public License     *
* along with this library; if not, write to the Free Software Foundation,      *
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301 USA.           *
*                                                                              *
* Web site: http://cgogn.unistra.fr/                                           *
* Contact information: cgogn@unistra.fr                                        *
*                                                                              *
*******************************************************************************/

#include "Container/attributeMultiVector.h"

namespace CGoGN
{

namespace Algo
{

namespace Multiresolution
{

template <typename PFP>
Map2MR_PM<PFP>::Map2MR_PM(typename PFP::MAP& map, VertexAttribute<typename PFP::VEC3>& position) : m_map(map), m_position(position)
{

}

template <typename PFP>
Map2MR_PM<PFP>::~Map2MR_PM()
{
	if(m_selector)
		delete m_selector ;
	for(typename std::vector<Algo::Decimation::ApproximatorGen<PFP>*>::iterator it = m_approximators.begin(); it != m_approximators.end(); ++it)
		delete (*it) ;
	for(typename std::vector<Algo::Decimation::PredictorGen<PFP>*>::iterator it = m_predictors.begin(); it != m_predictors.end(); ++it)
		delete (*it) ;
}

template <typename PFP>
void Map2MR_PM<PFP>::createPM(Algo::Decimation::SelectorType s, Algo::Decimation::ApproximatorType a, const FunctorSelect& select)
{
	CGoGNout << "  creating approximator and predictor.." << CGoGNflush ;
	switch(a)
	{
	case Algo::Decimation::A_QEM : {
		m_approximators.push_back(new Algo::Decimation::Approximator_QEM<PFP>(m_map, m_position)) ;
		break ; }
	case Algo::Decimation::A_MidEdge : {
		m_approximators.push_back(new Algo::Decimation::Approximator_MidEdge<PFP>(m_map, m_position)) ;
		break ; }
	case Algo::Decimation::A_HalfCollapse : {
		Algo::Decimation::Predictor_HalfCollapse<PFP>* pred = new Algo::Decimation::Predictor_HalfCollapse<PFP>(m_map, m_position) ;
		m_predictors.push_back(pred) ;
		m_approximators.push_back(new Algo::Decimation::Approximator_HalfCollapse<PFP>(m_map, m_position, pred)) ;
		break ; }
	case Algo::Decimation::A_CornerCutting : {
		Algo::Decimation::Predictor_CornerCutting<PFP>* pred = new Algo::Decimation::Predictor_CornerCutting<PFP>(m_map, m_position) ;
		m_predictors.push_back(pred) ;
		m_approximators.push_back(new Algo::Decimation::Approximator_CornerCutting<PFP>(m_map, m_position, pred)) ;
		break ; }
	case Algo::Decimation::A_TangentPredict1 : {
		Algo::Decimation::Predictor_TangentPredict1<PFP>* pred = new Algo::Decimation::Predictor_TangentPredict1<PFP>(m_map, m_position) ;
		m_predictors.push_back(pred) ;
		m_approximators.push_back(new Algo::Decimation::Approximator_MidEdge<PFP>(m_map, m_position, pred)) ;
		break ; }
	case Algo::Decimation::A_TangentPredict2 : {
		Algo::Decimation::Predictor_TangentPredict2<PFP>* pred = new Algo::Decimation::Predictor_TangentPredict2<PFP>(m_map, m_position) ;
		m_predictors.push_back(pred) ;
		m_approximators.push_back(new Algo::Decimation::Approximator_MidEdge<PFP>(m_map, m_position, pred)) ;
		break ; }
	}
	CGoGNout << "..done" << CGoGNendl ;

	CGoGNout << "  creating selector.." << CGoGNflush ;
	switch(s)
	{
	case Algo::Decimation::S_MapOrder : {
		m_selector = new Algo::Decimation::EdgeSelector_MapOrder<PFP>(m_map, m_position, m_approximators, select) ;
		break ; }
	case Algo::Decimation::S_Random : {
		m_selector = new Algo::Decimation::EdgeSelector_Random<PFP>(m_map, m_position, m_approximators, select) ;
		break ; }
	case Algo::Decimation::S_EdgeLength : {
		m_selector = new Algo::Decimation::EdgeSelector_Length<PFP>(m_map, m_position, m_approximators, select) ;
		break ; }
	case Algo::Decimation::S_QEM : {
		m_selector = new Algo::Decimation::EdgeSelector_QEM<PFP>(m_map, m_position, m_approximators, select) ;
		break ; }
	case Algo::Decimation::S_MinDetail : {
		m_selector = new Algo::Decimation::EdgeSelector_MinDetail<PFP>(m_map, m_position, m_approximators, select) ;
		break ; }
	case Algo::Decimation::S_Curvature : {
		m_selector = new Algo::Decimation::EdgeSelector_Curvature<PFP>(m_map, m_position, m_approximators, select) ;
		break ; }
	}
	CGoGNout << "..done" << CGoGNendl ;

	m_initOk = true ;

	CGoGNout << "  initializing approximators.." << CGoGNflush ;
	for(typename std::vector<Algo::Decimation::ApproximatorGen<PFP>*>::iterator it = m_approximators.begin(); it != m_approximators.end(); ++it)
	{
		if(! (*it)->init())
			m_initOk = false ;
		if((*it)->getApproximatedAttributeName() == "position")
			m_positionApproximator = reinterpret_cast<Algo::Decimation::Approximator<PFP, VEC3>*>(*it) ;
	}
	CGoGNout << "..done" << CGoGNendl ;

	CGoGNout << "  initializing predictors.." << CGoGNflush ;
	for(typename std::vector<Algo::Decimation::PredictorGen<PFP>*>::iterator it = m_predictors.begin(); it != m_predictors.end(); ++it)
		if(! (*it)->init())
			m_initOk = false ;
	CGoGNout << "..done" << CGoGNendl ;


}



template <typename PFP>
void Map2MR_PM<PFP>::addNewLevel(unsigned int percentWantedVertices)
{
	unsigned int nbVertices = m_map.template getNbOrbits<VERTEX>() ;
	unsigned int nbWantedVertices = nbVertices * percentWantedVertices / 100 ;

	unsigned int nbDeletedVertex=0;
	unsigned int percentWantedPerLevel = 20;
	unsigned int nbWantedPerLevel = nbWantedVertices * percentWantedPerLevel / 100 ;

	CGoGNout << "  initializing selector.." << CGoGNflush ;
	m_initOk = m_selector->init() ;
	CGoGNout << "..done" << CGoGNendl ;

	std::vector<Dart> edges;
	edges.reserve(nbWantedPerLevel);

	std::cout << "stops at  : " << nbWantedPerLevel << std::endl;

	DartMarkerStore me(m_map); 	//mark edges not to collapse

	bool finished = false ;
	Dart d ;
	while(!finished)
	{
		if(!m_selector->nextEdge(d))
			break ;

		if(!me.isMarked(d))
		{
			//Mark le 1 voisinage
			Dart dt = d;
			do
			{
				Traversor2VF<typename PFP::MAP> tf(m_map, dt) ;
				for(Dart it = tf.begin(); it != tf.end(); it = tf.next())
				{
					me.markOrbit<FACE>(it);
				}

				dt = m_map.phi1(dt);
			}while(dt != d);

			Traversor2VF<typename PFP::MAP> tf(m_map, m_map.phi_1(m_map.phi2(d))) ;
			for(Dart it = tf.begin(); it != tf.end(); it = tf.next())
			{
				me.markOrbit<FACE>(it);
			}

			++nbDeletedVertex ;

			edges.push_back(d);
		}

		//std::cout << "nbDeletedVertex  : " << nbDeletedVertex << std::endl;

		if(nbDeletedVertex >= nbWantedPerLevel)
			finished = true ;
	}


	//create the new level
	m_map.addLevelFront();
	m_map.setCurrentLevel(0);

	AttributeContainer& attribs = m_map.getMRAttributeContainer();
	AttributeMultiVector<unsigned int>* attribLevel = m_map.getMRLevelAttributeVector();
	AttributeMultiVector<unsigned int>* attribDarts = m_map.getMRDartAttributeVector(0);

	for(unsigned int i = attribs.begin(); i != attribs.end(); attribs.next(i))
	{
		if((*attribDarts)[i] == MRNULL)
			++(*attribLevel)[i];
	}

	for(std::vector<Dart>::iterator it = edges.begin() ; it != edges.end() ; ++it)
	{
		collapseEdge(*it);
	}

//	Dart d2 = m_map.phi2(m_map.phi_1(d)) ;
//	Dart dd2 = m_map.phi2(m_map.phi_1(m_map.phi2(d))) ;
//
//	m_selector->updateBeforeCollapse(d) ;		// update selector
//
//	collapseEdge(d);
//
//	m_selector->updateAfterCollapse(d2, dd2) ;	// update selector
//
//
//	CGoGNout << "..done (" << nbDeletedVertex << " vertices)" << CGoGNendl ;
//
//	m_map.printMR();
}


template <typename PFP>
void Map2MR_PM<PFP>::collapseEdge(Dart d)
{
	//incremente le dartLevel des brins des faces a supprimer
	m_map.incDartLevel(d);
	m_map.incDartLevel(m_map.phi1(d));
	m_map.incDartLevel(m_map.phi_1(d));
	m_map.incDartLevel(m_map.phi2(d));
	m_map.incDartLevel(m_map.phi_1(m_map.phi2(d)));
	m_map.incDartLevel(m_map.phi1(m_map.phi2(d)));

	m_map.printMR();

	m_map.duplicateDartAtOneLevel(d, 0);
	m_map.duplicateDartAtOneLevel(m_map.phi1(d), 0);
	m_map.duplicateDartAtOneLevel(m_map.phi_1(d), 0);
	m_map.duplicateDartAtOneLevel(m_map.phi2(d), 0);
	m_map.duplicateDartAtOneLevel(m_map.phi_1(m_map.phi2(d)), 0);
	m_map.duplicateDartAtOneLevel(m_map.phi1(m_map.phi2(d)), 0);

	m_map.duplicateDartAtOneLevel(m_map.phi2(m_map.phi1(d)), 0);
	m_map.duplicateDartAtOneLevel(m_map.phi2(m_map.phi_1(d)), 0);
	m_map.duplicateDartAtOneLevel(m_map.phi2(m_map.phi1(m_map.phi2(d))), 0);
	m_map.duplicateDartAtOneLevel(m_map.phi2(m_map.phi_1(m_map.phi2(d))), 0);

	m_map.collapseEdge(d);

	m_map.printMR();
}


template <typename PFP>
void Map2MR_PM<PFP>::coarsen()
{
	assert(m_map.getCurrentLevel() > 0 || !"coarsen : called on level 0") ;

	m_map.decCurrentLevel() ;

	TraversorV<typename PFP::MAP> tE(m_map);
	for(Dart d = tE.begin() ; d != tE.end() ; d = tE.next())
	{
		Dart dit = d;
		Dart dres = d;
		bool found = false;
		do
		{
			//std::cout << "emb["<<dit<<"] = " << m_map.template getEmbedding<VERTEX>(dit) << std::endl;

			if(m_map.getDartLevel(dit) == m_map.getCurrentLevel())
			{
				dres = dit;
				found = true;
			}

			dit = m_map.phi2(m_map.phi_1(dit));

		}while(!found & dit!=d);

		//std::cout << std::endl;

		m_map.template embedOrbit<VERTEX>(dres, m_map.template getEmbedding<VERTEX>(dres));
	}
}

template <typename PFP>
void Map2MR_PM<PFP>::refine()
{
	assert(m_map.getCurrentLevel() < m_map.getMaxLevel() || !"refine: called on max level") ;

	m_map.incCurrentLevel() ;

	TraversorV<typename PFP::MAP> tE(m_map);
	for(Dart d = tE.begin() ; d != tE.end() ; d = tE.next())
	{
		Dart dit = d;
		Dart dres = d;
		bool found = false;
		do
		{
			//std::cout << "emb["<<dit<<"] = " << m_map.template getEmbedding<VERTEX>(dit) << std::endl;

			if(m_map.getDartLevel(dit) == m_map.getCurrentLevel())
			{
				dres = dit;
				found = true;
			}

			dit = m_map.phi2(m_map.phi_1(dit));

		}while(!found & dit!=d);

		//std::cout << std::endl;

		m_map.template embedOrbit<VERTEX>(dres, m_map.template getEmbedding<VERTEX>(dres));
	}
}

} // namespace Multiresolution

} // namespace Algo

} // namespace CGoGN