p2t Namespace Reference

Classes
struct	Point
struct	Edge
class	Triangle
struct	Node
class	AdvancingFront
class	CDT
class	Sweep
class	SweepContext

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)
Point	Cross (const double s, const Point &a)
Orientation	Orient2d (const Point &pa, const Point &pb, const Point &pc)
bool	InScanArea (Point &pa, Point &pb, Point &pc, 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

Detailed Description

Author

Mason Green mason.nosp@m..gre.nosp@m.en@gm.nosp@m.ail..nosp@m.com

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.nosp@m.en@g.nosp@m.mail..nosp@m.com

Enumeration Type Documentation

Orientation

enum p2t::Orientation

Enumerator
CW
CCW
COLLINEAR

Function Documentation

cmp()

bool p2t::cmp ( const Point * a, const Point * b )

inline

Cross() [1/3]

Point p2t::Cross ( const double s, const Point & a )

inline

Perform the cross product on a scalar and a point. In 2D this produces a point.

Cross() [2/3]

double p2t::Cross ( const Point & a, const Point & b )

inline

Perform the cross product on two vectors. In 2D this produces a scalar.

Cross() [3/3]

Point p2t::Cross ( const Point & a, double s )

inline

Perform the cross product on a point and a scalar. In 2D this produces a point.

Dot()

double p2t::Dot ( const Point & a, const Point & b )

inline

Peform the dot product on two vectors.

InScanArea()

bool p2t::InScanArea	(	Point &	pa,
		Point &	pb,
		Point &	pc,
		Point &	pd )

operator!=()

bool p2t::operator!= ( const Point & a, const Point & b )

inline

operator*()

Point p2t::operator* ( double s, const Point & a )

inline

Multiply point by scalar.

operator+()

Point p2t::operator+ ( const Point & a, const Point & b )

inline

Add two points_ component-wise.

operator-()

Point p2t::operator- ( const Point & a, const Point & b )

inline

Subtract two points_ component-wise.

operator==()

bool p2t::operator== ( const Point & a, const Point & b )

inline

Orient2d()

Orientation p2t::Orient2d	(	const Point &	pa,
		const Point &	pb,
		const Point &	pc )

Formula to calculate signed area
Positive if CCW
Negative if CW
0 if collinear

A[P1,P2,P3]  =  (x1*y2 - y1*x2) + (x2*y3 - y2*x3) + (x3*y1 - y3*x1)
             =  (x1-x3)*(y2-y3) - (y1-y3)*(x2-x3)

Variable Documentation

EPSILON

const double p2t::EPSILON = 1e-12

kAlpha

const double p2t::kAlpha = 0.3

PI_3div4

const double p2t::PI_3div4 = 3 * M_PI / 4

PI_div2

const double p2t::PI_div2 = 1.57079632679489661923