origin.h File Reference

#include <iostream>
#include <bits/stdc++.h>
#include <typeinfo>
#include "HalfEdgeList.h"
#include "VertexList.h"

Include dependency graph for origin.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions
void	getPolygon (char const *filename)
	Extract Data from Input File. More...
void	printPolygon ()
DCELFace *	getFaceCommonTo (DCELVertex *v1, DCELVertex *v2)
bool	checkEdge (DCELVertex *v1, DCELVertex *v2)
void	insertDiagonal (DCELVertex *v1, DCELVertex *v2)

Variables
VertexList	Vertices
HalfEdgeList	Edges
FaceList	Faces

Function Documentation

bool checkEdge	(	DCELVertex *	v1,
		DCELVertex *	v2
	)

                                               {
    DCELHalfEdge* walker = v1->edge;
    do {
        if (walker->next->origin == v2) {
            return true;
        }
        walker = walker->twin->next;
    } while (walker != v1->edge);
    return false;
}

DCELFace* getFaceCommonTo	(	DCELVertex *	v1,
		DCELVertex *	v2
	)

                                                          {
    DCELFace* face = NULL;
    DCELHalfEdge* walker = v1->edge;
    DCELHalfEdge* twinWalker = v2->edge;
    do {
        do {
            if (walker->face == twinWalker->face && walker->face->bordered)
            {face = walker->face; break;}
            twinWalker = twinWalker->twin->next;
        } while (twinWalker != v2->edge);
        walker = walker->twin->next;
    } while (walker != v1->edge && !face);
    return face;
}

void getPolygon

(

char const *

filename

)

Extract Data from Input File.

getPolygon is the main extractor function that builds the collations. Vertices are expected to be received in an anticlockwise order.

                                      {
    double a, b, c ;
    DCELVertex* firstVertex;
    DCELVertex *walker = new DCELVertex();
    DCELHalfEdge *LaggingTwin = NULL;
    DCELFace *inner = new DCELFace();
    DCELFace *outer = new DCELFace();
    ifstream in_file;
    in_file.open(filename);
    while (in_file.is_open()) {
        int n, i = 0;
        in_file >> n;
        while (in_file >> a >> b >> c) {
            DCELVertex *next = new DCELVertex();
            next->setCoords(a, b);
            DCELHalfEdge *edge = new DCELHalfEdge();
            edge->origin = next;
            edge->face = inner;
            inner->edge = edge;
            Edges.addToList(edge);
            LaggingTwin = Edges.addTwinTo(edge, LaggingTwin);
            LaggingTwin->face = outer;
            outer->edge = LaggingTwin;
            outer->bordered = false;
            next->edge = edge;
            if (!Vertices.length) firstVertex = next;
            Vertices.addToList(next);
        }
        Faces.addToList(outer);
        Faces.addToList(inner);

        in_file.close();
    }
    Edges.tail->next = Edges.head;
    Edges.head->twin->next = Edges.tail->twin;
    Edges.tail->twin->origin = firstVertex;
}

void insertDiagonal	(	DCELVertex *	v1,
		DCELVertex *	v2
	)

                                                    {
    if (v1 == v2) return;
    if (checkEdge(v1,v2)) return;

    DCELFace* face = getFaceCommonTo(v1, v2);
    if(face) {
        DCELFace* newSubdivision = Edges.addEdgeBetween(v1, v2, face);
        Faces.addToList(newSubdivision);
        Faces.removeFromList(face);
        delete face;
    }
}

void printPolygon

(

)

                    {
    cout << "OFF" << endl;
    cout << Vertices.length << " " << Faces.length() << " 0" << endl;
    Vertices.echo();
    DCELFace *walker = Faces.head;
    DCELHalfEdge *edgeWalker;
    while (walker) {
        if (walker->bordered) {
            edgeWalker = walker->edge;
            cout << walker->boundaryLength() << " ";
            do {
                cout << edgeWalker->origin->index << " ";
                edgeWalker = edgeWalker->next;
            } while (edgeWalker != walker->edge);
            cout << (double)rand() / RAND_MAX << " " << (double)rand() / RAND_MAX << " " << (double)rand() / RAND_MAX;
            cout << endl;
        }
        walker = walker->next;
    }
}

Variable Documentation

HalfEdgeList Edges

FaceList Faces

VertexList Vertices