vertexArray Class Reference

#include <monoTriangulation.h>

Public Member Functions
	vertexArray (Int s)
	vertexArray (Real vertices[][2], Int nVertices)
	~vertexArray ()
void	appendVertex (Real *ptr)
Real *	getVertex (Int i)
Real **	getArray ()
Int	getNumElements ()
Int	findIndexAbove (Real v)
Int	findIndexAboveGen (Real v, Int startIndex, Int EndIndex)
Int	findIndexBelowGen (Real v, Int startIndex, Int EndIndex)
Int	findIndexStrictBelowGen (Real v, Int startIndex, Int EndIndex)
Int	findIndexFirstAboveEqualGen (Real v, Int startIndex, Int endIndex)
Int	skipEqualityFromStart (Real v, Int start, Int end)
Int	findDecreaseChainFromEnd (Int begin, Int end)
void	print ()

Private Attributes
Real **	array
Int	index
Int	size

Detailed Description

Definition at line 77 of file monoTriangulation.h.

Constructor & Destructor Documentation

vertexArray() [1/2]

vertexArray::vertexArray

(

Int

s

)

Definition at line 1131 of file monoTriangulation.cc.

{
  size = s;
  array = (Real**) malloc(sizeof(Real*) * s);
  assert(array);
  index = 0;
}

vertexArray() [2/2]

vertexArray::vertexArray	(	Real	vertices[][2],
		Int	nVertices
	)

~vertexArray()

vertexArray::~vertexArray

(

)

Definition at line 1139 of file monoTriangulation.cc.

{
  free(array);
}

Member Function Documentation

appendVertex()

void vertexArray::appendVertex

(

Real *

ptr

)

Definition at line 1144 of file monoTriangulation.cc.

{
  Int i;
  if(index >= size){
    Real** temp = (Real**) malloc(sizeof(Real*) * (2*size +1));
    assert(temp);
    for(i=0; i<index; i++)
      temp[i] = array[i];
    free(array);
    array = temp;
    size = 2*size+1;
  }
  array[index++] = ptr;
}

Referenced by monoTriangulation(), monoTriangulationFun(), monoTriangulationFunBackend(), monoTriangulationLoop(), sampleCompBotSimple(), sampleCompTopSimple(), sampleLeftSingleTrimEdgeRegion(), sampleLeftSingleTrimEdgeRegionGen(), sampleMonoPoly(), sampleRightSingleTrimEdgeRegion(), sampleRightSingleTrimEdgeRegionGen(), and toVertexArrays().

findDecreaseChainFromEnd()

Int vertexArray::findDecreaseChainFromEnd	(	Int	begin,
		Int	end
	)

Definition at line 1306 of file monoTriangulation.cc.

{
  Int i = end;
  Real prevU = array[i][0];
  Real thisU;
  for(i=end-1; i>=begin; i--){
    thisU = array[i][0];
    if(thisU < prevU)
      prevU = thisU;
    else
      break;
  }
  return i;
}

Referenced by sampleRightOneGridStep().

findIndexAbove()

Int vertexArray::findIndexAbove

(

Real

v

)

Definition at line 1175 of file monoTriangulation.cc.

{
  Int i;
  if(index == 0) 
    return -1;
  else if(array[0][1] < v)
    return -1;
  else
    {
      for(i=1; i<index; i++)
    {
      if(array[i][1] < v)
        break;
    }
      return i-1;
    }
}

findIndexAboveGen()

Int vertexArray::findIndexAboveGen	(	Real	v,
		Int	startIndex,
		Int	EndIndex
	)

Definition at line 1288 of file monoTriangulation.cc.

{
  Int i;
  if(startIndex > endIndex) 
    return startIndex-1;
  else if(array[startIndex][1] < v)
    return startIndex-1;
  else //now array[startIndex][1] >= v
    {
      for(i=startIndex+1; i<=endIndex; i++)
    {
      if(array[i][1] < v)
        break;
    }
      return i-1;
    }
}

Referenced by findNeck(), sampleCompLeft(), and sampleCompRight().

findIndexBelowGen()

Int vertexArray::findIndexBelowGen	(	Real	v,
		Int	startIndex,
		Int	EndIndex
	)

Definition at line 1201 of file monoTriangulation.cc.

{
  Int i;
  if(startIndex > endIndex) 
    return endIndex+1;
  else if(array[endIndex][1] >  v)
    return endIndex+1;
  else //now array[endIndex][1] <= v
    {
      for(i=endIndex-1; i>=startIndex; i--)
    {
      if(array[i][1] > v)
        break;
    }
      return i+1;
    }
}

Referenced by findDownCorners(), sampleCompLeft(), and sampleCompRight().

findIndexFirstAboveEqualGen()

Int vertexArray::findIndexFirstAboveEqualGen	(	Real	v,
		Int	startIndex,
		Int	endIndex
	)

Definition at line 1253 of file monoTriangulation.cc.

{
 
  Int i;
  if(startIndex > endIndex) 
    return startIndex-1;
  else if(array[startIndex][1] < v)
    return startIndex-1;
  else //now array[startIndex][1] >= v
    {
 
      for(i=startIndex; i<=endIndex; i++)
    {
      if(array[i][1] <= v)
        break;
    }
      if(i>endIndex) // v is strictly below all
    return endIndex;
      else if(array[i][1] == v)
    return i;
      else
    return i-1;
    }
 
}

Referenced by findNeckF(), and findUpCorners().

findIndexStrictBelowGen()

Int vertexArray::findIndexStrictBelowGen	(	Real	v,
		Int	startIndex,
		Int	EndIndex
	)

Definition at line 1227 of file monoTriangulation.cc.

{
  Int i;
  if(startIndex > endIndex) 
    return endIndex+1;
  else if(array[endIndex][1] >=  v)
    return endIndex+1;
  else //now array[endIndex][1] < v
    {
      for(i=endIndex-1; i>=startIndex; i--)
    {
      if(array[i][1] >= v)
        break;
    }
      return i+1;
    }
}

Referenced by sampleMonoPolyRec().

getArray()

Real ** vertexArray::getArray ( )

inline

Definition at line 87 of file monoTriangulation.h.

{return array;}

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

getNumElements()

Int vertexArray::getNumElements ( )

inline

Definition at line 88 of file monoTriangulation.h.

{return index;}

Referenced by findNeck(), findNeckF(), monoTriangulationFun(), monoTriangulationRec(), monoTriangulationRecFun(), monoTriangulationRecFunBackend(), monoTriangulationRecOpt(), sampleCompBotSimple(), sampleCompTopSimple(), sampleLeftSingleTrimEdgeRegionGen(), sampleMonoPolyRec(), and sampleRightSingleTrimEdgeRegionGen().

getVertex()

Real * vertexArray::getVertex ( Int  i )

inline

Definition at line 86 of file monoTriangulation.h.

{return array[i];}

Referenced by chainConcave(), chainConvex(), drawCorners(), findBotLeftSegment(), findBotRightSegment(), findBotSeparator(), findDownCorners(), findNeck(), findNeckF(), findTopLeftSegment(), findTopRightSegment(), findTopSeparator(), findUpCorners(), monoTriangulation2(), monoTriangulationRecGenOpt(), monoTriangulationRecGenTBOpt(), monoTriangulationRecOpt(), sampleBotLeftWithGridLinePost(), sampleBotRightWithGridLinePost(), sampleCompBot(), sampleCompBotSimple(), sampleCompLeft(), sampleCompRight(), sampleCompTop(), sampleCompTopSimple(), sampleCompTopSimpleOpt(), sampleLeftOneGridStep(), sampleLeftSingleTrimEdgeRegionGen(), sampleLeftStrip(), sampleLeftStripRec(), sampleLeftStripRecF(), sampleMonoPolyRec(), sampleRightOneGridStep(), sampleRightSingleTrimEdgeRegionGen(), sampleRightStripRecF(), sampleTopLeftWithGridLinePost(), sampleTopRightWithGridLinePost(), stripOfFanLeft(), and stripOfFanRight().

print()

void vertexArray::print

(

)

Definition at line 1159 of file monoTriangulation.cc.

{
  printf("vertex Array:index=%i, size=%i\n", index, size);
  for(Int i=0; i<index; i++)
    {
      printf("(%f,%f) ", array[i][0], array[i][1]);
    }
  printf("\n");
}

Referenced by findDownCorners().

skipEqualityFromStart()

Int vertexArray::skipEqualityFromStart	(	Real	v,
		Int	start,
		Int	end
	)

Definition at line 1323 of file monoTriangulation.cc.

{
  Int i;
  if(array[start][1] != v)
    return start;
  //now array[start][1] == v
  for(i=start+1; i<= end; i++)
    if(array[i][1] != v) 
      break;
  return i-1;
}

Referenced by findDownCorners(), and findUpCorners().

Member Data Documentation

array

Real** vertexArray::array

private

Definition at line 78 of file monoTriangulation.h.

Referenced by getArray().

index

Int vertexArray::index

private

Definition at line 79 of file monoTriangulation.h.

Referenced by appendVertex(), findIndexAbove(), getNumElements(), and print().

size

Int vertexArray::size

private

Definition at line 80 of file monoTriangulation.h.

---

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

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