MOERTEL::Overlap Class Reference

A class to compute the overlap polygon of 2 different 2D segments and construct a triangle discretization of the convex hull of that polygon More...

#include <mrtr_overlap.H>

Collaboration diagram for MOERTEL::Overlap:

[legend]List of all members.

Public Member Functions
Constructors and destructors
	Overlap (MOERTEL::Segment &sseg, MOERTEL::Segment &mseg, MOERTEL::Interface &inter, bool exactvalues, int outlevel)
	Constructor.
virtual	~Overlap ()
	Destructor.
Public members
bool	ComputeOverlap ()
	Compute overlap (if any) between 2 segments and construct discretization of overlap region.
int	OutLevel ()
	Return the level of output written to stdout ( 0 - 10 ).
Protected Member Functions
Methods to construct triangulation of overlap region
bool	AddSegment (int id, MOERTEL::Segment *seg)
int	Nseg ()
void	SegmentView (vector< RefCountPtr< MOERTEL::Segment > > &segs)
Methods to construct an overlap polygon
bool	AddPointtoPolygon (const int id, const double *P)
bool	AddPointtoPolygon (map< int, RefCountPtr< MOERTEL::Point > > &p, const int id, const double *P)
bool	RemovePointfromPolygon (const int id, const double *P)
int	SizePointPolygon ()
void	PointView (vector< RefCountPtr< MOERTEL::Point > > &points)
void	PointView (map< int, RefCountPtr< MOERTEL::Point > > &p, vector< RefCountPtr< MOERTEL::Point > > &points)
void	PointView (vector< MOERTEL::Point * > &p, const int *nodeids, const int np)
bool	CopyPointPolygon (map< int, RefCountPtr< MOERTEL::Point > > &from, map< int, RefCountPtr< MOERTEL::Point > > &to)
bool	Centroid (double xi[], const vector< RefCountPtr< MOERTEL::Point > > &points, const int np)
Friends
class	Interface
	the Interface class is a friend to this class
class	Integrator
	the Integrator class is a friend to this class

---

Detailed Description

A class to compute the overlap polygon of 2 different 2D segments and construct a triangle discretization of the convex hull of that polygon

Given a slave and a mortar side segment, this class projects the mortar segment onto the local coordinate system of the slave segment. It will then determine whether an overlap between the slave segment and the projection of the mortar segment exists and computes the polygonal overlap region. In a second step it creates a triangulation of that polygonal overlap region that can be used to perform the integration over that region.

The Interface and the Integrator class are friends to this class to be able to access the resulting triangulation of the overlap polygon.

Author:

Michael W. Gee (mwgee@sandia.gov)

---

Constructor & Destructor Documentation

MOERTEL::Overlap::Overlap (  MOERTEL::Segment &  sseg, MOERTEL::Segment &  mseg, MOERTEL::Interface &  inter, bool  exactvalues, int  outlevel )  [explicit]

Constructor. Constructs an instance of this class. Note that this is not a collective call as overlaps are computed in parallel by individual processes. Parameters: sseg  : slave Segment to overlap with mseg  : mortar Segment to overlap with inter  : Interface both segments are part of outlevel  : Level of output information written to stdout ( 0 - 10 )

---

Member Function Documentation

bool MOERTEL::Overlap::ComputeOverlap (   )

Compute overlap (if any) between 2 segments and construct discretization of overlap region. Returns: true if segments overlap, false otherwise

---

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

• mrtr_overlap.H
• mrtr_convexhull.cpp
• mrtr_overlap.cpp
• mrtr_overlap_utils.cpp

---