#include <shapes.h>
|
| 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 () |
|
Definition at line 152 of file shapes.h.
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.
Point * points_[3]
Triangle points.
bool p2t::Triangle::Contains |
( |
const Edge & |
e | ) |
|
|
inline |
bool p2t::Triangle::Contains |
( |
Point * |
p, |
|
|
Point * |
q |
|
) |
| |
|
inline |
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.
Triangle * neighbors_[3]
Neighbor list.
Point * p2t::Triangle::GetPoint |
( |
const int & |
index | ) |
|
|
inline |
int p2t::Triangle::Index |
( |
const Point * |
p | ) |
|
bool p2t::Triangle::IsInterior |
( |
| ) |
|
|
inline |
Definition at line 313 of file shapes.h.
bool interior_
Has this triangle been marked as an interior triangle?
void p2t::Triangle::IsInterior |
( |
bool |
b | ) |
|
|
inline |
Definition at line 318 of file shapes.h.
bool interior_
Has this triangle been marked as an interior triangle?
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 |
( |
Triangle & |
t | ) |
|
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 |
|
) |
| |
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.
Neighbor list.
Definition at line 215 of file shapes.h.
Point* p2t::Triangle::points_[3] |
|
private |
The documentation for this class was generated from the following file: