libosmscout 0.1
Loading...
Searching...
No Matches
p2t::Triangle Class Reference

#include <shapes.h>

Public Member Functions

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

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 )

Member Function Documentation

◆ Clear()

void p2t::Triangle::Clear ( )

Clears all references to all other triangles and points.

◆ ClearDelunayEdges()

void p2t::Triangle::ClearDelunayEdges ( )

References IsInterior().

◆ ClearNeighbor()

void p2t::Triangle::ClearNeighbor ( Triangle * triangle)

References 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

References Contains().

Referenced by Contains(), Contains(), Contains(), and SetDelunayEdgeCW().

◆ Contains() [3/3]

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

References Contains().

◆ DebugPrint()

void p2t::Triangle::DebugPrint ( )

References Triangle().

◆ 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

References GetNeighbor(), and Triangle().

Referenced by GetNeighbor(), and OppositePoint().

◆ GetPoint()

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

References GetPoint().

Referenced by GetPoint().

◆ Index()

int p2t::Triangle::Index ( const Point * p)

◆ IsInterior() [1/2]

bool p2t::Triangle::IsInterior ( )
inline

References IsInterior().

Referenced by ClearDelunayEdges(), IsInterior(), and IsInterior().

◆ IsInterior() [2/2]

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

References IsInterior().

◆ 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 )

References Triangle().

◆ MarkNeighbor() [2/2]

void p2t::Triangle::MarkNeighbor ( Triangle & t)

References Triangle().

◆ NeighborAcross()

Triangle & p2t::Triangle::NeighborAcross ( Point & opoint)

References Triangle().

◆ NeighborCCW()

Triangle * p2t::Triangle::NeighborCCW ( Point & point)

References Triangle().

◆ NeighborCW()

Triangle * p2t::Triangle::NeighborCW ( Point & point)

References Triangle().

◆ OppositePoint()

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

References GetNeighbor(), and Triangle().

◆ 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 )

References Contains().

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: