NeighborhoodRecord.cpp

Go to the documentation of this file.

#include "NeighborhoodRecord.h"

using namespace vis2;

void NeighborhoodRecord::addMember( const glm::vec3 & _new_member)
{
    
    // check if member already exists...
    bool member_alerady_exists = false;
    for( unsigned int i = 0; i < members.size(); i++ )
    {
        glm::vec3 tmp = members.at(i);
        if (tmp.x == _new_member.x && tmp.y == _new_member.y && tmp.z == _new_member.z)
        {
            member_alerady_exists = true;
            // std::cout << "Member already exists." << std::endl;
            break;
        }
    }
    
    // if not, add it
    if (!member_alerady_exists)
    {
        members.push_back(_new_member);
        colorContainer cC;
        neighb_lists.push_back(cC);
    }
}

void NeighborhoodRecord::addNeighbor( const glm::vec3 & _exiting_member, const glm::vec3 & _new_neighbor)
{
    // add "_new_neighbor" to the neighbor list of "_exiting_member"
    for( unsigned int i = 0; i < members.size(); i++ )
    {
        glm::vec3 tmp = members.at(i);
        if (tmp.x == _exiting_member.x && tmp.y == _exiting_member.y && tmp.z == _exiting_member.z)
        {
            addNeighbor2ExistingMember(i, _new_neighbor);
            break;
        }
    }

    // add "_exiting_member" to the neighbor list of "_new_neighbor"
    for( unsigned int i = 0; i < members.size(); i++ )
    {
        glm::vec3 tmp = members.at(i);
        if (tmp.x == _new_neighbor.x && tmp.y == _new_neighbor.y && tmp.z == _new_neighbor.z)
        {
            addNeighbor2ExistingMember(i, _exiting_member);
            break;
        }
    }
}

bool NeighborhoodRecord::isNeighborOf(const glm::vec3 & _id_1, const glm::vec3 & _id_2) const
{
    // check if the first member already exists...
    bool are_neighbors = false;
    for( unsigned int i = 0; i < members.size(); i++ )
    {
        glm::vec3 tmp = members.at(i);
        if (tmp.x == _id_1.x && tmp.y == _id_1.y && tmp.z == _id_1.z)
        {
            are_neighbors = isNeighbor2ExistingMember(i, _id_2);
            break;
        }
    }

    return are_neighbors;
}

void NeighborhoodRecord::printNeighbLists() const
{
    for( unsigned int i = 0; i < members.size(); i++ )
    {
        glm::vec3 tmp = members.at(i);
        std::cout << "member [" << tmp.x << " " << tmp.y << " " << tmp.z << "]:" << std::endl;
        colorContainer list = neighb_lists.at(i);
        for (unsigned int j = 0; j < list.size(); j++)
        {
            glm::vec3 nghb = list.at(j);
            std::cout << "\t neighbor (" << nghb.x << " " << nghb.y << " " << nghb.z << ")" << std::endl;
        }

    }
}


void NeighborhoodRecord::addNeighbor2ExistingMember(unsigned int _slot, const glm::vec3 & _new_neighbor)
{
    // check if neighbor is already in the list...
    bool neighbor_alerady_listed = isNeighbor2ExistingMember(_slot, _new_neighbor);
    
    // if not, add it
    if (!neighbor_alerady_listed)
        neighb_lists.at(_slot).push_back(_new_neighbor);
}


bool NeighborhoodRecord::isNeighbor2ExistingMember(unsigned int _slot, const glm::vec3 & _id) const
{

    bool is_neighbor = false;
    colorContainer list = neighb_lists.at(_slot);

    for( unsigned int i = 0; i < list.size(); i++ )
    {
        glm::vec3 tmp = list.at(i);
        if (tmp.x == _id.x && tmp.y == _id.y && tmp.z == _id.z)
        {
            is_neighbor = true;
            break;
        }
    }

    return is_neighbor;
}