directedLine Class Reference

#include <directedLine.h>

Collaboration diagram for directedLine:

Public Member Functions
	directedLine (short dir, sampledLine *sl)
	directedLine ()
	~directedLine ()
void	init (short dir, sampledLine *sl)
Real *	head ()
Real *	tail ()
Real *	getVertex (Int i)
Int	get_npoints ()
directedLine *	getPrev ()
directedLine *	getNext ()
directedLine *	getNextPolygon ()
sampledLine *	getSampledLine ()
short	getDirection ()
void	putDirection (short dir)
void	putPrev (directedLine *p)
void	putNext (directedLine *p)
void	insert (directedLine *nl)
void	deletePolygonList ()
void	deleteSinglePolygon ()
void	deleteSinglePolygonWithSline ()
void	deletePolygonListWithSline ()
void	deleteSingleLine (directedLine *dline)
directedLine *	deleteDegenerateLines ()
directedLine *	deleteDegenerateLinesAllPolygons ()
directedLine *	cutIntersectionAllPoly (int &cutOccur)
short	isPolygon ()
Int	compInY (directedLine *nl)
Int	compInX (directedLine *nl)
directedLine **	sortAllPolygons ()
Int	numEdges ()
Int	numEdgesAllPolygons ()
Int	numPolygons ()
short	isConnected ()
Real	polyArea ()
void	printSingle ()
void	printList ()
void	printAllPolygons ()
void	writeAllPolygons (char *filename)
directedLine *	insertPolygon (directedLine *newpolygon)
directedLine *	cutoffPolygon (directedLine *p)
Int	toArraySinglePolygon (directedLine **array, Int index)
directedLine **	toArrayAllPolygons (Int &total_num_edges)
void	connectDiagonal (directedLine *v1, directedLine *v2, directedLine **ret_p1, directedLine **ret_p2, sampledLine **generatedLine, directedLine *list)
void	connectDiagonal_2slines (directedLine *v1, directedLine *v2, directedLine **ret_p1, directedLine **ret_p2, directedLine *list)
Int	samePolygon (directedLine *v1, directedLine *v2)
void	setRootBit ()
void	resetRootBit ()
directedLine *	findRoot ()
void	rootLinkSet (directedLine *r)
directedLine *	rootLinkFindRoot ()
directedLine *	deleteChain (directedLine *begin, directedLine *end)

Private Attributes
short	direction
sampledLine *	sline
directedLine *	next
directedLine *	prev
directedLine *	nextPolygon
Int	rootBit
directedLine *	rootLink

Detailed Description

Definition at line 41 of file directedLine.h.

Constructor & Destructor Documentation

directedLine() [1/2]

directedLine::directedLine	(	short	dir,
		sampledLine *	sl
	)

Definition at line 285 of file directedLine.cc.

{
  direction = dir;
  sline = sl;
  next = this;
  prev = this;
  nextPolygon = NULL;
//  prevPolygon = NULL;
  rootBit = 0;/*important to initilzae to 0 meaning not root yet*/
 
  rootLink = NULL;
 
}

directedLine() [2/2]

directedLine::directedLine

(

)

Definition at line 305 of file directedLine.cc.

{
  next = this;
  prev = this;
  nextPolygon = NULL;
  rootBit = 0;/*important to initilzae to 0 meaning not root yet*/
  rootLink = NULL;
  direction = INCREASING;
  sline = NULL;
}

Referenced by connectDiagonal(), connectDiagonal_2slines(), and deleteChain().

~directedLine()

directedLine::~directedLine

(

)

Definition at line 316 of file directedLine.cc.

{
}

Member Function Documentation

compInX()

Int directedLine::compInX

(

directedLine *

nl

)

Definition at line 438 of file directedLine.cc.

{
  if(head()[0] < nl->head()[0]) return -1;
  if(head()[0] == nl->head()[0] && head()[1] < nl->head()[1]) return -1;
  return 1;
}

compInY()

Int directedLine::compInY

(

directedLine *

nl

)

Definition at line 423 of file directedLine.cc.

{
  if(head()[1] < nl->head()[1]) return -1;
  if(head()[1] == nl->head()[1] && head()[0] < nl->head()[0]) return -1;
  return 1;
}

Referenced by monoChain::monoChain().

connectDiagonal()

void directedLine::connectDiagonal	(	directedLine *	v1,
		directedLine *	v2,
		directedLine **	ret_p1,
		directedLine **	ret_p2,
		sampledLine **	generatedLine,
		directedLine *	list
	)

Definition at line 632 of file directedLine.cc.

{
  sampledLine *nsline  = new sampledLine(2);
 
 
 
  nsline->setPoint(0, v1->head());
  nsline->setPoint(1, v2->head());
 
 
 
  /*the increasing line is from v1 head to v2 head*/
  directedLine* newLineInc = new directedLine(INCREASING, nsline);
 
 
 
  directedLine* newLineDec = new directedLine(DECREASING, nsline);
 
 
  directedLine* v1Prev = v1->prev;
  directedLine* v2Prev = v2->prev;
 
  v1        ->prev = newLineDec;
  v2Prev    ->next = newLineDec;
  newLineDec->next = v1;
  newLineDec->prev = v2Prev;
 
  v2        ->prev = newLineInc;
  v1Prev    ->next = newLineInc;
  newLineInc->next = v2;
  newLineInc->prev = v1Prev;
 
  *ret_p1 = newLineDec;
  *ret_p2 = newLineInc;
  *generatedLine = nsline;
}

connectDiagonal_2slines()

void directedLine::connectDiagonal_2slines	(	directedLine *	v1,
		directedLine *	v2,
		directedLine **	ret_p1,
		directedLine **	ret_p2,
		directedLine *	list
	)

Definition at line 675 of file directedLine.cc.

{
  sampledLine *nsline  = new sampledLine(2);
  sampledLine *nsline2  = new sampledLine(2);
 
  nsline->setPoint(0, v1->head());
  nsline->setPoint(1, v2->head());
  nsline2->setPoint(0, v1->head());
  nsline2->setPoint(1, v2->head());
 
  /*the increasing line is from v1 head to v2 head*/
  directedLine* newLineInc = new directedLine(INCREASING, nsline);
 
  directedLine* newLineDec = new directedLine(DECREASING, nsline2);
 
  directedLine* v1Prev = v1->prev;
  directedLine* v2Prev = v2->prev;
 
  v1        ->prev = newLineDec;
  v2Prev    ->next = newLineDec;
  newLineDec->next = v1;
  newLineDec->prev = v2Prev;
 
  v2        ->prev = newLineInc;
  v1Prev    ->next = newLineInc;
  newLineInc->next = v2;
  newLineInc->prev = v1Prev;
 
  *ret_p1 = newLineDec;
  *ret_p2 = newLineInc;
 
}

Referenced by monoPolyPart(), monoTriangulationOpt(), monoTriangulationRecGenOpt(), and sampleMonoPoly().

cutIntersectionAllPoly()

directedLine * directedLine::cutIntersectionAllPoly

(

int &

cutOccur

)

Definition at line 208 of file directedLine.cc.

{
  directedLine* temp;
  directedLine *tempNext = NULL;
  directedLine* ret= NULL;
  directedLine* retEnd = NULL;
  cutOccur = 0;
  for(temp=this; temp != NULL; temp = tempNext)
    {
      int eachCutOccur=0;
      tempNext = temp->nextPolygon;
      temp->nextPolygon = NULL;
      if(ret == NULL)
    {
 
      ret = retEnd = DBG_cutIntersectionPoly(temp, eachCutOccur);
      if(eachCutOccur)
        cutOccur = 1;
    }
      else
    {
 
      retEnd->nextPolygon = DBG_cutIntersectionPoly(temp, eachCutOccur);
      retEnd = retEnd->nextPolygon;
      if(eachCutOccur)
        cutOccur = 1;
    }
    }
  return ret;
}

cutoffPolygon()

directedLine * directedLine::cutoffPolygon

(

directedLine *

p

)

Definition at line 514 of file directedLine.cc.

{
  directedLine* temp;
  directedLine* prev_polygon  = NULL;
  if(p == NULL) return this;
 
  for(temp=this; temp != p; temp = temp->nextPolygon)
    {
      if(temp == NULL)
    {
      fprintf(stderr, "in cutoffPolygon, not found\n");
      exit(1);
    }
      prev_polygon = temp;
    }
 
/*  prev_polygon = p->prevPolygon;*/
 
  p->resetRootBit();
  if(prev_polygon == NULL) /*this is the one to cutoff*/
    return nextPolygon;
  else {
    prev_polygon->nextPolygon = p->nextPolygon;
    return this;
  }
}

Referenced by MC_partitionY(), and partitionY().

deleteChain()

directedLine * directedLine::deleteChain	(	directedLine *	begin,
		directedLine *	end
	)

Definition at line 53 of file directedLine.cc.

{
  if(begin->head()[0] ==  end->tail()[0] &&
     begin->head()[1] ==  end->tail()[1]
     )
    {
      directedLine *ret = begin->prev;
      begin->prev->next = end->next;
      end->next->prev = begin->prev;
      delete begin->sline;
      delete end->sline;
      delete begin;
      delete end;
 
      return ret;
    }
 
  directedLine* newLine;
  sampledLine* sline = new sampledLine(begin->head(), end->tail());
  newLine =  new directedLine(INCREASING, sline);
  directedLine *p = begin->prev;
  directedLine *n = end->next;
  p->next = newLine;
  n->prev = newLine;
  newLine->prev = p;
  newLine->next = n;
 
  delete begin->sline;
  delete end->sline;
  delete begin;
  delete end;
  return newLine;
}

deleteDegenerateLines()

directedLine * directedLine::deleteDegenerateLines

(

)

Definition at line 124 of file directedLine.cc.

{
  //if there is only one edge or two edges, don't do anything
  if(this->next == this)
    return this;
  if(this->next == this->prev)
    return this;
 
  //find a nondegenerate line
  directedLine* temp;
  directedLine* first = NULL;
  if(! myequal(head(), tail()))
    /*
  if(head()[0] != tail()[0] ||
  head()[1] != tail()[1])
  */
    first = this;
  else
    {
      for(temp = this->next; temp != this; temp = temp->next)
    {
      /*
      if(temp->head()[0] != temp->tail()[0] ||
         temp->head()[1] != temp->tail()[1])
         */
      if(! myequal(temp->head(), temp->tail()))
        {
          first = temp;
          break;
        }
        
    }
    }
 
  //if there are no non-degenerate lines, then we simply return NULL.
  if(first == NULL)
    {
      deleteSinglePolygonWithSline();
      return NULL;
    }
 
  directedLine* tempNext = NULL;
  for(temp =first->next; temp != first; temp = tempNext)
    {
      tempNext = temp->getNext();
/*
      if(temp->head()[0] == temp->tail()[0] &&
     temp->head()[1] == temp->tail()[1])
*/      
 
      if(myequal(temp->head(), temp->tail()))
    deleteSingleLine(temp);
    }   
  return first;
}

deleteDegenerateLinesAllPolygons()

directedLine * directedLine::deleteDegenerateLinesAllPolygons

(

)

Definition at line 180 of file directedLine.cc.

{
  directedLine* temp;
  directedLine *tempNext = NULL;
  directedLine* ret= NULL;
  directedLine* retEnd = NULL;
  for(temp=this; temp != NULL; temp = tempNext)
    {
      tempNext = temp->nextPolygon;
      temp->nextPolygon = NULL;
      if(ret == NULL)
    {
      ret = retEnd = temp->deleteDegenerateLines();
        
    }
      else
    {
      directedLine *newPolygon = temp->deleteDegenerateLines();
      if(newPolygon != NULL)
        {
      retEnd->nextPolygon = temp->deleteDegenerateLines();
      retEnd = retEnd->nextPolygon;
    }
    }
    }
  return ret;
}

Referenced by Subdivider::drawSurfaces().

deletePolygonList()

void directedLine::deletePolygonList

(

)

Definition at line 273 of file directedLine.cc.

{
  directedLine *temp, *tempNext;
  for(temp=this; temp != NULL; temp=tempNext)
    {
      tempNext = temp->nextPolygon;
      temp->deleteSinglePolygon();
    }
}

deletePolygonListWithSline()

void directedLine::deletePolygonListWithSline

(

)

Definition at line 252 of file directedLine.cc.

{
  directedLine *temp, *tempNext;
  for(temp=this; temp != NULL; temp=tempNext)
    {
      tempNext = temp->nextPolygon;
      temp->deleteSinglePolygonWithSline();
    }
}

deleteSingleLine()

void directedLine::deleteSingleLine

(

directedLine *

dline

)

Definition at line 88 of file directedLine.cc.

{
  //make sure that dline->prev->tail is the same as
  //dline->next->head. This is for numerical erros.
  //for example, if we delete a line which is almost degeneate
  //within (epsilon), then we want to make that the polygon after deletion
  //is still a valid polygon
 
  dline->next->head()[0] =  dline->prev->tail()[0];
  dline->next->head()[1] =  dline->prev->tail()[1];
 
  dline->prev->next = dline->next;
  dline->next->prev = dline->prev;
 
  delete dline;
 
}

Referenced by deleteDegenerateLines().

deleteSinglePolygon()

void directedLine::deleteSinglePolygon

(

)

Definition at line 262 of file directedLine.cc.

{
  directedLine *temp, *tempNext;
  prev->next = NULL;
  for(temp=this; temp != NULL; temp = tempNext)
    {
      tempNext = temp->next;
      delete temp;
    }
}

deleteSinglePolygonWithSline()

void directedLine::deleteSinglePolygonWithSline

(

)

Definition at line 240 of file directedLine.cc.

{
  directedLine *temp, *tempNext;
  prev->next = NULL;
  for(temp=this; temp != NULL; temp = tempNext)
    {
      tempNext = temp->next;
      delete temp->sline;
      delete temp;
    }
}

Referenced by deleteDegenerateLines(), monoTriangulationOpt(), monoTriangulationRecGenOpt(), sampleLeftOneGridStep(), sampleMonoPoly(), sampleRightOneGridStep(), and Slicer::slice_new().

findRoot()

directedLine * directedLine::findRoot

(

)

Definition at line 722 of file directedLine.cc.

{
  if(rootBit) return this;
  directedLine* temp;
  for(temp = next; temp != this; temp = temp->next)
    if(temp -> rootBit ) return temp;
  return NULL; /*should not happen*/
}

Referenced by MC_partitionY(), and partitionY().

get_npoints()

Int directedLine::get_npoints ( )

inline

Definition at line 72 of file directedLine.h.

{return sline->get_npoints();}

Referenced by DBG_is_U_direction(), monoTriangulation(), monoTriangulationFun(), monoTriangulationRec(), polygonConvert(), sampleMonoPoly(), toVertexArrays(), triangulateConvexPolyHoriz(), and triangulateConvexPolyVertical().

getDirection()

short directedLine::getDirection ( )

inline

Definition at line 78 of file directedLine.h.

{return direction;}

Referenced by DBG_reverse().

getNext()

directedLine * directedLine::getNext ( )

inline

Definition at line 74 of file directedLine.h.

{return next;}

Referenced by DBG_checkConnectivity(), DBG_collectSampledLinesPoly(), DBG_cutIntersectionPoly(), DBG_edgeIntersectPoly(), DBG_edgesIntersect(), DBG_is_U_direction(), DBG_is_U_monotone(), DBG_isConvex(), DBG_polygonSelfIntersect(), DBG_polygonsIntersect(), DBG_rayIntersectPoly(), DBG_reverse(), directedLineLoopToMonoChainLoop(), findDiagonal_singleCuspX(), findInteriorCuspsX(), findTopAndBot(), MC_findDiagonals(), monoPolyPart(), monoTriangulation(), monoTriangulationFun(), numInteriorCuspsX(), polygonConvert(), sampleMonoPoly(), toVertexArrays(), triangulateConvexPoly(), triangulateConvexPolyHoriz(), and triangulateConvexPolyVertical().

getNextPolygon()

directedLine * directedLine::getNextPolygon ( )

inline

Definition at line 75 of file directedLine.h.

{return nextPolygon;}

Referenced by DBG_collectSampledLinesAllPoly(), and DBG_polygonListIntersect().

getPrev()

directedLine * directedLine::getPrev ( )

inline

Definition at line 73 of file directedLine.h.

{return prev;}

Referenced by DBG_checkConnectivity(), DBG_cutIntersectionPoly(), DBG_edgesIntersect(), DBG_is_U_monotone(), DBG_rayIntersectPoly(), DBG_reverse(), findDiagonals(), findRightGridIndices(), MC_findDiagonals(), MC_partitionY(), MC_sweepY(), monoPolyPart(), monoTriangulation(), monoTriangulationFun(), monoTriangulationRec(), partitionY(), sampleMonoPoly(), sweepRangeEqual(), sweepY(), toVertexArrays(), triangulateConvexPolyHoriz(), and triangulateConvexPolyVertical().

getSampledLine()

sampledLine * directedLine::getSampledLine ( )

inline

Definition at line 76 of file directedLine.h.

{return sline;}

Referenced by DBG_collectSampledLinesPoly().

getVertex()

Real * directedLine::getVertex

(

Int

i

)

Definition at line 326 of file directedLine.cc.

{
  return (direction==INCREASING)? (sline->get_points())[i] : (sline->get_points())[sline->get_npoints() - 1 -i];
}

Referenced by monoTriangulation(), monoTriangulationFun(), monoTriangulationRec(), polygonConvert(), sampleMonoPoly(), toVertexArrays(), triangulateConvexPolyHoriz(), and triangulateConvexPolyVertical().

head()

Real * directedLine::head

(

)

Definition at line 320 of file directedLine.cc.

{
 
  return (direction==INCREASING)? (sline->get_points())[0] : (sline->get_points())[sline->get_npoints()-1];
}

Referenced by monoChain::chainIntersectHoriz(), compChainHeadInY(), compEdges(), compInX(), compInY(), DBG_checkConnectivity(), DBG_cutIntersectionPoly(), DBG_edgesIntersect(), DBG_enclosingPolygons(), DBG_is_U_direction(), DBG_is_U_monotone(), DBG_isConvex(), DBG_rayIntersectPoly(), deleteDegenerateLines(), deleteSingleLine(), monoChain::find(), findDiagonal_singleCuspX(), findGridChains(), findLeftGridIndices(), findRightGridIndices(), findTopAndBot(), isConnected(), MC_findDiagonals(), MC_partitionY(), MC_sweepY(), monoChain::monoChain(), monoPolyPart(), monoTriangulation(), monoTriangulationFun(), partitionY(), polyArea(), monoChain::printOneChain(), printSingle(), sampleMonoPoly(), and triangulateConvexPoly().

init()

void directedLine::init	(	short	dir,
		sampledLine *	sl
	)

Definition at line 299 of file directedLine.cc.

{
  direction = dir;
  sline = sl;
}

insert()

void directedLine::insert

(

directedLine *

nl

)

Definition at line 337 of file directedLine.cc.

{
  nl->next = this;
  nl->prev = prev;
  prev->next = nl;
  prev = nl;
  nl->rootLink = this; /*assuming that 'this' is the root!!!*/
}

Referenced by monoTriangulationRecGenOpt(), readAllPolygons(), sampleLeftOneGridStep(), and sampleRightOneGridStep().

insertPolygon()

directedLine * directedLine::insertPolygon

(

directedLine *

newpolygon

)

Definition at line 501 of file directedLine.cc.

{
  /*this polygon is a root*/
  setRootBit();
  if(oldList == NULL) return this;
  nextPolygon = oldList;
/*  oldList->prevPolygon = this;*/
  return this;
}

Referenced by MC_partitionY(), monoPolyPart(), partitionY(), and readAllPolygons().

isConnected()

short directedLine::isConnected

(

)

Definition at line 391 of file directedLine.cc.

{
  if( (head()[0] == prev->tail()[0]) && (head()[1] == prev->tail()[1]))
    return 1;
  else
    return 0;
}

Referenced by isPolygon().

isPolygon()

short directedLine::isPolygon

(

)

Definition at line 371 of file directedLine.cc.

{
  directedLine* temp;
 
  /*a polygon contains at least 3 edges*/
  if(numEdges() <=2) return 0;
 
  /*check this edge*/
  if(! isConnected()) return 0;
 
  /*check all other edges*/
  for(temp=next; temp != this; temp = temp->next){
    if(!isConnected()) return 0;
  }
  return 1;
}

numEdges()

Int directedLine::numEdges

(

)

Definition at line 346 of file directedLine.cc.

{
  Int ret=0;
  directedLine* temp;
  if(next == this) return 1;
 
  ret = 1;
  for(temp = next; temp != this; temp = temp->next)
    ret++;
  return ret;
}

Referenced by isPolygon(), monoTriangulationOpt(), monoTriangulationRecGenOpt(), and sampleMonoPoly().

numEdgesAllPolygons()

Int directedLine::numEdgesAllPolygons

(

)

Definition at line 358 of file directedLine.cc.

{
  Int ret=0;
  directedLine* temp;
  for(temp=this; temp!= NULL; temp=temp->nextPolygon)
    {
      ret += temp->numEdges();
    }
  return ret;
}

Referenced by toArrayAllPolygons().

numPolygons()

Int directedLine::numPolygons

(

)

Definition at line 541 of file directedLine.cc.

{
  if(nextPolygon == NULL) return 1;
  else return 1+nextPolygon->numPolygons();
}

Referenced by numPolygons(), and writeAllPolygons().

polyArea()

Real directedLine::polyArea

(

)

Definition at line 585 of file directedLine.cc.

{
  directedLine* temp;
  Real ret=0.0;
  Real x1,y1,x2,y2;
  x1 = this->head()[0];
  y1 = this->head()[1];
  x2 = this->next->head()[0];
  y2 = this->next->head()[1];
  ret = -(x2*y1-x1*y2);
  for(temp=this->next; temp!=this; temp = temp->next)
    {
      x1 = temp->head()[0];
      y1 = temp->head()[1];
      x2 = temp->next->head()[0];
      y2 = temp->next->head()[1];
      ret += -( x2*y1-x1*y2);
    }
  return Real(0.5)*ret;
}

Referenced by DBG_isCounterclockwise().

printAllPolygons()

void directedLine::printAllPolygons

(

)

Definition at line 490 of file directedLine.cc.

{
  directedLine *temp;
  for(temp = this; temp!=NULL; temp = temp->nextPolygon)
    {
      printf("polygon:\n");
      temp->printList();
    }
}

printList()

void directedLine::printList

(

)

Definition at line 481 of file directedLine.cc.

{
  directedLine* temp;
  printSingle();
  for(temp = next; temp!=this; temp=temp->next)
    temp->printSingle();
}

printSingle()

void directedLine::printSingle

(

)

Definition at line 470 of file directedLine.cc.

{
  if(direction == INCREASING)
    printf("direction is INCREASING\n");
  else
    printf("direction is DECREASING\n");
  printf("head=%f,%f)\n", head()[0], head()[1]);
  sline->print();
}

Referenced by printList(), and sweepY().

putDirection()

void directedLine::putDirection ( short  dir )

inline

Definition at line 79 of file directedLine.h.

{direction = dir;}

Referenced by DBG_reverse().

putNext()

void directedLine::putNext ( directedLine *  p )

inline

Definition at line 81 of file directedLine.h.

{next = p;}

Referenced by DBG_reverse().

putPrev()

void directedLine::putPrev ( directedLine *  p )

inline

Definition at line 80 of file directedLine.h.

{prev = p;}

Referenced by DBG_reverse().

resetRootBit()

void directedLine::resetRootBit ( )

inline

Definition at line 152 of file directedLine.h.

{rootBit = 0;}

rootLinkFindRoot()

directedLine * directedLine::rootLinkFindRoot

(

)

Definition at line 731 of file directedLine.cc.

{
  directedLine* tempRoot;
  directedLine* tempLink;
  tempRoot = this;
  tempLink = rootLink;
  while(tempLink != NULL){
    tempRoot = tempLink;
    tempLink = tempRoot->rootLink;
  }
  return tempRoot;
}

Referenced by MC_partitionY(), and partitionY().

rootLinkSet()

void directedLine::rootLinkSet ( directedLine *  r )

inline

Definition at line 155 of file directedLine.h.

{rootLink = r;}

Referenced by MC_partitionY(), partitionY(), and readAllPolygons().

samePolygon()

Int directedLine::samePolygon	(	directedLine *	v1,
		directedLine *	v2
	)

Definition at line 711 of file directedLine.cc.

{
  if(v1 == v2) return 1;
  directedLine *temp;
  for(temp = v1->next; temp != v1; temp = temp->next)
    {
      if(temp == v2) return 1;
    }
  return 0;
}

Referenced by MC_partitionY(), and partitionY().

setRootBit()

void directedLine::setRootBit ( )

inline

Definition at line 151 of file directedLine.h.

{rootBit = 1;}

Referenced by insertPolygon().

sortAllPolygons()

directedLine ** directedLine::sortAllPolygons

(

)

Definition at line 461 of file directedLine.cc.

{
  Int total_num_edges = 0;
  directedLine** array = toArrayAllPolygons(total_num_edges);
  quicksort( (void**)array, 0, total_num_edges-1, (Int (*)(void *, void *)) compInY2);
 
  return array;
}

tail()

Real * directedLine::tail

(

)

Definition at line 331 of file directedLine.cc.

{
  return (direction==DECREASING)? (sline->get_points())[0] : (sline->get_points())[sline->get_npoints()-1];
}

Referenced by monoChain::chainIntersectHoriz(), compEdges(), DBG_checkConnectivity(), DBG_cutIntersectionPoly(), DBG_edgesIntersect(), DBG_is_U_direction(), DBG_is_U_monotone(), DBG_isConvex(), DBG_rayIntersectPoly(), deleteDegenerateLines(), deleteSingleLine(), findDiagonal_singleCuspX(), findLeftGridIndices(), findRightGridIndices(), isConnected(), and triangulateConvexPoly().

toArrayAllPolygons()

directedLine ** directedLine::toArrayAllPolygons

(

Int &

total_num_edges

)

Definition at line 567 of file directedLine.cc.

{
  total_num_edges=numEdgesAllPolygons();
  directedLine** ret = (directedLine**) malloc(sizeof(directedLine*) * total_num_edges);
  assert(ret);
 
  directedLine *temp;
  Int index = 0;
  for(temp=this; temp != NULL; temp=temp->nextPolygon) {
    index = temp->toArraySinglePolygon(ret, index);
  }
  return ret;
}

Referenced by DBGfindDiagonals(), partitionY(), and sortAllPolygons().

toArraySinglePolygon()

Int directedLine::toArraySinglePolygon	(	directedLine **	array,
		Int	index
	)

Definition at line 552 of file directedLine.cc.

{
  directedLine *temp;
  array[index++] = this;
  for(temp = next; temp != this; temp = temp->next)
    {
      array[index++] = temp;
    }
  return index;
}

writeAllPolygons()

void directedLine::writeAllPolygons

(

char *

filename

)

Definition at line 756 of file directedLine.cc.

{
  FILE* fp = fopen(filename, "w");
  assert(fp);
  Int nPolygons = numPolygons();
  directedLine *root;
  fprintf(fp, "%i\n", nPolygons);
  for(root = this; root != NULL; root = root->nextPolygon)
    {
      directedLine *temp;
      Int npoints=0;
      npoints = root->get_npoints()-1;
      for(temp = root->next; temp != root; temp=temp->next)
    npoints += temp->get_npoints()-1;
      fprintf(fp, "%i\n", npoints/*root->numEdges()*/);
 
 
      for(Int i=0; i<root->get_npoints()-1; i++){
    fprintf(fp, "%f ", root->getVertex(i)[0]);
    fprintf(fp, "%f ", root->getVertex(i)[1]);
      }
 
      for(temp=root->next; temp != root; temp = temp->next)
    {
      for(Int i=0; i<temp->get_npoints()-1; i++){
 
        fprintf(fp, "%f ", temp->getVertex(i)[0]);
        fprintf(fp, "%f ", temp->getVertex(i)[1]);
      }
      fprintf(fp,"\n");
    }
      fprintf(fp, "\n");
    }
  fclose(fp);
}

Member Data Documentation

direction

short directedLine::direction

private

Definition at line 42 of file directedLine.h.

Referenced by getDirection().

next

directedLine* directedLine::next

private

Definition at line 44 of file directedLine.h.

Referenced by connectDiagonal(), connectDiagonal_2slines(), deleteChain(), deleteDegenerateLines(), deleteSingleLine(), deleteSinglePolygon(), deleteSinglePolygonWithSline(), directedLine(), findRoot(), getNext(), insert(), isPolygon(), numEdges(), polyArea(), printList(), putNext(), and toArraySinglePolygon().

nextPolygon

directedLine* directedLine::nextPolygon

private

Definition at line 50 of file directedLine.h.

Referenced by cutIntersectionAllPoly(), cutoffPolygon(), deleteDegenerateLinesAllPolygons(), directedLine(), getNextPolygon(), insertPolygon(), and numPolygons().

prev

directedLine* directedLine::prev

private

Definition at line 45 of file directedLine.h.

Referenced by connectDiagonal(), connectDiagonal_2slines(), deleteChain(), deleteDegenerateLines(), deleteSingleLine(), deleteSinglePolygon(), deleteSinglePolygonWithSline(), directedLine(), getPrev(), insert(), isConnected(), and putPrev().

rootBit

Int directedLine::rootBit

private

Definition at line 55 of file directedLine.h.

Referenced by directedLine(), findRoot(), resetRootBit(), and setRootBit().

rootLink

directedLine* directedLine::rootLink

private

Definition at line 58 of file directedLine.h.

Referenced by directedLine(), insert(), rootLinkFindRoot(), and rootLinkSet().

sline

sampledLine* directedLine::sline

private

Definition at line 43 of file directedLine.h.

Referenced by deleteChain(), directedLine(), get_npoints(), getSampledLine(), getVertex(), head(), init(), printSingle(), and tail().

---

The documentation for this class was generated from the following files:

• dll/opengl/glu32/src/libnurbs/nurbtess/directedLine.h
• dll/opengl/glu32/src/libnurbs/nurbtess/directedLine.cc