secondo/Algebras/SpatialJoinTOUCH/Grid.cpp

/*

This file is part of SECONDO.

Copyright (C) 2019,
Faculty of Mathematics and Computer Science,
Database Systems for New Applications.

SECONDO 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.

SECONDO 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 SECONDO; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

*/


#include "Grid.h"
#include <algorithm>
#include "Algebras/RTree/RTreeAlgebra.h"

using namespace mmrtreetouch;
using namespace std;

Grid::Grid(
        tchNode* node,
        double _xCellDim,
        double _yCellDim,
        int _fAttrIndex,
        int _sAttrIndex,
        TupleType* _tt
        ):
        fAttrIndex(_fAttrIndex),
        sAttrIndex(_sAttrIndex),
        tt(_tt),
        box(node->box),
        minX((double) box.MinD(0)),
        maxX((double) box.MaxD(0)),
        minY((double) box.MinD(1)),
        maxY((double) box.MaxD(1)),

        xCellDim(_xCellDim == 0 ? 0.1: _xCellDim),
        yCellDim(_yCellDim == 0 ? 0.1: _yCellDim),
        xLength(maxX - minX),
        yLength(maxY - minY),
        numOfXCells((int64_t) ceil(xLength / xCellDim)),
        numOfYCells((int64_t) ceil(yLength / yCellDim)),
        cellSize((int64_t)node->objectsB.size()),
        grid(
                numOfXCells,
                vector<vector<Tuple*> >(numOfYCells, vector<Tuple* >(0)))
{
    xCellDim = xLength / numOfXCells;
    yCellDim = yLength / numOfYCells;
}



Grid::~Grid() {
};

int64_t Grid::calculateIndexX(double coord) {
    int64_t index;
    int64_t roundDown = (int64_t) floor((coord-minX) / xCellDim);

    index = roundDown;

    if (roundDown == numOfXCells) {
        index = roundDown - 1;
    }

    if (index < 0) {
        index = 0;
    } else if (index > numOfXCells) {
        index = numOfXCells - 1;
    }

    assert(index >= 0);
    assert(index < numOfXCells);

    return index;
}


int64_t Grid::calculateIndexY(double coord) {
    int64_t index;
    int64_t roundDown = (int64_t) floor((coord-minY) / yCellDim);

    index = roundDown;

    if (roundDown == numOfYCells) {
        index = roundDown - 1;
    }

    if (index < 0) {
        index = 0;
    } else if (index > numOfYCells) {
        index = numOfYCells - 1;
    }

    assert(index >= 0);
    assert(index < numOfYCells);

    return index;
}



pair<pair<int64_t, int64_t>, pair<int64_t, int64_t>>
Grid::getGridCoordinatesOf(
        Tuple* t,
        int attrIndex
        ) {
    Attribute* attr = t->GetAttribute(attrIndex);

    int64_t tMinX = calculateIndexX(attr->getMinX());
    int64_t tMaxX = calculateIndexX(attr->getMaxX());

    int64_t tMinY = calculateIndexY(attr->getMinY());
    int64_t tMaxY = calculateIndexY(attr->getMaxY());

    return make_pair(make_pair(tMinX, tMaxX), make_pair(tMinY, tMaxY));
}

void Grid::addTuple(Tuple* t, int attrIndex) {

    Attribute* attr = t->GetAttribute(attrIndex);

    int64_t tMinX = calculateIndexX(attr->getMinX());
    int64_t tMaxX = calculateIndexX(attr->getMaxX());

    int64_t tMinY = calculateIndexY(attr->getMinY());
    int64_t tMaxY = calculateIndexY(attr->getMaxY());


    for (int64_t i = tMinX; i <= tMaxX; i++) {
        for (int64_t j = tMinY; j <= tMaxY; j++) {
            grid.at(i).at(j).push_back(t);
        }
    }
}


bool Grid::checkIfOverlapping(Tuple* tupleA, Tuple* tupleB) {

    StandardSpatialAttribute<2> * attrA1 =
            (StandardSpatialAttribute<2>*) tupleA->GetAttribute(
                    fAttrIndex
            );

    Rectangle<2> boxA = attrA1->BoundingBox();

    StandardSpatialAttribute<2> * attrB1 =
            (StandardSpatialAttribute<2>*) tupleB->GetAttribute(
                    sAttrIndex
            );

    Rectangle<2> boxB = attrB1->BoundingBox();

    if (boxA.Intersects(boxB, 0)) {
        return true;
    }

    return false;
}

Tuple* Grid::concatenateTuples(Tuple* tupleA, Tuple* tupleB) {
    Tuple* result = new Tuple(tt);
    Concat(tupleA, tupleB, result);

    return result;
};

vector<Tuple*> Grid::getMatchings() {
    return matchings;
}

void Grid::setMatchings(std::vector<Tuple*> _matchings) {
    matchings = _matchings;
}

void Grid::getTuplesOverlappingWith(
        Tuple* TupleB,
        int attrIndex
) {

    pair<pair<int64_t, int64_t>, pair<int64_t, int64_t>> indexes =
            getGridCoordinatesOf(
            TupleB,
            attrIndex
    );

    StandardSpatialAttribute<2> * attr2 =
            (StandardSpatialAttribute<2>*) TupleB->GetAttribute(sAttrIndex);

    Rectangle<2> tupleBBox = attr2->BoundingBox();

    pair<int64_t, int64_t> xPair = indexes.first;
    pair<int64_t, int64_t> yPair = indexes.second;


    for (int64_t i = xPair.first; i <= xPair.second; i++) {
        for (int64_t j = yPair.first; j <= yPair.second; j++) {
            vector<Tuple*> temp = grid[i][j];

            for (Tuple* TupleA: temp) {

                numOfComp++;

                StandardSpatialAttribute<2> * attr1 =
                    (StandardSpatialAttribute<2>*) TupleA->GetAttribute(
                            fAttrIndex
                            );

                Rectangle<2> intersectionBox =
                        attr1->BoundingBox().Intersection(tupleBBox);

                double minX = (double) intersectionBox.MinD(0);
                double minY = (double) intersectionBox.MinD(1);

                int64_t intersectionIndexX = calculateIndexX(minX);
                int64_t intersectionIndexY = calculateIndexY(minY);

                if (intersectionIndexX == i && intersectionIndexY == j) {
                    if (checkIfOverlapping(TupleA, TupleB)) {
                        Tuple* res = concatenateTuples(TupleA,TupleB);
                        matchings.push_back(res);
                    }
                }
            }
        }
    }
}

bool Grid::tuplesIntersectInCell(
        Tuple* TupleA, Tuple* TupleB, int64_t i, int64_t j) {

    StandardSpatialAttribute<2> * attr1 =
            (StandardSpatialAttribute<2>*) TupleA->GetAttribute(fAttrIndex);

    StandardSpatialAttribute<2> * attr2 =
            (StandardSpatialAttribute<2>*) TupleB->GetAttribute(sAttrIndex);

    Rectangle<2> intersectionBox =
                attr1->BoundingBox().Intersection(attr2->BoundingBox());

    double minX = (double) intersectionBox.MinD(0);
    double minY = (double) intersectionBox.MinD(1);

    int64_t intersectionIndexX = calculateIndexX(minX);
    int64_t intersectionIndexY = calculateIndexY(minY);

    if (intersectionIndexX == i && intersectionIndexY == j) {
        return true;
    }

    return false;
}