#include <vector>
#include <cstddef>
#include <assert.h>
#include <cmath>
|
| p2t |
| Sweep-line, Constrained Delauney Triangulation (CDT) See: Domiter, V.
|
|
|
bool | p2t::cmp (const Point *a, const Point *b) |
|
Point | p2t::Cross (const double s, const Point &a) |
| Perform the cross product on a scalar and a point. More...
|
|
double | p2t::Cross (const Point &a, const Point &b) |
| Perform the cross product on two vectors. In 2D this produces a scalar. More...
|
|
Point | p2t::Cross (const Point &a, double s) |
| Perform the cross product on a point and a scalar. More...
|
|
double | p2t::Dot (const Point &a, const Point &b) |
| Peform the dot product on two vectors. More...
|
|
bool | p2t::operator!= (const Point &a, const Point &b) |
|
Point | p2t::operator* (double s, const Point &a) |
| Multiply point by scalar. More...
|
|
Point | p2t::operator+ (const Point &a, const Point &b) |
| Add two points_ component-wise. More...
|
|
Point | p2t::operator- (const Point &a, const Point &b) |
| Subtract two points_ component-wise. More...
|
|
bool | p2t::operator== (const Point &a, const Point &b) |
|