Cavity Class Reference

#include <Cavity.h>

List of all members.

Public Types
typedef std::vector< GNode, PerIterGNodeAlloc >	GNodeVector
Public Member Functions
	Cavity (Graph *g, Galois::PerIterAllocTy &cnx)
void	initialize (GNode node)
void	build ()
void	update ()
	Create the new cavity based on the data of the old one.
Subgraph &	getPre ()
Subgraph &	getPost ()
bool	isMember (Element *n)
	Cavity (Graph *g, GNode &n, Tuple &t, Galois::PerIterAllocTy &cnx)
void	build ()
void	update (GNodeVector *newNodes)
Private Types
typedef std::vector < Subgraph::tmpEdge, Galois::PerIterAllocTy::rebind < Subgraph::tmpEdge >::other >	connTy
typedef Galois::PerIterAllocTy::rebind < GNode >::other	PerIterGNodeAlloc
typedef std::set< GNode, std::less< GNode > , PerIterGNodeAlloc >	GNodeSet
typedef std::deque< GNode, PerIterGNodeAlloc >	GNodeDeque
Private Member Functions
GNode	getOpposite (GNode node)
	find the node that is opposite the obtuse angle of the element
void	expand (GNode node, GNode next)
Private Attributes
Tuple	center
GNode	centerNode
Element *	centerElement
int	dim
std::vector< GNode, Galois::PerIterAllocTy::rebind < GNode >::other >	frontier
Subgraph	pre
Subgraph	post
connTy	connections
Graph *	graph
GNodeSet	oldNodes
GNodeSet	deletingNodes
GNode	node
Tuple	tuple
Galois::PerIterAllocTy &	_cnx

---

Member Typedef Documentation

typedef std::vector<Subgraph::tmpEdge,Galois::PerIterAllocTy::rebind<Subgraph::tmpEdge>::other> Cavity::connTy [private]

typedef std::deque<GNode, PerIterGNodeAlloc> Cavity::GNodeDeque [private]

typedef std::set<GNode, std::less<GNode>, PerIterGNodeAlloc> Cavity::GNodeSet [private]

typedef std::vector<GNode, PerIterGNodeAlloc> Cavity::GNodeVector

typedef Galois::PerIterAllocTy::rebind<GNode>::other Cavity::PerIterGNodeAlloc [private]

---

Constructor & Destructor Documentation

Cavity::Cavity	(	Graph *	g,
		Galois::PerIterAllocTy &	cnx
	)			[inline]

Cavity::Cavity	(	Graph *	g,
		GNode &	n,
		Tuple &	t,
		Galois::PerIterAllocTy &	cnx
	)			[inline]

---

Member Function Documentation

void Cavity::build

(

)

[inline]

void Cavity::build

(

)

[inline]

void Cavity::expand	(	GNode	node,
		GNode	next
	)			[inline, private]

GNode Cavity::getOpposite

(

GNode

node

)

[inline, private]

find the node that is opposite the obtuse angle of the element

Subgraph& Cavity::getPost

(

)

[inline]

Subgraph& Cavity::getPre

(

)

[inline]

void Cavity::initialize

(

GNode

node

)

[inline]

bool Cavity::isMember

(

Element *

n

)

void Cavity::update

(

GNodeVector *

newNodes

)

[inline]

void Cavity::update

(

)

[inline]

Create the new cavity based on the data of the old one.

---

Member Data Documentation

Galois::PerIterAllocTy& Cavity::_cnx [private]

Tuple Cavity::center [private]

Element* Cavity::centerElement [private]

GNode Cavity::centerNode [private]

connTy Cavity::connections [private]

GNodeSet Cavity::deletingNodes [private]

int Cavity::dim [private]

std::vector<GNode,Galois::PerIterAllocTy::rebind<GNode>::other> Cavity::frontier [private]

Graph * Cavity::graph [private]

GNode Cavity::node [private]

GNodeSet Cavity::oldNodes [private]

Subgraph Cavity::post [private]

Subgraph Cavity::pre [private]

Tuple Cavity::tuple [private]

---

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

• delaunayrefinement/Cavity.h
• delaunaytriangulation/Cavity.h