//
//  Filename         : BoxGrid.cpp
//  Author(s)        : Alexander Beels
//  Purpose          : Class to define a cell grid surrounding
//                     the projected image of a scene
//  Date of creation : 2011-1-29
//
///////////////////////////////////////////////////////////////////////////////

//
//  Copyright (C) : Please refer to the COPYRIGHT file distributed 
//   with this source distribution. 
//
//  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 2
//  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, Boston, MA  02111-1307, USA.
//
///////////////////////////////////////////////////////////////////////////////

#include "BoxGrid.h"

#include <stdexcept>
#include <algorithm>

using namespace std;

// Helper Classes

// OccluderData
///////////////

// Cell
/////////

BoxGrid::Cell::Cell () {}

BoxGrid::Cell::~Cell () {}

void BoxGrid::Cell::setDimensions(real x, real y, real sizeX, real sizeY) {
	const real epsilon = 1.0e-06;
	boundary[0] = x - epsilon;
	boundary[1] = x + sizeX + epsilon;
	boundary[2] = y - epsilon;
	boundary[3] = y + sizeY + epsilon;
}

bool BoxGrid::Cell::compareOccludersByShallowestPoint (const BoxGrid::OccluderData* a, const BoxGrid::OccluderData* b) {
	return a->shallowest < b->shallowest;
}

void BoxGrid::Cell::indexPolygons() {
	// Sort occluders by their shallowest points.
	sort(faces.begin(), faces.end(), compareOccludersByShallowestPoint);
}

// Iterator
//////////////////

BoxGrid::Iterator::Iterator (BoxGrid& grid, Vec3r& center, real epsilon) 
	: _target(grid.transform(center)), 
	_foundOccludee(false)
{
	// Find target cell
	_cell = grid.findCell(_target);
	#if boxgridlogging == 1
		cout << "Searching for occluders of edge centered at " << _target << " in cell [" 
			<< _cell->boundary[0] << ", " << _cell->boundary[1] << ", " << _cell->boundary[2] 
			<< ", " << _cell->boundary[3] << "] (" << _cell->faces.size() << " occluders)" << endl;
	#endif

	// Set iterator
	_current = _cell->faces.begin();
}

BoxGrid::Iterator::~Iterator () {}

// BoxGrid
/////////////////

BoxGrid::BoxGrid(OccluderSource& source, GridDensityProvider& density, ViewMap *viewMap, Vec3r& viewpoint, bool enableQI)
	: _viewpoint(viewpoint),
	_enableQI(enableQI)
{
	cout << "Generate Cell structure" << endl;
	// Generate Cell structure
	assignCells(source, density, viewMap);
	cout << "Distribute occluders" << endl;
	// Fill Cells
	distributePolygons(source);
	cout << "Reorganize cells" << endl;
	// Reorganize Cells
	reorganizeCells();
	cout << "Ready to use BoxGrid" << endl;
}

BoxGrid::~BoxGrid () {
}

void BoxGrid::assignCells (OccluderSource& source, GridDensityProvider& density, ViewMap *viewMap) {
	_cellSize = density.cellSize();
	_cellsX = density.cellsX();
	_cellsY = density.cellsY();
	_cellOrigin[0] = density.cellOrigin(0);
	_cellOrigin[1] = density.cellOrigin(1);

	// Now allocate the cell table and fill it with default (empty) cells
	_cells.resize(_cellsX * _cellsY);
	for ( cellContainer::iterator i = _cells.begin(), end = _cells.end(); i != end; ++i ) {
		(*i) = NULL;
	}

	// Identify cells that will be used, and set the dimensions for each
	ViewMap::fedges_container& fedges = viewMap->FEdges();
	for (ViewMap::fedges_container::iterator f = fedges.begin(), fend = fedges.end(); f != fend; ++f ) {
		if ( (*f)->isInImage() ) {
			Vec3r point = transform((*f)->center3d());
			unsigned i, j;
			getCellCoordinates(point, i, j);
			if ( _cells[i * _cellsY + j] == NULL ) {
				// This is an uninitialized cell

				real x, y, width, height;

				x = _cellOrigin[0] + _cellSize * i;
				width = _cellSize;

				y = _cellOrigin[1] + _cellSize * j;
				height = _cellSize;

				// Initialize cell
				Cell* b = _cells[i * _cellsY + j] = new Cell();
				b->setDimensions(x, y, width, height);
			}
		}
	}
}

void BoxGrid::distributePolygons (OccluderSource& source) {
	unsigned long nFaces = 0;
	unsigned long nKeptFaces = 0;

	for ( source.begin(); source.isValid(); source.next() ) {
		OccluderData* occluder = NULL;

		try {
			if ( insertOccluder(source, occluder) ) {
				_faces.push_back(occluder);
				++nKeptFaces;
			}
		} catch (...) {
			// If an exception was thrown, _faces.push_back() cannot have succeeded.
			// occluder is not owned by anyone, and must be deleted.
			// If the exception was thrown before or during new OccluderData(), then
			// occluder is NULL, and this delete is harmless.
			delete occluder;
			throw;
		}
		++nFaces;
	}
	cout << "Distributed " << nFaces << " occluders.  Retained " << nKeptFaces << "." << endl;
}

void BoxGrid::reorganizeCells () {
	// Sort the occluders by shallowest point
	for ( vector<Cell*>::iterator i = _cells.begin(), end = _cells.end(); i != end; ++i ) {
		if ( *i != NULL ) {
			(*i)->indexPolygons();
		}
	}
}

void BoxGrid::getCellCoordinates(const Vec3r& point, unsigned& x, unsigned& y) {
	x = min(_cellsX - 1, (unsigned) floor (max((double) 0.0f, point[0] - _cellOrigin[0]) / _cellSize));
	y = min(_cellsY - 1, (unsigned) floor (max((double) 0.0f, point[1] - _cellOrigin[1]) / _cellSize));
}

BoxGrid::Cell* BoxGrid::findCell(const Vec3r& point) {
	unsigned x, y;
	getCellCoordinates(point, x, y);
	return _cells[x * _cellsY + y];
}

bool BoxGrid::orthographicProjection () const {
	return true;
}

const Vec3r& BoxGrid::viewpoint() const {
	return _viewpoint;
}

bool BoxGrid::enableQI() const {
	return _enableQI;
}

BoxGrid::Transform::Transform () : GridHelpers::Transform() {}

Vec3r BoxGrid::Transform::operator() (const Vec3r& point) const {
	return Vec3r(point[0], point[1], -point[2]);
}