#include <QuadSurfMesh.h>

Inheritance diagram for QuadSurfMesh< Basis >:

Classes
struct	Cell

struct	Edge

struct	edgecompare
	Virtual function table. More...

class	ElemData

struct	Face

struct	Node
	Index and Iterator types required for Mesh Concept. More...

class	Synchronize

Public Types
typedef SCIRun::index_type	under_type

typedef SCIRun::index_type	index_type

typedef SCIRun::size_type	size_type

typedef SCIRun::mask_type	mask_type

typedef boost::shared_ptr < QuadSurfMesh< Basis > >	handle_type

typedef Basis	basis_type

typedef Face	Elem

typedef Edge	DElem

Public Types inherited from Mesh
enum	{ UNKNOWN = 0, STRUCTURED = 1 << 1, UNSTRUCTURED = 1 << 2, REGULAR = 1 << 3, IRREGULAR = 1 << 4 }
	These will become obsolete at some point. More...

enum	{ NONE_E = 0, NODES_E = 1 << 0, EDGES_E = 1 << 1, FACES_E = 1 << 2, CELLS_E = 1 << 3, ELEMS_E = 1 << 4, DELEMS_E = 1 << 5, ENODES_E = 1 << 6, ALL_ELEMENTS_E = NODES_E \| EDGES_E \| FACES_E \| CELLS_E \| ENODES_E \| ELEMS_E \| DELEMS_E, NORMALS_E = 1 << 7, NODE_NEIGHBORS_E = 1 << 8, ELEM_NEIGHBORS_E = 1 << 9, NEIGHBORS_E = NODE_NEIGHBORS_E \| ELEM_NEIGHBORS_E, NODE_LOCATE_E = 1 << 10, ELEM_LOCATE_E = 1 << 11, LOCATE_E = NODE_LOCATE_E \| ELEM_LOCATE_E, EPSILON_E = 1 << 12, BOUNDING_BOX_E = 1 << 12, FIND_CLOSEST_NODE_E = 1 << 13, FIND_CLOSEST_ELEM_E = 1 << 14, FIND_CLOSEST_E = FIND_CLOSEST_NODE_E \| FIND_CLOSEST_ELEM_E }
	Synchronize system. More...

Public Types inherited from Datatype
typedef HasIntegerId::id_type	id_type

Public Types inherited from HasId< IdType, IdGenerator >
typedef IdType	id_type

Public Types inherited from MeshTraits< VMesh >
typedef SCIRun::mask_type	mask_type

typedef SCIRun::index_type	under_type

typedef SCIRun::index_type	index_type

typedef SCIRun::index_type	size_type

typedef std::vector< index_type >	array_type

typedef std::vector< size_type >	dimension_type

typedef boost::shared_ptr < MeshFacade< VMesh > >	MeshFacadeHandle

Public Member Functions
	QuadSurfMesh ()
	Construct a new mesh. More...

	QuadSurfMesh (const QuadSurfMesh &copy)
	Copy a mesh, needed for detaching the mesh from a field. More...

virtual QuadSurfMesh *	clone () const

virtual	~QuadSurfMesh ()
	Destructor. More...

MeshFacadeHandle	getFacade () const

virtual VMesh *	vmesh ()
	Access point to virtual interface. More...

virtual int	basis_order ()

virtual int	dimensionality () const
	Topological dimension. More...

virtual int	topology_geometry () const

virtual Core::Geometry::BBox	get_bounding_box () const
	Get the bounding box of the field. More...

virtual void	get_canonical_transform (Core::Geometry::Transform &t) const

virtual void	transform (const Core::Geometry::Transform &t)
	Core::Geometry::Transform a field (transform all nodes using this transformation matrix) More...

virtual bool	is_editable () const
	Check whether mesh can be altered by adding nodes or elements. More...

virtual bool	has_normals () const
	Has this mesh normals. More...

virtual bool	synchronize (mask_type mask)

virtual bool	unsynchronize (mask_type mask)

bool	clear_synchronization ()

Basis &	get_basis ()
	Get the basis class. More...

void	begin (typename Node::iterator &) const
	begin/end iterators More...

void	begin (typename Edge::iterator &) const

void	begin (typename Face::iterator &) const

void	begin (typename Cell::iterator &) const

void	end (typename Node::iterator &) const

void	end (typename Edge::iterator &) const

void	end (typename Face::iterator &) const

void	end (typename Cell::iterator &) const

void	size (typename Node::size_type &) const

void	size (typename Edge::size_type &) const

void	size (typename Face::size_type &) const

void	size (typename Cell::size_type &) const

void	to_index (typename Node::index_type &index, index_type i) const

void	to_index (typename Edge::index_type &index, index_type i) const

void	to_index (typename Face::index_type &index, index_type i) const

void	to_index (typename Cell::index_type &, index_type) const

void	get_nodes (typename Node::array_type &array, typename Node::index_type idx) const
	Get the child elements of the given index. More...

void	get_nodes (typename Node::array_type &array, typename Edge::index_type idx) const

void	get_nodes (typename Node::array_type &array, typename Face::index_type idx) const

void	get_nodes (typename Node::array_type &, typename Cell::index_type) const

void	get_edges (typename Edge::array_type &array, typename Node::index_type idx)

void	get_edges (typename Edge::array_type &array, typename Edge::index_type idx) const

void	get_edges (typename Edge::array_type &array, typename Face::index_type idx) const

void	get_edges (typename Edge::array_type &, typename Cell::index_type) const

void	get_faces (typename Face::array_type &array, typename Node::index_type idx) const

void	get_faces (typename Face::array_type &array, typename Edge::index_type idx) const

void	get_faces (typename Face::array_type &array, typename Face::index_type idx) const

void	get_faces (typename Face::array_type &, typename Cell::index_type) const

void	get_cells (typename Cell::array_type &, typename Node::index_type) const

void	get_cells (typename Cell::array_type &, typename Edge::index_type) const

void	get_cells (typename Cell::array_type &, typename Face::index_type) const

void	get_cells (typename Cell::array_type &, typename Cell::index_type) const

void	get_elems (typename Elem::array_type &array, typename Node::index_type idx) const

void	get_elems (typename Elem::array_type &array, typename Edge::index_type idx) const

void	get_elems (typename Elem::array_type &array, typename Face::index_type idx) const

void	get_elems (typename Face::array_type &, typename Cell::index_type) const

void	get_delems (typename DElem::array_type &array, typename Node::index_type idx) const

void	get_delems (typename DElem::array_type &array, typename Edge::index_type idx) const

void	get_delems (typename DElem::array_type &array, typename Face::index_type idx) const

void	get_delems (typename DElem::array_type &, typename Cell::index_type) const

template<class VECTOR , class INDEX >
void	pwl_approx_edge (std::vector< VECTOR > &coords, INDEX ci, unsigned int which_edge, unsigned int div_per_unit) const

template<class VECTOR , class INDEX >
void	pwl_approx_face (std::vector< std::vector< VECTOR > > &coords, INDEX ci, unsigned int which_face, unsigned int div_per_unit) const

void	get_center (Core::Geometry::Point &result, typename Node::index_type idx) const
	get the center point (in object space) of an element More...

void	get_center (Core::Geometry::Point &result, typename Edge::index_type idx) const

void	get_center (Core::Geometry::Point &result, typename Face::index_type idx) const

void	get_center (Core::Geometry::Point &, typename Cell::index_type) const

double	get_size (typename Node::index_type) const
	Get the size of an element (length, area, volume) More...

double	get_size (typename Edge::index_type idx) const

double	get_size (typename Face::index_type idx) const

double	get_size (typename Cell::index_type) const

double	get_length (typename Edge::index_type idx) const
	More specific names for get_size. More...

double	get_area (typename Face::index_type idx) const

double	get_volume (typename Cell::index_type) const

bool	get_neighbor (typename Elem::index_type &neighbor, typename Elem::index_type elem, typename DElem::index_type delem) const
	Get neighbors of an element or a node. More...

void	get_neighbors (std::vector< typename Node::index_type > &array, typename Node::index_type node)
	These are more general implementations. More...

bool	get_neighbors (std::vector< typename Elem::index_type > &array, typename Elem::index_type elem, typename DElem::index_type delem) const

void	get_neighbors (typename Elem::array_type &array, typename Elem::index_type elem) const

bool	locate (typename Node::index_type &node, const Core::Geometry::Point &p) const
	Locate a point in a mesh, find which is the closest node. More...

bool	locate (typename Edge::index_type &edge, const Core::Geometry::Point &p) const

bool	locate (typename Face::index_type &face, const Core::Geometry::Point &p) const

bool	locate (typename Cell::index_type &, const Core::Geometry::Point &) const

bool	locate (typename Elem::index_type &elem, std::vector< double > &coords, const Core::Geometry::Point &p) const

int	get_weights (const Core::Geometry::Point &p, typename Node::array_type &l, double *w)

int	get_weights (const Core::Geometry::Point &, typename Edge::array_type &, double *)

int	get_weights (const Core::Geometry::Point &p, typename Face::array_type &l, double *w)

int	get_weights (const Core::Geometry::Point &, typename Cell::array_type &, double *)

void	get_point (Core::Geometry::Point &p, typename Node::index_type i) const
	Access the nodes of the mesh. More...

void	set_point (const Core::Geometry::Point &p, typename Node::index_type i)

void	get_random_point (Core::Geometry::Point &, typename Elem::index_type, FieldRNG &rng) const

void	get_normal (Core::Geometry::Vector &n, typename Node::index_type i) const
	Normals for visualizations. More...

template<class VECTOR , class INDEX1 , class INDEX2 >
void	get_normal (Core::Geometry::Vector &result, VECTOR &coords, INDEX1 eidx, INDEX2)
	Get the normals at the outside of the element. More...

Node::index_type	add_point (const Core::Geometry::Point &p)
	Add a new node to the mesh. More...

Node::index_type	add_node (const Core::Geometry::Point &p)

template<class ARRAY >
Elem::index_type	add_elem (ARRAY a)
	Add a new element to the mesh. More...

void	node_reserve (size_type s)

void	elem_reserve (size_type s)

void	resize_nodes (size_type s)

void	resize_elems (size_type s)

template<class VECTOR , class INDEX >
bool	get_coords (VECTOR &coords, const Core::Geometry::Point &p, INDEX idx) const

template<class VECTOR , class INDEX >
void	interpolate (Core::Geometry::Point &pt, const VECTOR &coords, INDEX idx) const

template<class VECTOR1 , class INDEX , class VECTOR2 >
void	derivate (const VECTOR1 &coords, INDEX idx, VECTOR2 &J) const

template<class VECTOR , class INDEX >
double	det_jacobian (const VECTOR &coords, INDEX idx) const

template<class VECTOR , class INDEX >
void	jacobian (const VECTOR &coords, INDEX idx, double *J) const

template<class VECTOR , class INDEX >
double	inverse_jacobian (const VECTOR &coords, INDEX idx, double *Ji) const

template<class INDEX >
double	scaled_jacobian_metric (INDEX idx) const

template<class INDEX >
double	jacobian_metric (INDEX idx) const

template<class INDEX >
double	inscribed_circumscribed_radius_metric (INDEX idx) const

template<class INDEX >
bool	find_closest_node (double &pdist, Core::Geometry::Point &result, INDEX &node, const Core::Geometry::Point &p) const

template<class INDEX >
bool	find_closest_node (double &pdist, Core::Geometry::Point &result, INDEX &node, const Core::Geometry::Point &p, double maxdist) const

template<class ARRAY >
bool	find_closest_nodes (ARRAY &nodes, const Core::Geometry::Point &p, double maxdist) const

template<class ARRAY1 , class ARRAY2 >
bool	find_closest_nodes (ARRAY1 &distances, ARRAY2 &nodes, const Core::Geometry::Point &p, double maxdist) const

template<class INDEX , class ARRAY >
bool	find_closest_elem (double &pdist, Core::Geometry::Point &result, ARRAY &coords, INDEX &elem, const Core::Geometry::Point &p) const

template<class INDEX , class ARRAY >
bool	find_closest_elem (double &pdist, Core::Geometry::Point &result, ARRAY &coords, INDEX &elem, const Core::Geometry::Point &p, double maxdist) const

template<class INDEX , class ARRAY >
bool	find_closest_elem_far_from (double &pdist, Core::Geometry::Point &result, ARRAY &coords, INDEX &face, const Core::Geometry::Point &p, const Core::Geometry::Point &repelpos, double mindistfromrepel, const Core::Geometry::Vector &repelnormal, double mindotfromrepel, double maxdist) const

template<class INDEX >
bool	find_closest_elem (double &pdist, Core::Geometry::Point &result, INDEX &elem, const Core::Geometry::Point &p) const

template<class ARRAY >
bool	find_closest_elems (double &pdist, Core::Geometry::Point &result, ARRAY &elems, const Core::Geometry::Point &p) const

double	get_epsilon () const

virtual void	io (Piostream &)
	Export this class using the old Pio system. More...

virtual std::string	dynamic_type_name () const

virtual const TypeDescription *	get_type_description () const

template<class INDEX >
bool	inside (INDEX idx, const Core::Geometry::Point &p) const

Node::index_type	add_find_point (const Core::Geometry::Point &p, double err=1.0e-3)

Elem::index_type	add_quad (typename Node::index_type a, typename Node::index_type b, typename Node::index_type c, typename Node::index_type d)

Elem::index_type	add_quad (const Core::Geometry::Point &p0, const Core::Geometry::Point &p1, const Core::Geometry::Point &p2, const Core::Geometry::Point &p3)

Public Member Functions inherited from Mesh
	Mesh ()

	Mesh (const Mesh &copy)

virtual	~Mesh ()

Public Member Functions inherited from Datatype
	Datatype ()

virtual	~Datatype ()

	Datatype (const Datatype &other)

Datatype &	operator= (const Datatype &rhs)

template<typename T >
const T *	as () const

Public Member Functions inherited from Persistent
virtual	~Persistent ()

Public Member Functions inherited from HasId< IdType, IdGenerator >
	HasId ()

IdType	id () const

Static Public Member Functions
static const std::string	type_name (int n=-1)
	Core functionality for getting the name of a templated mesh class. More...

static const TypeDescription *	node_type_description ()

static const TypeDescription *	edge_type_description ()

static const TypeDescription *	face_type_description ()

static const TypeDescription *	cell_type_description ()

static const TypeDescription *	elem_type_description ()

static Persistent *	maker ()
	This function returns a maker for Pio. More...

static MeshHandle	mesh_maker ()
	This function returns a handle for the virtual interface. More...

Static Public Member Functions inherited from Mesh
static const std::string	type_name (int n=-1)

Static Public Member Functions inherited from Persistent
static PersistentTypeIDPtr	find_derived (const std::string &classname, const std::string &basename)

static bool	is_base_of (const std::string &parent, const std::string &type)

static void	add_class (const std::string &type, const std::string &parent, Persistent (maker)(), Persistent (bc_maker1)()=0, Persistent (bc_maker2)()=0)

static void	add_mesh_class (const std::string &type, Persistent (maker)(), Persistent (bc_maker1)()=0, Persistent (bc_maker2)()=0)

static void	add_field_class (const std::string &type, Persistent (maker)(), Persistent (bc_maker1)()=0, Persistent (bc_maker2)()=0)

Static Public Attributes
static PersistentTypeID	quadsurfmesh_typeid
	This ID is created as soon as this class will be instantiated. More...

Static Public Attributes inherited from Mesh
static PersistentTypeID	type_id

Protected Types
typedef std::vector < std::vector< typename Elem::index_type > >	NodeNeighborMap

Protected Member Functions
template<class ARRAY , class INDEX >
void	get_nodes_from_edge (ARRAY &array, INDEX i) const

template<class ARRAY , class INDEX >
void	get_nodes_from_face (ARRAY &array, INDEX idx) const

template<class ARRAY , class INDEX >
void	get_nodes_from_elem (ARRAY &array, INDEX idx) const

template<class ARRAY , class INDEX >
void	get_edges_from_face (ARRAY &array, INDEX idx) const

template<class ARRAY , class INDEX >
void	get_edges_from_elem (ARRAY &array, INDEX idx) const

template<class ARRAY , class INDEX >
void	get_faces_from_node (ARRAY &array, INDEX idx) const

template<class ARRAY , class INDEX >
void	get_faces_from_edge (ARRAY &array, INDEX idx) const

template<class ARRAY , class INDEX >
void	get_edges_from_node (ARRAY &array, INDEX idx) const

template<class ARRAY , class INDEX >
void	set_nodes_by_elem (ARRAY &array, INDEX idx)

template<class INDEX1 , class INDEX2 >
bool	get_elem_neighbor (INDEX1 &neighbor, INDEX1 elem, INDEX2 delem) const

template<class ARRAY , class INDEX1 , class INDEX2 >
bool	get_elem_neighbors (ARRAY &array, INDEX1 elem, INDEX2 delem) const

template<class ARRAY , class INDEX >
void	get_elem_neighbors (ARRAY &array, INDEX idx) const

template<class ARRAY , class INDEX >
void	get_node_neighbors (ARRAY &array, INDEX idx) const

template<class INDEX >
bool	locate_node (INDEX &node, const Core::Geometry::Point &p) const

template<class INDEX >
bool	locate_edge (INDEX &loc, const Core::Geometry::Point &p) const
	This is currently implemented as an exhaustive search. More...

template<class INDEX >
bool	locate_elem (INDEX &elem, const Core::Geometry::Point &p) const

template<class ARRAY >
bool	locate_elems (ARRAY &array, const Core::Geometry::BBox &b) const

template<class INDEX , class ARRAY >
bool	locate_elem (INDEX &elem, ARRAY &coords, const Core::Geometry::Point &p) const

template<class INDEX >
void	get_node_center (Core::Geometry::Point &p, INDEX idx) const

template<class INDEX >
void	get_edge_center (Core::Geometry::Point &result, INDEX idx) const

template<class INDEX >
void	get_face_center (Core::Geometry::Point &p, INDEX idx) const

const Core::Geometry::Point &	point (typename Node::index_type i) const

void	compute_edges ()

void	compute_normals ()

void	compute_node_neighbors ()

void	compute_node_grid ()

void	compute_elem_grid ()

void	compute_bounding_box ()

void	insert_elem_into_grid (typename Elem::index_type ci)
	Used to recompute data for individual cells. More...

void	remove_elem_from_grid (typename Elem::index_type ci)

void	insert_node_into_grid (typename Node::index_type ci)

void	remove_node_from_grid (typename Node::index_type ci)

template<class NODE >
bool	order_face_nodes (NODE &n1, NODE &n2, NODE &n3, NODE &n4) const

index_type	next (index_type i)

index_type	prev (index_type i)

Protected Attributes
std::vector < Core::Geometry::Point >	points_
	array with all the points More...

std::vector< index_type >	faces_
	array with the four nodes that make up a face More...

std::vector< std::vector < index_type > >	edges_

std::vector< index_type >	halfedge_to_edge_

NodeNeighborMap	node_neighbors_

std::vector < Core::Geometry::Vector >	normals_

boost::shared_ptr< SearchGridT < index_type > >	node_grid_
	normalized per node More...

boost::shared_ptr< SearchGridT < index_type > >	elem_grid_
	Lookup grid for nodes. More...

Core::Thread::Mutex	synchronize_lock_
	Lookup grid for elements. More...

Core::Thread::ConditionVariable	synchronize_cond_

mask_type	synchronized_

mask_type	synchronizing_

Basis	basis_

Core::Geometry::BBox	bbox_
	Basis for interpolation. More...

double	epsilon_

double	epsilon2_
	epsilon for calculations 1e-8*diagonal bounding box More...

boost::shared_ptr< VMesh >	vmesh_
	square of epsilon for squared distance comparisons More...

Friends
template<class MESH >
class	VQuadSurfMesh
	Make sure the virtual interface has access. More...

template<class MESH >
class	VMeshShared

template<class MESH >
class	VUnstructuredMesh

class	ElemData

class	Synchronize

Member Typedef Documentation

typedef Basis basis_type

typedef Edge DElem

typedef Face Elem

Elem refers to the most complex topological object DElem refers to object just below Elem in the topological hierarchy

typedef boost::shared_ptr<QuadSurfMesh<Basis> > handle_type

typedef SCIRun::index_type index_type

typedef SCIRun::mask_type mask_type

typedef std::vector<std::vector<typename Elem::index_type> > NodeNeighborMap

protected

typedef SCIRun::size_type size_type

typedef SCIRun::index_type under_type

Constructor & Destructor Documentation

QuadSurfMesh ( )

Construct a new mesh.

Initialize the virtual interface when the mesh is created

QuadSurfMesh ( const QuadSurfMesh< Basis > & copy )

Copy a mesh, needed for detaching the mesh from a field.

We need to lock before we can copy these as these structures are generate dynamically when they are needed.

Create a new virtual interface for this copy all pointers have changed hence create a new virtual interface class

~QuadSurfMesh ( )

virtual

Destructor.

Member Function Documentation

Elem::index_type add_elem ( ARRAY a )

inline

Add a new element to the mesh.

QuadSurfMesh< Basis >::Node::index_type add_find_point	(	const Core::Geometry::Point &	p,
		double	err = `1.0e-3`
	)

Node::index_type add_node ( const Core::Geometry::Point & p )

inline

QuadSurfMesh< Basis >::Node::index_type add_point ( const Core::Geometry::Point & p )

Add a new node to the mesh.

QuadSurfMesh< Basis >::Elem::index_type add_quad	(	typename Node::index_type	a,
		typename Node::index_type	b,
		typename Node::index_type	c,
		typename Node::index_type	d
	)

QuadSurfMesh< Basis >::Elem::index_type add_quad	(	const Core::Geometry::Point &	p0,
		const Core::Geometry::Point &	p1,
		const Core::Geometry::Point &	p2,
		const Core::Geometry::Point &	p3
	)

virtual int basis_order ( )

inlinevirtual

This one should go at some point, should be reroute through the virtual interface

Reimplemented from Mesh.

void begin ( typename Node::iterator & itr ) const

begin/end iterators

void begin ( typename Edge::iterator & itr ) const

void begin ( typename Face::iterator & itr ) const

void begin ( typename Cell::iterator & itr ) const

const TypeDescription * cell_type_description ( )

static

bool clear_synchronization ( )

virtual QuadSurfMesh* clone ( ) const

inlinevirtual

Clone function for detaching the mesh and automatically generating a new version if needed.

Implements Mesh.

void compute_bounding_box ( )

protected

void compute_edges ( )

protected

void compute_elem_grid ( )

protected

void compute_node_grid ( )

protected

void compute_node_neighbors ( )

protected

void compute_normals ( )

protected

face normals (not normalized) so that magnitude is also the area.

void derivate	(	const VECTOR1 &	coords,
		INDEX	idx,
		VECTOR2 &	J
	)		const

inline

Interpolate the derivate of the function, This infact will return the jacobian of the local to global coordinate transformation. This function is mainly intended for the non linear elements

double det_jacobian	(	const VECTOR &	coords,
		INDEX	idx
	)		const

inline

Get the determinant of the jacobian, which is the local volume of an element and is intended to help with the integration of functions over an element.

virtual int dimensionality ( ) const

inlinevirtual

Topological dimension.

virtual std::string dynamic_type_name ( ) const

inlinevirtual

const TypeDescription * edge_type_description ( )

static

void elem_reserve ( size_type s )

inline

static const TypeDescription* elem_type_description ( )

inlinestatic

void end ( typename Node::iterator & itr ) const

void end ( typename Edge::iterator & itr ) const

void end ( typename Face::iterator & itr ) const

void end ( typename Cell::iterator & itr ) const

const TypeDescription * face_type_description ( )

static

bool find_closest_elem	(	double &	pdist,
		Core::Geometry::Point &	result,
		ARRAY &	coords,
		INDEX &	elem,
		const Core::Geometry::Point &	p
	)		const

inline

This function will find the closest element and the location on that element that is the closest

bool find_closest_elem	(	double &	pdist,
		Core::Geometry::Point &	result,
		ARRAY &	coords,
		INDEX &	elem,
		const Core::Geometry::Point &	p,
		double	maxdist
	)		const

inline

If there are no nodes we cannot find the closest one

Test the one in face that is an initial guess

As we computed an estimate, we use the Newton's method in the basis functions compute a more refined solution. This function may slow down computation. This piece of code will calculate the coordinates in the local element framework (the newton's method of finding a minimum), then it will project this back THIS CODE SHOULD BE FURTHER OPTIMIZED

This looks incorrect - but it is correct We need to do a full shell without any elements that are closer to make sure there no closer elements in neighboring searchgrid cells

As we computed an estimate, we use the Newton's method in the basis functions compute a more refined solution. This function may slow down computation. This piece of code will calculate the coordinates in the local element framework (the newton's method of finding a minimum), then it will project this back THIS CODE SHOULD BE FURTHER OPTIMIZED

bool find_closest_elem	(	double &	pdist,
		Core::Geometry::Point &	result,
		INDEX &	elem,
		const Core::Geometry::Point &	p
	)		const

inline

bool find_closest_elem_far_from	(	double &	pdist,
		Core::Geometry::Point &	result,
		ARRAY &	coords,
		INDEX &	face,
		const Core::Geometry::Point &	p,
		const Core::Geometry::Point &	repelpos,
		double	mindistfromrepel,
		const Core::Geometry::Vector &	repelnormal,
		double	mindotfromrepel,
		double	maxdist
	)		const

inline

This function will find the closest element and the location on that element that is the closest; it takes an additional repelpos argument which defines an exclusion zone that's not considered. A repelnormal can also be specified in order to restrict the faces to those that are pointing in a different direction from the repel point.

If there are no nodes we cannot find the closest one

We need to do a full shell without any elements that are closer to make sure there no closer elements in neighboring searchgrid cells

As we computed an estimate, we use the Newton's method in the basis functions compute a more refined solution. This function may slow down computation. This piece of code will calculate the coordinates in the local element framework (the newton's method of finding a minimum), then it will project this back THIS CODE SHOULD BE FURTHER OPTIMIZED

bool find_closest_elems	(	double &	pdist,
		Core::Geometry::Point &	result,
		ARRAY &	elems,
		const Core::Geometry::Point &	p
	)		const

inline

If there are no nodes we cannot find the closest one

This looks incorrect - but it is correct We need to do a full shell without any elements that are closer to make sure there no closer elements

bool find_closest_node	(	double &	pdist,
		Core::Geometry::Point &	result,
		INDEX &	node,
		const Core::Geometry::Point &	p
	)		const

inline

bool find_closest_node	(	double &	pdist,
		Core::Geometry::Point &	result,
		INDEX &	node,
		const Core::Geometry::Point &	p,
		double	maxdist
	)		const

inline

If there are no nodes we cannot find the closest one

This looks incorrect - but it is correct We need to do a full shell without any elements that are closer to make sure there no closer elements in neighboring searchgrid cells

If we are closer than eps^2 we found a node close enough

bool find_closest_nodes	(	ARRAY &	nodes,
		const Core::Geometry::Point &	p,
		double	maxdist
	)		const

inline

bool find_closest_nodes	(	ARRAY1 &	distances,
		ARRAY2 &	nodes,
		const Core::Geometry::Point &	p,
		double	maxdist
	)		const

inline

double get_area ( typename Face::index_type idx ) const

inline

Basis& get_basis ( )

inline

Get the basis class.

Core::Geometry::BBox get_bounding_box ( ) const

virtual

Get the bounding box of the field.

void get_canonical_transform ( Core::Geometry::Transform & t ) const

virtual

Return the transformation that takes a 0-1 space bounding box to the current bounding box of this mesh.

void get_cells	(	typename Cell::array_type &	,
		typename Node::index_type
	)		const

inline

void get_cells	(	typename Cell::array_type &	,
		typename Edge::index_type
	)		const

inline

void get_cells	(	typename Cell::array_type &	,
		typename Face::index_type
	)		const

inline

void get_cells	(	typename Cell::array_type &	,
		typename Cell::index_type
	)		const

inline

void get_center	(	Core::Geometry::Point &	result,
		typename Node::index_type	idx
	)		const

inline

get the center point (in object space) of an element

void get_center	(	Core::Geometry::Point &	result,
		typename Edge::index_type	idx
	)		const

inline

void get_center	(	Core::Geometry::Point &	result,
		typename Face::index_type	idx
	)		const

inline

void get_center	(	Core::Geometry::Point &	,
		typename Cell::index_type
	)		const

inline

bool get_coords	(	VECTOR &	coords,
		const Core::Geometry::Point &	p,
		INDEX	idx
	)		const

inline

Get the local coordinates for a certain point within an element This function uses a couple of newton iterations to find the local coordinate of a point

void get_delems	(	typename DElem::array_type &	array,
		typename Node::index_type	idx
	)		const

inline

void get_delems	(	typename DElem::array_type &	array,
		typename Edge::index_type	idx
	)		const

inline

void get_delems	(	typename DElem::array_type &	array,
		typename Face::index_type	idx
	)		const

inline

void get_delems	(	typename DElem::array_type &	,
		typename Cell::index_type
	)		const

inline

void get_edge_center	(	Core::Geometry::Point &	result,
		INDEX	idx
	)		const

inlineprotected

void get_edges	(	typename Edge::array_type &	array,
		typename Node::index_type	idx
	)

inline

void get_edges	(	typename Edge::array_type &	array,
		typename Edge::index_type	idx
	)		const

inline

void get_edges	(	typename Edge::array_type &	array,
		typename Face::index_type	idx
	)		const

inline

void get_edges	(	typename Edge::array_type &	,
		typename Cell::index_type
	)		const

inline

void get_edges_from_elem	(	ARRAY &	array,
		INDEX	idx
	)		const

inlineprotected

void get_edges_from_face	(	ARRAY &	array,
		INDEX	idx
	)		const

inlineprotected

void get_edges_from_node	(	ARRAY &	array,
		INDEX	idx
	)		const

inlineprotected

bool get_elem_neighbor	(	INDEX1 &	neighbor,
		INDEX1	elem,
		INDEX2	delem
	)		const

inlineprotected

This function has been rewritten to allow for non manifold surfaces to be handled ok.

bool get_elem_neighbors	(	ARRAY &	array,
		INDEX1	elem,
		INDEX2	delem
	)		const

inlineprotected

void get_elem_neighbors	(	ARRAY &	array,
		INDEX	idx
	)		const

inlineprotected

void get_elems	(	typename Elem::array_type &	array,
		typename Node::index_type	idx
	)		const

inline

void get_elems	(	typename Elem::array_type &	array,
		typename Edge::index_type	idx
	)		const

inline

void get_elems	(	typename Elem::array_type &	array,
		typename Face::index_type	idx
	)		const

inline

void get_elems	(	typename Face::array_type &	,
		typename Cell::index_type
	)		const

inline

double get_epsilon ( ) const

inline

void get_face_center	(	Core::Geometry::Point &	p,
		INDEX	idx
	)		const

inlineprotected

void get_faces	(	typename Face::array_type &	array,
		typename Node::index_type	idx
	)		const

inline

void get_faces	(	typename Face::array_type &	array,
		typename Edge::index_type	idx
	)		const

inline

void get_faces	(	typename Face::array_type &	array,
		typename Face::index_type	idx
	)		const

inline

void get_faces	(	typename Face::array_type &	,
		typename Cell::index_type
	)		const

inline

void get_faces_from_edge	(	ARRAY &	array,
		INDEX	idx
	)		const

inlineprotected

void get_faces_from_node	(	ARRAY &	array,
		INDEX	idx
	)		const

inlineprotected

double get_length ( typename Edge::index_type idx ) const

inline

More specific names for get_size.

bool get_neighbor	(	typename Elem::index_type &	neighbor,
		typename Elem::index_type	elem,
		typename DElem::index_type	delem
	)		const

inline

Get neighbors of an element or a node.

THIS ONE IS FLAWED AS IN 3D SPACE MULTIPLE EDGES CAN CONNECTED THROUGH ONE EDGE

void get_neighbors	(	std::vector< typename Node::index_type > &	array,
		typename Node::index_type	node
	)

inline

These are more general implementations.

bool get_neighbors	(	std::vector< typename Elem::index_type > &	array,
		typename Elem::index_type	elem,
		typename DElem::index_type	delem
	)		const

inline

void get_neighbors	(	typename Elem::array_type &	array,
		typename Elem::index_type	elem
	)		const

inline

void get_node_center	(	Core::Geometry::Point &	p,
		INDEX	idx
	)		const

inlineprotected

void get_node_neighbors	(	ARRAY &	array,
		INDEX	idx
	)		const

inlineprotected

void get_nodes	(	typename Node::array_type &	array,
		typename Node::index_type	idx
	)		const

inline

Get the child elements of the given index.

void get_nodes	(	typename Node::array_type &	array,
		typename Edge::index_type	idx
	)		const

inline

void get_nodes	(	typename Node::array_type &	array,
		typename Face::index_type	idx
	)		const

inline

void get_nodes	(	typename Node::array_type &	,
		typename Cell::index_type
	)		const

inline

void get_nodes_from_edge	(	ARRAY &	array,
		INDEX	i
	)		const

inlineprotected

void get_nodes_from_elem	(	ARRAY &	array,
		INDEX	idx
	)		const

inlineprotected

void get_nodes_from_face	(	ARRAY &	array,
		INDEX	idx
	)		const

inlineprotected

void get_normal	(	Core::Geometry::Vector &	n,
		typename Node::index_type	i
	)		const

inline

Normals for visualizations.

void get_normal	(	Core::Geometry::Vector &	result,
		VECTOR &	coords,
		INDEX1	eidx,
		INDEX2
	)

inline

Get the normals at the outside of the element.

void get_point	(	Core::Geometry::Point &	p,
		typename Node::index_type	i
	)		const

inline

Access the nodes of the mesh.

void get_random_point	(	Core::Geometry::Point &	p,
		typename Elem::index_type	ei,
		FieldRNG &	rng
	)		const

double get_size ( typename Node::index_type ) const

inline

Get the size of an element (length, area, volume)

double get_size ( typename Edge::index_type idx ) const

inline

double get_size ( typename Face::index_type idx ) const

inline

double get_size ( typename Cell::index_type ) const

inline

const TypeDescription * get_type_description ( ) const

virtual

Type description, used for finding names of the mesh class for dynamic compilation purposes. Some of this should be obsolete

Implements Mesh.

double get_volume ( typename Cell::index_type ) const

inline

int get_weights	(	const Core::Geometry::Point &	p,
		typename Node::array_type &	l,
		double *	w
	)

These should become obsolete soon, they do not follow the concept of the basis functions....

int get_weights	(	const Core::Geometry::Point &	p,
		typename Edge::array_type &	l,
		double *	w
	)

inline

int get_weights	(	const Core::Geometry::Point &	p,
		typename Face::array_type &	l,
		double *	w
	)

int get_weights	(	const Core::Geometry::Point &	,
		typename Cell::array_type &	,
		double *
	)

inline

MeshFacadeHandle getFacade ( ) const

inlinevirtual

Implements Mesh.

virtual bool has_normals ( ) const

inlinevirtual

Has this mesh normals.

Todo:: : this is inconsistent with TriSurfMesh - should both surfaces

double inscribed_circumscribed_radius_metric ( INDEX idx ) const

inline

void insert_elem_into_grid ( typename Elem::index_type ci )

protected

Used to recompute data for individual cells.

Todo:: : This can crash if you insert a new cell outside of the grid.

void insert_node_into_grid ( typename Node::index_type ci )

protected

Todo:: : This can crash if you insert a new cell outside of the grid.

bool inside	(	INDEX	idx,
		const Core::Geometry::Point &	p
	)		const

inline

void interpolate	(	Core::Geometry::Point &	pt,
		const VECTOR &	coords,
		INDEX	idx
	)		const

inline

Find the location in the global coordinate system for a local coordinate This function is the opposite of get_coords.

double inverse_jacobian	(	const VECTOR &	coords,
		INDEX	idx,
		double *	Ji
	)		const

inline

Get the inverse jacobian of the transformation. This one is needed to translate local gradients into global gradients. Hence it is crucial for calculating gradients of fields, or constructing finite elements.

void io ( Piostream & stream )

virtual

Export this class using the old Pio system.

Reimplemented from Mesh.

virtual bool is_editable ( ) const

inlinevirtual

Check whether mesh can be altered by adding nodes or elements.

void jacobian	(	const VECTOR &	coords,
		INDEX	idx,
		double *	J
	)		const

inline

Get the jacobian of the transformation. In case one wants the non inverted version of this matrix. This is currently here for completeness of the interface

double jacobian_metric ( INDEX idx ) const

inline

bool locate	(	typename Node::index_type &	node,
		const Core::Geometry::Point &	p
	)		const

inline

Locate a point in a mesh, find which is the closest node.

bool locate	(	typename Edge::index_type &	edge,
		const Core::Geometry::Point &	p
	)		const

inline

bool locate	(	typename Face::index_type &	face,
		const Core::Geometry::Point &	p
	)		const

inline

bool locate	(	typename Cell::index_type &	,
		const Core::Geometry::Point &
	)		const

inline

bool locate	(	typename Elem::index_type &	elem,
		std::vector< double > &	coords,
		const Core::Geometry::Point &	p
	)		const

inline

bool locate_edge	(	INDEX &	loc,
		const Core::Geometry::Point &	p
	)		const

inlineprotected

This is currently implemented as an exhaustive search.

bool locate_elem	(	INDEX &	elem,
		const Core::Geometry::Point &	p
	)		const

inlineprotected

If there are no nodes we cannot find a closest point

Check whether the estimate given in idx is the point we are looking for

bool locate_elem	(	INDEX &	elem,
		ARRAY &	coords,
		const Core::Geometry::Point &	p
	)		const

inlineprotected

If there are no nodes we cannot find a closest point

Check whether the estimate given in idx is the point we are looking for

bool locate_elems	(	ARRAY &	array,
		const Core::Geometry::BBox &	b
	)		const

inlineprotected

bool locate_node	(	INDEX &	node,
		const Core::Geometry::Point &	p
	)		const

inlineprotected

If there are no nodes we cannot find a closest point

Check first guess

This looks incorrect - but it is correct We need to do a full shell without any elements that are closer to make sure there no closer elements in neighboring searchgrid cells

static Persistent* maker ( )

inlinestatic

This function returns a maker for Pio.

static MeshHandle mesh_maker ( )

inlinestatic

This function returns a handle for the virtual interface.

index_type next ( index_type i )

inlineprotected

void node_reserve ( size_type s )

inline

const TypeDescription * node_type_description ( )

static

bool order_face_nodes	(	NODE &	n1,
		NODE &	n2,
		NODE &	n3,
		NODE &	n4
	)		const

inlineprotected

const Core::Geometry::Point& point ( typename Node::index_type i ) const

inlineprotected

index_type prev ( index_type i )

inlineprotected

void pwl_approx_edge	(	std::vector< VECTOR > &	coords,
		INDEX	ci,
		unsigned int	which_edge,
		unsigned int	div_per_unit
	)		const

inline

Generate the list of points that make up a sufficiently accurate piecewise linear approximation of an edge.

void pwl_approx_face	(	std::vector< std::vector< VECTOR > > &	coords,
		INDEX	ci,
		unsigned int	which_face,
		unsigned int	div_per_unit
	)		const

inline

Generate the list of points that make up a sufficiently accurate piecewise linear approximation of an face.

void remove_elem_from_grid ( typename Elem::index_type ci )

protected

void remove_node_from_grid ( typename Node::index_type ci )

protected

void resize_elems ( size_type s )

inline

void resize_nodes ( size_type s )

inline

double scaled_jacobian_metric ( INDEX idx ) const

inline

void set_nodes_by_elem	(	ARRAY &	array,
		INDEX	idx
	)

inlineprotected

void set_point	(	const Core::Geometry::Point &	p,
		typename Node::index_type	i
	)

inline

void size ( typename Node::size_type & s ) const

void size ( typename Edge::size_type & s ) const

void size ( typename Face::size_type & s ) const

void size ( typename Cell::size_type & s ) const

bool synchronize ( mask_type mask )

virtual

Compute tables for doing topology, these need to be synchronized before doing a lot of operations.

Reimplemented from Mesh.

void to_index	(	typename Node::index_type &	index,
		index_type	i
	)		const

inline

These are here to convert indices to unsigned int counters. Some how the decision was made to use multi dimensional indices in some fields, these functions should deal with different pointer types. Use the virtual interface to avoid all this non sense.

void to_index	(	typename Edge::index_type &	index,
		index_type	i
	)		const

inline

void to_index	(	typename Face::index_type &	index,
		index_type	i
	)		const

inline

void to_index	(	typename Cell::index_type &	,
		index_type
	)		const

inline

virtual int topology_geometry ( ) const

inlinevirtual

What kind of mesh is this structured = no connectivity data regular = no node location data

void transform ( const Core::Geometry::Transform & t )

virtual

Core::Geometry::Transform a field (transform all nodes using this transformation matrix)

const std::string type_name ( int n = -1 )

static

Core functionality for getting the name of a templated mesh class.

bool unsynchronize ( mask_type mask )

virtual

Reimplemented from Mesh.

virtual VMesh* vmesh ( )

inlinevirtual

Access point to virtual interface.

Reimplemented from Mesh.

Friends And Related Function Documentation

friend class ElemData

friend

Somehow the information of how to interpolate inside an element ended up in a separate class, as they need to share information this construction was created to transfer data. Hopefully in the future this class will disappear again.

friend class Synchronize

friend

friend class VMeshShared

friend

friend class VQuadSurfMesh

friend

Make sure the virtual interface has access.

friend class VUnstructuredMesh

friend

Member Data Documentation

Basis basis_

protected

Core::Geometry::BBox bbox_

protected

Basis for interpolation.

std::vector<std::vector<index_type> > edges_

protected

FOR EDGE -> NODES array with information from edge number (unique ones) to the node numbers this one refers to the first node

boost::shared_ptr<SearchGridT<index_type> > elem_grid_

protected

Lookup grid for nodes.

double epsilon2_

protected

epsilon for calculations 1e-8*diagonal bounding box

double epsilon_

protected

std::vector<index_type> faces_

protected

array with the four nodes that make up a face

std::vector<index_type> halfedge_to_edge_

protected

FOR FACES -> EDGE NUMBER array with information from halfedge (computed directly from face) to the edge number

boost::shared_ptr<SearchGridT<index_type> > node_grid_

protected

normalized per node

NodeNeighborMap node_neighbors_

protected

std::vector<Core::Geometry::Vector> normals_

protected

std::vector<Core::Geometry::Point> points_

protected

array with all the points

PersistentTypeID quadsurfmesh_typeid

static

This ID is created as soon as this class will be instantiated.

Core::Thread::ConditionVariable synchronize_cond_

protected

Core::Thread::Mutex synchronize_lock_

mutableprotected

Lookup grid for elements.

mask_type synchronized_

protected

mask_type synchronizing_

protected

boost::shared_ptr<VMesh> vmesh_

protected

square of epsilon for squared distance comparisons

Pointer to virtual interface

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

Core/Datatypes/Legacy/Field/QuadSurfMesh.h

Classes

Public Types

Public Member Functions

Static Public Member Functions

Static Public Attributes

Protected Types

Protected Member Functions

Protected Attributes

Friends

Member Typedef Documentation

Constructor & Destructor Documentation

Member Function Documentation

Friends And Related Function Documentation

Member Data Documentation