triangle data
More...
#include <delaunay_triangulation.h>
◆ Triangle()
create triangle with index and edges
- Parameters
-
id | Id number of this triangle |
e0 | raw pointer to the first edge instance |
e1 | raw pointer to the second edge instance |
e2 | raw pointer to the third edge instance |
pointers to the vertices are automatically set from edges.
◆ circumcenter()
const Vector2D & rcsc::DelaunayTriangulation::Triangle::circumcenter |
( |
| ) |
const |
|
inline |
get the circumcenter point of this triangle
- Returns
- coordinates of the circumcenter
◆ circumradius()
double rcsc::DelaunayTriangulation::Triangle::circumradius |
( |
| ) |
const |
|
inline |
get the radius of the circumcircle of this triangle
- Returns
- radius value
◆ contains()
bool rcsc::DelaunayTriangulation::Triangle::contains |
( |
const Vector2D & |
pos | ) |
const |
|
inline |
check if circumcircle contains the specified point
- Parameters
-
- Returns
- true if target point is contained
◆ edge()
Edge * rcsc::DelaunayTriangulation::Triangle::edge |
( |
std::size_t |
i | ) |
const |
|
inline |
get the raw pointer to the edge that this triangle has
- Parameters
-
- Returns
- raw pointer to the edge
◆ getEdgeExclude()
Edge * rcsc::DelaunayTriangulation::Triangle::getEdgeExclude |
( |
const Vertex * |
v | ) |
const |
|
inline |
get the pointer to the edge that does not have the specified vertex.
- Parameters
-
- Returns
- if exist, raw pointer to the edge, else NULL is returned.
◆ getEdgeInclude()
Edge * rcsc::DelaunayTriangulation::Triangle::getEdgeInclude |
( |
const Vertex * |
v1, |
|
|
const Vertex * |
v2 |
|
) |
| const |
|
inline |
get the pointer to the edge that has the specified vertices.
- Parameters
-
v1 | first vertex |
v2 | second vertex |
- Returns
- if exist, raw pointer to the edge, else NULL is returned.
◆ getVertexExclude() [1/2]
const Vertex * rcsc::DelaunayTriangulation::Triangle::getVertexExclude |
( |
const Edge * |
edge | ) |
const |
|
inline |
get the pointer to the vertex that does not belong to the specified edge.
- Parameters
-
- Returns
- if exist, const pointer to the vertex, else NULL is returned.
◆ getVertexExclude() [2/2]
const Vertex * rcsc::DelaunayTriangulation::Triangle::getVertexExclude |
( |
const Vertex * |
v1, |
|
|
const Vertex * |
v2 |
|
) |
| const |
|
inline |
get the pointer to the vertex that is different from the specified vertices.
- Parameters
-
v1 | first vertex |
v2 | second vertex |
- Returns
- if exist, const pointer to the vertex. else NULL is returned.
◆ hasEdge()
bool rcsc::DelaunayTriangulation::Triangle::hasEdge |
( |
const EdgePtr |
e | ) |
const |
|
inline |
check if this triangle has the specified edge.
- Parameters
-
e | raw pointer to the edge. |
- Returns
- true if edge is contained.
◆ hasVertex()
bool rcsc::DelaunayTriangulation::Triangle::hasVertex |
( |
const Vertex * |
v | ) |
const |
|
inline |
check if this triangle has the specified vertex.
- Parameters
-
v | raw pointer to the vertex. |
- Returns
- true if vertex is contained.
◆ id()
int rcsc::DelaunayTriangulation::Triangle::id |
( |
| ) |
const |
|
inline |
get the Id of this triangle
- Returns
- Id number
◆ vertex()
const Vertex * rcsc::DelaunayTriangulation::Triangle::vertex |
( |
std::size_t |
i | ) |
const |
|
inline |
get the raw pointer to the vertex that this triangle has
- Parameters
-
- Returns
- const pointer to the vertex
◆ voronoiVertex()
const Vector2D & rcsc::DelaunayTriangulation::Triangle::voronoiVertex |
( |
| ) |
const |
|
inline |
get the voronoi vertex point
- Returns
- coordinate of the voronoi vertex point. if illegal data, invalid vector is returned.
The documentation for this class was generated from the following file: