vtkVoronoiAdjacencyGraph Struct Reference

The adjacency graph, a collection of wheels and spokes, is a topological construct that connects Voronoi hull face neighbors. More...

#include <vtkVoronoiCore.h>

Classes
struct	ValidateAdjacencyGraph
	Threaded perform validity checking. More...

Public Member Functions
void	Initialize (vtkIdType numWheels, vtkIdType numSpokes)
vtkVoronoiWheelsType &	GetWheels ()
vtkVoronoiSpokesType &	GetSpokes ()
vtkIdType	GetNumberOfWheels ()
vtkIdType	GetNumberOfSpokes ()
bool	IsSpoke (vtkIdType pt0, vtkIdType pt1)
vtkIdType	GetNumberOfSpokes (vtkIdType ptId)
vtkVoronoiSpoke *	GetSpokes (vtkIdType ptId, vtkIdType &numSpokes)
vtkIdType	GetWheelOffset (vtkIdType ptId)
bool	Validate ()
	Return true if the graph meets the conditions necessary to form a valid Voronoi tessellation.

Static Public Member Functions
static void	CountFaces (const vtkVoronoiSpoke *spokes, int numSpokes, int &numDomainBoundaryFaces, int &numRegionBoundaryFaces, int &numForwardFaces)

Public Attributes
vtkVoronoiWheelsType	Wheels
vtkVoronoiSpokesType	Spokes

Detailed Description

The adjacency graph, a collection of wheels and spokes, is a topological construct that connects Voronoi hull face neighbors.

Each n-dimensional Voronoi hull is represented by a set of spokes, which correspond to the (n-1) faces of the hull. Spokes are classified, and are a dual construct of the hull faces.

Definition at line 129 of file vtkVoronoiCore.h.

Member Function Documentation

Initialize()

void vtkVoronoiAdjacencyGraph::Initialize	(	vtkIdType	numWheels,
		vtkIdType	numSpokes )

GetWheels()

vtkVoronoiWheelsType & vtkVoronoiAdjacencyGraph::GetWheels ( )

inline

Definition at line 135 of file vtkVoronoiCore.h.

GetSpokes() [1/2]

vtkVoronoiSpokesType & vtkVoronoiAdjacencyGraph::GetSpokes ( )

inline

Definition at line 136 of file vtkVoronoiCore.h.

GetNumberOfWheels()

vtkIdType vtkVoronoiAdjacencyGraph::GetNumberOfWheels ( )

inline

Definition at line 137 of file vtkVoronoiCore.h.

GetNumberOfSpokes() [1/2]

vtkIdType vtkVoronoiAdjacencyGraph::GetNumberOfSpokes ( )

inline

Definition at line 138 of file vtkVoronoiCore.h.

IsSpoke()

bool vtkVoronoiAdjacencyGraph::IsSpoke	(	vtkIdType	pt0,
		vtkIdType	pt1 )

GetNumberOfSpokes() [2/2]

vtkIdType vtkVoronoiAdjacencyGraph::GetNumberOfSpokes

(

vtkIdType

ptId

)

GetSpokes() [2/2]

vtkVoronoiSpoke * vtkVoronoiAdjacencyGraph::GetSpokes	(	vtkIdType	ptId,
		vtkIdType &	numSpokes )

GetWheelOffset()

vtkIdType vtkVoronoiAdjacencyGraph::GetWheelOffset ( vtkIdType ptId )

inline

Definition at line 142 of file vtkVoronoiCore.h.

CountFaces()

static void vtkVoronoiAdjacencyGraph::CountFaces ( const vtkVoronoiSpoke * spokes, int numSpokes, int & numDomainBoundaryFaces, int & numRegionBoundaryFaces, int & numForwardFaces )

static

Validate()

bool vtkVoronoiAdjacencyGraph::Validate

(

)

Return true if the graph meets the conditions necessary to form a valid Voronoi tessellation.

That is, each interior spoke is used exactly twice; each domain boundary edge is used exactly once. Note that this method will classify each invalid spoke as "PRUNED" (which can be used subsequently to repair the tessellation).

Member Data Documentation

Wheels

vtkVoronoiWheelsType vtkVoronoiAdjacencyGraph::Wheels

Definition at line 131 of file vtkVoronoiCore.h.

Spokes

vtkVoronoiSpokesType vtkVoronoiAdjacencyGraph::Spokes

Definition at line 132 of file vtkVoronoiCore.h.

---

The documentation for this struct was generated from the following file:

• Filters/Meshing/vtkVoronoiCore.h