Horizon
|
Sweep-line, Constrained Delauney Triangulation (CDT) See: Domiter, V. More...
Classes | |
class | AdvancingFront |
class | CDT |
struct | Edge |
struct | Node |
struct | Point |
class | Sweep |
class | SweepContext |
class | Triangle |
Enumerations | |
enum | Orientation { CW, CCW, COLLINEAR } |
Functions | |
bool | cmp (const Point *a, const Point *b) |
Point | operator+ (const Point &a, const Point &b) |
Add two points_ component-wise. | |
Point | operator- (const Point &a, const Point &b) |
Subtract two points_ component-wise. | |
Point | operator* (double s, const Point &a) |
Multiply point by scalar. | |
bool | operator== (const Point &a, const Point &b) |
bool | operator!= (const Point &a, const Point &b) |
double | Dot (const Point &a, const Point &b) |
Peform the dot product on two vectors. | |
double | Cross (const Point &a, const Point &b) |
Perform the cross product on two vectors. In 2D this produces a scalar. | |
Point | Cross (const Point &a, double s) |
Perform the cross product on a point and a scalar. More... | |
Point | Cross (double s, const Point &a) |
Perform the cross product on a scalar and a point. More... | |
Orientation | Orient2d (const Point &pa, const Point &pb, const Point &pc) |
Forumla to calculate signed area Positive if CCW Negative if CW 0 if collinear More... | |
bool | InScanArea (const Point &pa, const Point &pb, const Point &pc, const Point &pd) |
Variables | |
const double | PI_3div4 = 3 * M_PI / 4 |
const double | PI_div2 = 1.57079632679489661923 |
const double | EPSILON = 1e-12 |
const double | kAlpha = 0.3 |
Sweep-line, Constrained Delauney Triangulation (CDT) See: Domiter, V.
and Zalik, B.(2008)'Sweep-line algorithm for constrained Delaunay triangulation', International Journal of Geographical Information Science
"FlipScan" Constrained Edge Algorithm invented by Thomas ?hl?n, thahl en@g mail. com
Perform the cross product on a point and a scalar.
In 2D this produces a point.
Perform the cross product on a scalar and a point.
In 2D this produces a point.