p2t::Triangle Class Reference

#include <libosmscout-map-opengl/include/poly2tri/common/shapes.h>

Public Member Functions
	Triangle (Point &a, Point &b, Point &c)
	Constructor.
Point *	GetPoint (const int &index) const
Point *	PointCW (const Point &point) const
Point *	PointCCW (const Point &point) const
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 ()
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.
bool	delaunay_edge [3]
	Flags to determine if an edge is a Delauney edge.

Constructor & Destructor Documentation

Triangle()

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

Constructor.

Member Function Documentation

Clear()

void p2t::Triangle::Clear

(

)

Clears all references to all other triangles and points

ClearDelunayEdges()

void p2t::Triangle::ClearDelunayEdges

(

)

ClearNeighbor()

void p2t::Triangle::ClearNeighbor

(

Triangle *

triangle

)

ClearNeighbors()

void p2t::Triangle::ClearNeighbors

(

)

Contains() [1/3]

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

inline

Contains() [2/3]

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

inline

Contains() [3/3]

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

inline

DebugPrint()

void p2t::Triangle::DebugPrint

(

)

EdgeIndex()

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

GetConstrainedEdgeCCW()

bool p2t::Triangle::GetConstrainedEdgeCCW

(

Point &

p

)

GetConstrainedEdgeCW()

bool p2t::Triangle::GetConstrainedEdgeCW

(

Point &

p

)

GetDelunayEdgeCCW()

bool p2t::Triangle::GetDelunayEdgeCCW

(

Point &

p

)

GetDelunayEdgeCW()

bool p2t::Triangle::GetDelunayEdgeCW

(

Point &

p

)

GetNeighbor()

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

inline

GetPoint()

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

inline

Index()

int p2t::Triangle::Index

(

const Point *

p

)

IsInterior() [1/2]

bool p2t::Triangle::IsInterior ( )

inline

IsInterior() [2/2]

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

inline

Legalize() [1/2]

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

Legalize() [2/2]

void p2t::Triangle::Legalize

(

Point &

point

)

MarkConstrainedEdge() [1/3]

void p2t::Triangle::MarkConstrainedEdge

(

const int

index

)

MarkConstrainedEdge() [2/3]

void p2t::Triangle::MarkConstrainedEdge

(

Edge &

edge

)

MarkConstrainedEdge() [3/3]

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

MarkNeighbor() [1/2]

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

MarkNeighbor() [2/2]

void p2t::Triangle::MarkNeighbor

(

Triangle &

t

)

NeighborAcross()

Triangle & p2t::Triangle::NeighborAcross

(

Point &

opoint

)

NeighborCCW()

Triangle * p2t::Triangle::NeighborCCW

(

Point &

point

)

NeighborCW()

Triangle * p2t::Triangle::NeighborCW

(

Point &

point

)

OppositePoint()

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

PointCCW()

Point * p2t::Triangle::PointCCW

(

const Point &

point

)

const

PointCW()

Point * p2t::Triangle::PointCW

(

const Point &

point

)

const

SetConstrainedEdgeCCW()

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

SetConstrainedEdgeCW()

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

SetDelunayEdgeCCW()

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

SetDelunayEdgeCW()

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

Member Data Documentation

constrained_edge

bool p2t::Triangle::constrained_edge[3]

Flags to determine if an edge is a Constrained edge.

delaunay_edge

bool p2t::Triangle::delaunay_edge[3]

Flags to determine if an edge is a Delauney edge.

---

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

• libosmscout-map-opengl/include/poly2tri/common/shapes.h