reflexChain Class Reference

#include <monoTriangulation.h>

Public Member Functions
	reflexChain (Int size, Int isIncreasing)
	~reflexChain ()
void	insert (Real u, Real v)
void	insert (Real v[2])
void	processNewVertex (Real v[2], primStream *pStream)
void	outputFan (Real v[2], primStream *pStream)
void	processNewVertex (Real v[2], Backend *backend)
void	outputFan (Real v[2], Backend *backend)
void	print ()

Private Attributes
Real2 *	queue
Int	isIncreasing
Int	index_queue
Int	size_queue

Detailed Description

Definition at line 43 of file monoTriangulation.h.

Constructor & Destructor Documentation

reflexChain()

reflexChain::reflexChain	(	Int	size,
		Int	isIncreasing
	)

Definition at line 1342 of file monoTriangulation.cc.

{
  queue = (Real2*) malloc(sizeof(Real2) * size);
  assert(queue);
  index_queue = 0;
  size_queue = size;
  isIncreasing = is_increasing;
}

~reflexChain()

reflexChain::~reflexChain

(

)

Definition at line 1351 of file monoTriangulation.cc.

{
  free(queue);
}

Member Function Documentation

insert() [1/2]

void reflexChain::insert	(	Real	u,
		Real	v
	)

Definition at line 1359 of file monoTriangulation.cc.

{
  Int i;
  if(index_queue >= size_queue) {
    Real2 *temp = (Real2*) malloc(sizeof(Real2) * (2*size_queue+1));
    assert(temp);

    /*copy*/
    for(i=0; i<index_queue; i++){
      temp[i][0] = queue[i][0];
      temp[i][1] = queue[i][1];
    }
    
    free(queue);
    queue = temp;
    size_queue = 2*size_queue + 1;
  }

  queue[index_queue][0] = u;
  queue[index_queue][1] = v;
  index_queue ++;
}

Referenced by insert(), and processNewVertex().

insert() [2/2]

void reflexChain::insert

(

Real

v[2]

)

Definition at line 1382 of file monoTriangulation.cc.

{
  insert(v[0], v[1]);
}

outputFan() [1/2]

void reflexChain::outputFan	(	Real	v[2],
		primStream *	pStream
	)

Definition at line 1404 of file monoTriangulation.cc.

{
  Int i;
  pStream->begin();
  pStream->insert(v);
  if(isIncreasing) {
    for(i=0; i<index_queue; i++)
      pStream->insert(queue[i]);
  }
  else {
    for(i=index_queue-1; i>=0; i--)
      pStream->insert(queue[i]);    
  }
  pStream->end(PRIMITIVE_STREAM_FAN);
}

Referenced by monoTriangulationRec(), monoTriangulationRecFun(), monoTriangulationRecFunBackend(), monoTriangulationRecFunGen(), and monoTriangulationRecGen().

outputFan() [2/2]

void reflexChain::outputFan	(	Real	v[2],
		Backend *	backend
	)

Definition at line 43 of file monoTriangulationBackend.cc.

{
  Int i;
  /*
  TrimVertex trimVert;
  */
  backend->bgntfan();

  /*
  trimVert.param[0]=v[0];
  trimVert.param[1]=v[1];
  backend->tmeshvert(&trimVert);
  */
  backend->tmeshvert(v[0], v[1]);

  if(isIncreasing) {
    for(i=0; i<index_queue; i++)
      {
    /*
    trimVert.param[0]=queue[i][0];
    trimVert.param[1]=queue[i][1];
    backend->tmeshvert(&trimVert);
    */
    backend->tmeshvert(queue[i][0], queue[i][1]);
      }
  }
  else {
    for(i=index_queue-1; i>=0; i--)
      {
    /*
    trimVert.param[0]=queue[i][0];
    trimVert.param[1]=queue[i][1];
    backend->tmeshvert(&trimVert);
    */
    backend->tmeshvert(queue[i][0], queue[i][1]);
      }
  }
  backend->endtfan();
}

print()

void reflexChain::print

(

void

)

Definition at line 1474 of file monoTriangulation.cc.

{
  Int i;
  printf("reflex chain: isIncreasing=%i\n", isIncreasing);
  for(i=0; i<index_queue; i++) {
    printf("(%f,%f) ", queue[i][0], queue[i][1]);
  }
  printf("\n");
}

processNewVertex() [1/2]

void reflexChain::processNewVertex	(	Real	v[2],
		primStream *	pStream
	)

Definition at line 1420 of file monoTriangulation.cc.

{
  Int i,j,k;
  Int isReflex;
  /*if there are at most one vertex in the queue, then simply insert
   */
  if(index_queue <=1){
    insert(v);
    return;
  }
  
  /*there are at least two vertices in the queue*/
  j=index_queue-1;
  
  for(i=j; i>=1; i--) {
    if(isIncreasing) {
      isReflex = (area(queue[i-1], queue[i], v) <= 0.0);
    }
    else /*decreasing*/{
      isReflex = (area(v, queue[i], queue[i-1]) <= 0.0);      
    }
    if(isReflex) {
      break;
    }
  }

  /*
   *if i<j then vertices: i+1--j are convex
   * output triangle fan: 
   *  v, and queue[i], i+1, ..., j
   */
  if(i<j) 
    {
      pStream->begin();
      pStream->insert(v);
      if(isIncreasing) {
    for(k=i; k<=j; k++)
      pStream->insert(queue[k]);
      }
      else {
    for(k=j; k>=i; k--)
      pStream->insert(queue[k]);
      }
      
      pStream->end(PRIMITIVE_STREAM_FAN);
    }

  /*delete vertices i+1--j from the queue*/
  index_queue = i+1;
  /*finally insert v at the end of the queue*/
  insert(v);

}

Referenced by monoTriangulation2(), monoTriangulationRec(), monoTriangulationRecFun(), monoTriangulationRecFunBackend(), monoTriangulationRecFunGen(), and monoTriangulationRecGen().

processNewVertex() [2/2]

void reflexChain::processNewVertex	(	Real	v[2],
		Backend *	backend
	)

Definition at line 83 of file monoTriangulationBackend.cc.

{
  Int i,j,k;
  Int isReflex;
  /*TrimVertex trimVert;*/
  /*if there are at most one vertex in the queue, then simply insert
   */
  if(index_queue <=1){
    insert(v);
    return;
  }
  
  /*there are at least two vertices in the queue*/
  j=index_queue-1;
  
  for(i=j; i>=1; i--) {
    if(isIncreasing) {
      isReflex = (area(queue[i-1], queue[i], v) <= 0.0);
    }
    else /*decreasing*/{
      isReflex = (area(v, queue[i], queue[i-1]) <= 0.0);      
    }
    if(isReflex) {
      break;
    }
  }

  /*
   *if i<j then vertices: i+1--j are convex
   * output triangle fan: 
   *  v, and queue[i], i+1, ..., j
   */
  if(i<j) 
    {
      backend->bgntfan();
      /*
      trimVert.param[0]=v[0];
      trimVert.param[1]=v[1];
      backend->tmeshvert(& trimVert);
      */
      backend->tmeshvert(v[0], v[1]);

      if(isIncreasing) {
    for(k=i; k<=j; k++)
      {
        /*
        trimVert.param[0]=queue[k][0];
        trimVert.param[1]=queue[k][1];
        backend->tmeshvert(& trimVert);
        */
        backend->tmeshvert(queue[k][0], queue[k][1]);
      }
      }
      else {
    for(k=j; k>=i; k--)
      {
        /*
        trimVert.param[0]=queue[k][0];
        trimVert.param[1]=queue[k][1];
        backend->tmeshvert(& trimVert);
        */
        backend->tmeshvert(queue[k][0], queue[k][1]);
      }
      }
      
      backend->endtfan();
    }

  /*delete vertices i+1--j from the queue*/
  index_queue = i+1;
  /*finally insert v at the end of the queue*/
  insert(v);

}

Member Data Documentation

index_queue

Int reflexChain::index_queue

private

Definition at line 51 of file monoTriangulation.h.

Referenced by insert(), outputFan(), print(), processNewVertex(), and reflexChain().

isIncreasing

Int reflexChain::isIncreasing

private

Definition at line 50 of file monoTriangulation.h.

Referenced by outputFan(), print(), processNewVertex(), and reflexChain().

queue

Real2* reflexChain::queue

private

Definition at line 44 of file monoTriangulation.h.

size_queue

Int reflexChain::size_queue

private

Definition at line 52 of file monoTriangulation.h.

Referenced by insert(), and reflexChain().

---

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

• dll/opengl/glu32/src/libnurbs/nurbtess/monoTriangulation.h
• dll/opengl/glu32/src/libnurbs/internals/monoTriangulationBackend.cc
• dll/opengl/glu32/src/libnurbs/nurbtess/monoTriangulation.cc