|
CDT
1.4.5
C++ library for constrained Delaunay triangulation
|
Edge connecting two vertices: vertex with smaller index is always first. More...
#include <CDTUtils.h>
Public Member Functions | |
| Edge (const VertInd iV1, const VertInd iV2) | |
| Constructor. | |
| bool | operator== (const Edge &other) const |
| Equals operator. | |
| bool | operator!= (const Edge &other) const |
| Not-equals operator. | |
| VertInd | v1 () const |
| V1 getter. | |
| VertInd | v2 () const |
| V2 getter. | |
| const std::pair< VertInd, VertInd > & | verts () const |
| Edges' vertices. | |
Edge connecting two vertices: vertex with smaller index is always first.
Definition at line 286 of file CDTUtils.h.
Constructor.
Definition at line 289 of file CDTUtils.h.
|
inline |
Not-equals operator.
Definition at line 301 of file CDTUtils.h.
|
inline |
Equals operator.
Definition at line 295 of file CDTUtils.h.
|
inline |
V1 getter.
Definition at line 307 of file CDTUtils.h.
|
inline |
V2 getter.
Definition at line 313 of file CDTUtils.h.
Edges' vertices.
Definition at line 319 of file CDTUtils.h.