Interface for topological subdivision strategies for hexahedrons. More...

#include <hexsubdiv.hh>

Inheritance diagram for concepts::HexSubdivision:

Collaboration diagram for concepts::HexSubdivision:

Public Member Functions
virtual void	createChildren (Hexahedron &q) const =0
	If no children of q exist, they are created.
virtual void	removeChildren (Hexahedron &q) const =0
	If there are children, they are removed.
Protected Member Functions
bool	faceSubdiv4 (Quad &q) const throw (StrategyChange)
	Takes a face and tries to subdivide it into 4 (by setting the strategy to `QuadSubdiv4`).
Quad *	findFace (const Vertex const v, Quad const q[4], const uint tau, const uint rho, const uint vtxIdx) const
	Looks for the quad in `q` which contains the vertex `v`.
virtual std::ostream &	info (std::ostream &os) const
	Returns information in an output stream.

void	subFace0011 (Quad &q, Z2 rho, Z4 tau, Quad &A, Quad &B) const
	Gets the two children of `q` and sorts them.
void	subFace1100 (Quad &q, Z2 rho, Z4 tau, Quad &A, Quad &B) const
	Gets the two children of `q` and sorts them.
void	subFace0110 (Quad &q, Z2 rho, Z4 tau, Quad &A, Quad &B) const
	Gets the two children of `q` and sorts them.
void	subFace1001 (Quad &q, Z2 rho, Z4 tau, Quad &A, Quad &B) const
	Gets the two children of `q` and sorts them.

void	subFace0123 (Quad &q, Z2 rho, Z4 tau, Quad &A, Quad &B, Quad &C, Quad &D) const
	Gets the four children of `q` and sorts them.
void	subFace1230 (Quad &q, Z2 rho, Z4 tau, Quad &A, Quad &B, Quad &C, Quad &D) const
	Gets the four children of `q` and sorts them.
void	subFace2301 (Quad &q, Z2 rho, Z4 tau, Quad &A, Quad &B, Quad &C, Quad &D) const
	Gets the four children of `q` and sorts them.

void	subdivFace0 (Hexahedron &h, Quad &A, Quad &B, Quad &C, Quad &D, bool normal) const
	Subdivides a face of a hexehedron `h` into 4 children.
void	subdivFace1 (Hexahedron &h, Quad &A, Quad &B, Quad &C, Quad &D, bool normal) const
	Subdivides a face of a hexehedron `h` into 4 children.
void	subdivFace2 (Hexahedron &h, Quad &A, Quad &B, Quad &C, Quad &D, bool normal) const
	Subdivides a face of a hexehedron `h` into 4 children.
void	subdivFace3 (Hexahedron &h, Quad &A, Quad &B, Quad &C, Quad &D, bool normal) const
	Subdivides a face of a hexehedron `h` into 4 children.
void	subdivFace4 (Hexahedron &h, Quad &A, Quad &B, Quad &C, Quad &D, bool normal) const
	Subdivides a face of a hexehedron `h` into 4 children.
void	subdivFace5 (Hexahedron &h, Quad &A, Quad &B, Quad &C, Quad &D, bool normal) const
	Subdivides a face of a hexehedron `h` into 4 children.

Detailed Description

Interface for topological subdivision strategies for hexahedrons.

Every specialization of HexSubdivision should be a singleton whose instance can be get with a call to instance(). It implements the method how the children of a hexahedron are created. To have access to all members of the class Hexahedron, the specializations of HexSubdivision should be friend to Hexahedron.

See also:: Hexahedron

Test:

test::DeadLock1

test::DeadLock2

test::DeadLock3

Author:: Philipp Frauenfelder, 2002

Definition at line 38 of file hexsubdiv.hh.

Member Function Documentation

virtual void concepts::HexSubdivision::createChildren ( Hexahedron & q ) const [pure virtual]

If no children of q exist, they are created.

Implemented in concepts::HexSubdiv8, concepts::HexSubdiv2x, concepts::HexSubdiv2y, concepts::HexSubdiv2z, concepts::HexSubdiv4x, concepts::HexSubdiv4y, and concepts::HexSubdiv4z.

bool concepts::HexSubdivision::faceSubdiv4 ( Quad & q ) const throw (StrategyChange) [protected]

Takes a face and tries to subdivide it into 4 (by setting the strategy to QuadSubdiv4).

Firstly, a normal subdivision in one shot into 4 children is tried. If this fails (by catching a StrategyChange exception), then a previous subdivision into 2 children was executed on this face. The orthogonal subdivision into 2 children is then reserved (by setting the strategy accordingly) on the two children of the face. This can be called a subdivision into 4 children in two shots.

Parameters:

q	Face to be subdivided into 4

Returns:: true if the subdivision in one shot succeeded, false otherwise

Exceptions:

StrategyChange if the subdivision in two shots fails too

Quad* concepts::HexSubdivision::findFace	(	const Vertex *const	v,
		Quad *const	q[4],
		const uint	tau,
		const uint	rho,
		const uint	vtxIdx
	)		const `[protected]`

Looks for the quad in q which contains the vertex v.

This is done by a loop over the four entries of q and checking the indicated vertex (given by the index location vtxIdx).

Parameters:

v	Vertex to look for
q	List of quads to search through
tau	Orientation flags of the quads
rho	Rotation flags of the quads
vtxIdx	Index location of the vertex in the quads counted from vertex 0 in the quad in `rho` = 0 direction

Returns:: the matching quad

virtual std::ostream& concepts::OutputOperator::info ( std::ostream & os ) const [protected, virtual, inherited]

Returns information in an output stream.

virtual void concepts::HexSubdivision::removeChildren ( Hexahedron & q ) const [pure virtual]

If there are children, they are removed.

The additional faces, edges and vertices are removed as well.

Implemented in concepts::HexSubdiv8, concepts::HexSubdiv2x, concepts::HexSubdiv2y, concepts::HexSubdiv2z, concepts::HexSubdiv4x, concepts::HexSubdiv4y, and concepts::HexSubdiv4z.

void concepts::HexSubdivision::subdivFace0	(	Hexahedron &	h,
		Quad *&	A,
		Quad *&	B,
		Quad *&	C,
		Quad *&	D,
		bool	normal
	)		const `[protected]`

Subdivides a face of a hexehedron h into 4 children.