|
void | remove () |
void | remove (TriList< Tri > &triList) |
void | flip (TriIndex index) |
| Tri (const Coordinate &c0, const Coordinate &c1, const Coordinate &c2) |
void | setAdjacent (Tri *p_tri0, Tri *p_tri1, Tri *p_tri2) |
void | setAdjacent (const Coordinate &pt, Tri *tri) |
void | setTri (TriIndex edgeIndex, Tri *tri) |
void | validate () |
void | validateAdjacent (TriIndex index) |
std::pair< const Coordinate &, const Coordinate & > | getEdge (Tri *neighbor) const |
const Coordinate & | getEdgeStart (TriIndex i) const |
const Coordinate & | getEdgeEnd (TriIndex i) const |
bool | hasCoordinate (const Coordinate &v) const |
const Coordinate & | getCoordinate (TriIndex i) const |
TriIndex | getIndex (const Coordinate &p) const |
TriIndex | getIndex (const Tri *tri) const |
Tri * | getAdjacent (TriIndex i) const |
bool | hasAdjacent (TriIndex i) const |
bool | hasAdjacent () const |
bool | isAdjacent (Tri *tri) const |
int | numAdjacent () const |
bool | isInteriorVertex (TriIndex index) const |
bool | isBorder () const |
bool | isBoundary (TriIndex index) const |
Coordinate | midpoint (TriIndex edgeIndex) const |
double | getArea () const |
double | getLength () const |
double | getLength (TriIndex i) const |
std::unique_ptr< Polygon > | toPolygon (const GeometryFactory *gf) const |
A memory-efficient representation of a triangle in a triangulation. Contains three vertices, and links to adjacent Tris for each edge. Tris are constructed independently, and if needed linked into a triangulation using TriangulationBuilder
.
- Author
- Martin Davis