p2t::Triangle Class Reference

#include <shapes.h>

Public Member Functions
	Triangle (Point &a, Point &b, Point &c)
	Constructor. More...
Point *	GetPoint (const int &index)
Point *	PointCW (Point &point)
Point *	PointCCW (Point &point)
Point *	OppositePoint (Triangle &t, Point &p)
Triangle *	GetNeighbor (const int &index)
void	MarkNeighbor (Point *p1, Point *p2, Triangle *t)
void	MarkNeighbor (Triangle &t)
void	MarkConstrainedEdge (const int index)
void	MarkConstrainedEdge (Edge &edge)
void	MarkConstrainedEdge (Point *p, Point *q)
int	Index (const Point *p)
int	EdgeIndex (const Point *p1, const Point *p2)
Triangle *	NeighborCW (Point &point)
Triangle *	NeighborCCW (Point &point)
bool	GetConstrainedEdgeCCW (Point &p)
bool	GetConstrainedEdgeCW (Point &p)
void	SetConstrainedEdgeCCW (Point &p, bool ce)
void	SetConstrainedEdgeCW (Point &p, bool ce)
bool	GetDelunayEdgeCCW (Point &p)
bool	GetDelunayEdgeCW (Point &p)
void	SetDelunayEdgeCCW (Point &p, bool e)
void	SetDelunayEdgeCW (Point &p, bool e)
bool	Contains (Point *p)
bool	Contains (const Edge &e)
bool	Contains (Point *p, Point *q)
void	Legalize (Point &point)
void	Legalize (Point &opoint, Point &npoint)
void	Clear ()
	Clears all references to all other triangles and points. More...
void	ClearNeighbor (Triangle *triangle)
void	ClearNeighbors ()
void	ClearDelunayEdges ()
bool	IsInterior ()
void	IsInterior (bool b)
Triangle *	NeighborAcross (Point &opoint)
void	DebugPrint ()

Public Attributes
bool	constrained_edge [3]
	Flags to determine if an edge is a Constrained edge. More...
bool	delaunay_edge [3]
	Flags to determine if an edge is a Delauney edge. More...

Private Attributes
Point *	points_ [3]
	Triangle points. More...
Triangle *	neighbors_ [3]
	Neighbor list. More...
bool	interior_
	Has this triangle been marked as an interior triangle? More...

Detailed Description

Definition at line 152 of file shapes.h.

Constructor & Destructor Documentation

p2t::Triangle::Triangle	(	Point &	a,
		Point &	b,
		Point &	c
	)

Constructor.

Member Function Documentation

void p2t::Triangle::Clear

(

)

Clears all references to all other triangles and points.

void p2t::Triangle::ClearDelunayEdges

(

)

void p2t::Triangle::ClearNeighbor

(

Triangle *

triangle

)

void p2t::Triangle::ClearNeighbors

(

)

bool p2t::Triangle::Contains ( Point *  p )

inline

Definition at line 298 of file shapes.h.

{
  return p == points_[0] || p == points_[1] || p == points_[2];
}

bool p2t::Triangle::Contains ( const Edge &  e )

inline

Definition at line 303 of file shapes.h.

References p2t::Edge::p, and p2t::Edge::q.

{
  return Contains(e.p) && Contains(e.q);
}

bool p2t::Triangle::Contains ( Point *  p, Point *  q  )

inline

Definition at line 308 of file shapes.h.

{
  return Contains(p) && Contains(q);
}

void p2t::Triangle::DebugPrint

(

)

int p2t::Triangle::EdgeIndex	(	const Point *	p1,
		const Point *	p2
	)

bool p2t::Triangle::GetConstrainedEdgeCCW

(

Point &

p

)

bool p2t::Triangle::GetConstrainedEdgeCW

(

Point &

p

)

bool p2t::Triangle::GetDelunayEdgeCCW

(

Point &

p

)

bool p2t::Triangle::GetDelunayEdgeCW

(

Point &

p

)

Triangle * p2t::Triangle::GetNeighbor ( const int &  index )

inline

Definition at line 293 of file shapes.h.

{
  return neighbors_[index];
}

Point * p2t::Triangle::GetPoint ( const int &  index )

inline

Definition at line 288 of file shapes.h.

Referenced by Convert_shape_line_polygon_to_triangles().

{
  return points_[index];
}

int p2t::Triangle::Index

(

const Point *

p

)

bool p2t::Triangle::IsInterior ( )

inline

Definition at line 313 of file shapes.h.

{
  return interior_;
}

void p2t::Triangle::IsInterior ( bool  b )

inline

Definition at line 318 of file shapes.h.

{
  interior_ = b;
}

void p2t::Triangle::Legalize

(

Point &

point

)

void p2t::Triangle::Legalize	(	Point &	opoint,
		Point &	npoint
	)

void p2t::Triangle::MarkConstrainedEdge

(

const int

index

)

void p2t::Triangle::MarkConstrainedEdge

(

Edge &

edge

)

void p2t::Triangle::MarkConstrainedEdge	(	Point *	p,
		Point *	q
	)

void p2t::Triangle::MarkNeighbor	(	Point *	p1,
		Point *	p2,
		Triangle *	t
	)

void p2t::Triangle::MarkNeighbor

(

Triangle &

t

)

Triangle* p2t::Triangle::NeighborAcross

(

Point &

opoint

)

Triangle* p2t::Triangle::NeighborCCW

(

Point &

point

)

Triangle* p2t::Triangle::NeighborCW

(

Point &

point

)

Point* p2t::Triangle::OppositePoint	(	Triangle &	t,
		Point &	p
	)

Point* p2t::Triangle::PointCCW

(

Point &

point

)

Point* p2t::Triangle::PointCW

(

Point &

point

)

void p2t::Triangle::SetConstrainedEdgeCCW	(	Point &	p,
		bool	ce
	)

void p2t::Triangle::SetConstrainedEdgeCW	(	Point &	p,
		bool	ce
	)

void p2t::Triangle::SetDelunayEdgeCCW	(	Point &	p,
		bool	e
	)

void p2t::Triangle::SetDelunayEdgeCW	(	Point &	p,
		bool	e
	)

Member Data Documentation

bool p2t::Triangle::constrained_edge[3]

Flags to determine if an edge is a Constrained edge.

Definition at line 159 of file shapes.h.

bool p2t::Triangle::delaunay_edge[3]

Flags to determine if an edge is a Delauney edge.

Definition at line 161 of file shapes.h.

bool p2t::Triangle::interior_

private

Has this triangle been marked as an interior triangle?

Definition at line 218 of file shapes.h.

Triangle* p2t::Triangle::neighbors_[3]

private

Neighbor list.

Definition at line 215 of file shapes.h.

Point* p2t::Triangle::points_[3]

private

Triangle points.

Definition at line 213 of file shapes.h.

---

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

• shapes.h