DualGraph.cpp

Go to the documentation of this file.

#include "meshkit/DualGraph.hpp"

using namespace Jaal;


int DualGraph::build(Mesh *m)
{
    mesh = m;
    nodes.clear();
    edges.clear();

    size_t numfaces = mesh->getSize(2);

    int relexist = mesh->build_relations(0, 2);

    Vertex *dualvtx;

    nodes.resize(numfaces);

    Face *face;
    for (size_t iface = 0; iface < numfaces; iface++)
    {
        face = mesh->getFaceAt(iface);
        assert(face);
        face->setID(iface);
        dualvtx = DualGraph::getNewDualNode(face);
        dualvtx->setID(iface);
        nodes[iface] = dualvtx;
    }

    PNode v0, v1, dv0, dv1;

    FaceSequence neighs;
    for (size_t iface = 0; iface < numfaces; iface++)
    {
        face = mesh->getFaceAt(iface);
        int nc = face->getSize(0);
        for (int j = 0; j < nc; j++)
        {
            v0 = face->getNodeAt((j + 0) );
            v1 = face->getNodeAt((j + 1) );
            Mesh::getRelations112(v0, v1, neighs);
            if (neighs.size() == 2)
            {
                 dv0 = NULL;
                 neighs[0]->getAttribute("DualNode", dv0);
                 dv1 = NULL;
                 neighs[1]->getAttribute("DualNode", dv1);
                addEdge(dv0, dv1);
            }
            else
            {
                dv0 = NULL;
                neighs[0]->getAttribute("DualNode", dv0);
                dv0->setAttribute("Boundary", 1);
            }
        }
    }

    if (!relexist)
        mesh->clear_relations(0, 2);

    adjTable[0][0] = 1;
    mesh->setDual(1);
    return 0;
}


void DualGraph::node_node_adjacency_rep()
{
    assert( adjTable[1][0]);

    int numedges = edges.size();

    for (int i = 0; i < numedges; i++)
    {
        Edge *edge = edges[i];
        Vertex *v0 = edge->getNodeAt(0);
        Vertex *v1 = edge->getNodeAt(1);
        addEdge(v0, v1);
        delete edge;
    }
    edges.clear();

    adjTable[1][0] = 0;
    adjTable[0][0] = 1;
}

void DualGraph::edge_rep()
{
    NodeSequence vneighs, eConnect(2);

    assert( adjTable[0][0]);

    edges.clear();

    size_t numfaces = mesh->getSize(2);
    edges.reserve(2 * numfaces);
    for (size_t iface = 0; iface < numfaces; iface++)
    {
        Vertex *dualvtx = nodes[iface];
        dualvtx->getRelations( vneighs );
        for (size_t i = 0; i < vneighs.size(); i++)
        {
            Edge *newedge = new Edge(dualvtx, vneighs[i]);
            edges.push_back(newedge);
        }
        dualvtx->clearRelations(0);
    }

    adjTable[1][0] = 1;
    adjTable[0][0] = 0;
}

void DualGraph::writeNodes(const string &fname)
{
    string filename = fname + ".node";

    ofstream ofile(filename.c_str(), ios::out);
    if (ofile.fail())
    {
        cout << "Warning: cann't open node file " << filename << endl;
        return;
    }

    int numnodes = nodes.size();
    ofile << numnodes << " 2 0 0" << endl;

    for (int i = 0; i < numnodes; i++)
    {
        Point3D p3d = nodes[i]->getXYZCoords();
        ofile << i << " " << p3d[0] << " " << p3d[1] << " " << p3d[1] << endl;
    }
}


void DualGraph::writeEdges(const string &fname)
{

    string filename = fname + ".edge";
    ofstream ofile(filename.c_str(), ios::out);
    if (ofile.fail())
    {
        cout << "Warning: cann't open node file " << filename << endl;
        return;
    }

    edge_rep();

    int numedges = edges.size();
    ofile << numedges << " 0 " << endl;

    for (int i = 0; i < numedges; i++)
    {
        int id0 = edges[i]->getNodeAt(0)->getID();
        int id1 = edges[i]->getNodeAt(1)->getID();
        ofile << i << " " << id0 << " " << id1 << endl;
    }

}