Classes
class	Edge

class	Iterator

Public Types
typedef SmallArray< int, 2 >	FaceIndexArray

typedef SmallArray< Edge, 6 >	EdgeArray

typedef Array< EdgeArray >	ET

Public Member Functions
	MeshEdgeTable ()

void	clear ()

void	resize (int maxV)

void	insert (int v0, int v1, int faceIndex)

Iterator	begin ()

Private Attributes
ET	table

Detailed Description

Two-level table mapping index 0 -> index 1 -> list of face indices

Member Typedef Documentation

typedef SmallArray<Edge, 6> G3D::MeshEdgeTable::EdgeArray

We expect at most 6 edges per vertex; that matches a typical regular grid mesh

typedef Array< EdgeArray > G3D::MeshEdgeTable::ET

typedef SmallArray<int, 2> G3D::MeshEdgeTable::FaceIndexArray

We expect 2 faces per edge.

Constructor & Destructor Documentation

G3D::MeshEdgeTable::MeshEdgeTable ( )

inline

  {
  AreaMemoryManager::Ref mm = AreaMemoryManager::create();
  table.clearAndSetMemoryManager(mm);
  }

Here is the call graph for this function:

Member Function Documentation

Iterator G3D::MeshEdgeTable::begin ( )

inline

  {
  return Iterator(table);
  }

Here is the caller graph for this function:

void G3D::MeshEdgeTable::clear ( )

inline

  {
  table.clear();
  }

Here is the call graph for this function:

Here is the caller graph for this function:

void G3D::MeshEdgeTable::insert	(	int	v0,
		int	v1,
		int	faceIndex
	)

inline

Inserts the faceIndex into the edge's face list. The index may be a negative number indicating a backface.

Parameters

v0	Vertex index 0
v1	Vertex index 1

  {
  
  debugAssert(v0 <= v1);
  EdgeArray& edgeArray = table[v0];
  for (int i = 0; i < edgeArray.size(); ++i) {
  if (edgeArray[i].i1 == v1) {
  edgeArray[i].faceIndexArray.push(faceIndex);
  return;
  }
  }
 
  Edge& p = edgeArray.next();
  p.i1 = v1;
  p.faceIndexArray.push(faceIndex);
  }