directedLine.cc File Reference

#include <math.h>
#include "quicksort.h"
#include "polyDBG.h"

Include dependency graph for directedLine.cc:

Go to the source code of this file.

Functions
static Int	myequal (Real a[2], Real b[2])
Int	compV2InY (Real A[2], Real B[2])
Int	compV2InX (Real A[2], Real B[2])
static Int	compInY2 (directedLine *v1, directedLine *v2)
directedLine *	readAllPolygons (char *filename)

Function Documentation

compInY2()

static Int compInY2 ( directedLine *  v1, directedLine *  v2  )

static

Definition at line 447 of file directedLine.cc.

{
  return v1->compInY(v2);
}

Referenced by directedLine::sortAllPolygons().

compV2InX()

Int compV2InX	(	Real	A[2],
		Real	B[2]
	)

Definition at line 407 of file directedLine.cc.

{
  if(A[0] < B[0]) return -1;
  if(A[0] == B[0] && A[1] < B[1]) return -1;
  if(A[0] == B[0] && A[1] == B[1]) return 0;
  return 1;
}

Referenced by DBG_is_U_monotone(), findDiagonal_singleCuspX(), is_u_maximal(), is_u_minimal(), isCuspX(), monoTriangulationOpt(), monoTriangulationRecGenOpt(), and sampleMonoPoly().

compV2InY()

Int compV2InY	(	Real	A[2],
		Real	B[2]
	)

Definition at line 399 of file directedLine.cc.

{
  if(A[1] < B[1]) return -1;
  if(A[1] == B[1] && A[0] < B[0]) return -1;
  if(A[1] == B[1] && A[0] == B[0]) return 0;
  return 1;
}

Referenced by compChainHeadInY(), findTopAndBot(), monoPolyPart(), monoTriangulation(), monoTriangulationOpt(), monoTriangulationRec(), monoTriangulationRecGen(), sampleMonoPoly(), Slicer::slice_new(), and triangulateConvexPoly().

myequal()

static Int myequal ( Real  a[2], Real  b[2]  )

static

Definition at line 106 of file directedLine.cc.

{
  /*
  if(a[0]==b[0] && a[1] == b[1])
    return 1;
  else
    return 0;
    */
 
 
  if(fabs(a[0]-b[0]) < 0.00001 &&
     fabs(a[1]-b[1]) < 0.00001)
    return 1;
  else
    return 0;
 
}

Referenced by directedLine::deleteDegenerateLines().

readAllPolygons()

directedLine * readAllPolygons

(

char *

filename

)

Definition at line 792 of file directedLine.cc.

{
  Int i,j;
  FILE* fp = fopen(filename, "r");
  Int nPolygons;
  int result;
 
  assert(fp);
  result = fscanf(fp, "%i", &nPolygons);
  assert(result != EOF);
  directedLine *ret = NULL;
 
  for(i=0; i<nPolygons; i++)
    {
      Int nEdges;
      result = fscanf(fp, "%i", &nEdges);
      assert(result != EOF);
      Real vert[2][2] = { { 0 } };
      Real VV[2][2];
      /*the first two vertices*/
      result = fscanf(fp, "%f", &(vert[0][0]));
      assert(result != EOF);
      result = fscanf(fp, "%f", &(vert[0][1]));
      assert(result != EOF);
      result = fscanf(fp, "%f", &(vert[1][0]));
      assert(result != EOF);
      result = fscanf(fp, "%f", &(vert[1][1]));
      assert(result != EOF);
      VV[1][0] = vert[0][0];
      VV[1][1] = vert[0][1];
      sampledLine *sLine = new sampledLine(2, vert);
      directedLine *thisPoly = new directedLine(INCREASING, sLine);
thisPoly->rootLinkSet(NULL);
 
      directedLine *dLine;
      for(j=2; j<nEdges; j++)
    {
      vert[0][0]=vert[1][0];
      vert[0][1]=vert[1][1];
      result = fscanf(fp, "%f", &(vert[1][0]));
      assert(result != EOF);
      result = fscanf(fp, "%f", &(vert[1][1]));
      assert(result != EOF);
      sLine = new sampledLine(2,vert);
      dLine = new directedLine(INCREASING, sLine);
dLine->rootLinkSet(thisPoly);
      thisPoly->insert(dLine);
    }
 
      VV[0][0]=vert[1][0];
      VV[0][1]=vert[1][1];
      sLine = new sampledLine(2,VV);
      dLine = new directedLine(INCREASING, sLine);
dLine->rootLinkSet(thisPoly);
      thisPoly->insert(dLine);
 
      ret = thisPoly->insertPolygon(ret);
    }
  fclose(fp);
  return ret;
}